Answers are grounded in this paper and cite their sources.
Deterministic method generates binary trees from natural numbers by factoring prime predecessors, suggesting new computational strategies.
This preprint formalizes and evaluates a deterministic method that receives a positive natural number and generates a strictly binary expression tree whose leaves contain only the unit and whose internal nodes use addition or multiplication. The construction decomposes composite numbers into prime factors and transforms each odd prime through the identity p = (p - 1) + 1, recursively factoring the predecessor. The paper proves correctness, termination, and a logarithmic bound on tree size, and presents a reproducible experimental evaluation. Version 2 provides the complete paper and its metadata in English.
No takes yet. Share an insight, caveat, or question.
Josué Amaral (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: