SearcharxivSearch

arXiv · 2512.03105

Demonstra\c{c}\~ao Formal de um Algoritmo Alternativo da Multiplica\c{c}\~ao em Base 10

Abstract

This article presents and formalizes an elementary multiplication method discovered independently by a 10-year-old student, Anthony Lima Dias. The method reorganizes digit interactions in base-10 multiplication into a structured sequence of partial sums, reducing cognitive load and allowing reliable mental or semi-written computation. We provide a full mathematical proof of correctness, a comparison with the classical algorithm, formal notation, and a detailed contextual account of the discovery. The method expands the known catalog of student-invented algorithms and raises questions about cognitive pathways in arithmetic learning. Keywords: multiplication methods, mathematics education, mental calculation, student-invented algorithms, alternative algorithms, arithmetic strategies. -- -- Este artigo apresenta e formaliza um metodo elementar de multiplicacao descoberto de forma independente por um estudante de 10 anos, Anthony Lima Dias. O metodo reorganiza as interacoes entre algarismos na multiplicacao em base 10 em uma sequencia estruturada de somas parciais, reduzindo a carga cognitiva e permitindo um calculo mental ou semi-escrito mais confiavel. Fornecemos uma demonstracao matematica completa de corretude, uma comparacao com o algoritmo tradicional, notacoes formais e um relato contextual detalhado da descoberta. O metodo amplia o catalogo conhecido de algoritmos inventados por estudantes e levanta questoes sobre caminhos cognitivos na aprendizagem aritmetica. Palavras-chave: metodos de multiplicacao, educacao matematica, calculo mental, algoritmos inventados por alunos, algoritmos alternativos, estrategias aritmeticas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Albert Lucas Lima Dias, Anthony Lima Dias, Ib Couto, Mabia Lima Chaves dos Santos, Marcus Vinícius da Conceição Morro. 2025-12-02. Demonstra\c{c}\~ao Formal de um Algoritmo Alternativo da Multiplica\c{c}\~ao em Base 10. https://arxiv.org/abs/2512.03105

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO