Induction and Analogy in a Problem of Finite Sums
Ryan Zielinski

TL;DR
This paper explores methods for deriving formulas for the sum of powers of integers using analogy, heuristics, and inductive reasoning, emphasizing problem-solving and teaching approaches in number theory.
Contribution
It introduces a novel perspective on deriving finite sum formulas by focusing on heuristic and analogy-based reasoning, inspired by historical mathematicians.
Findings
Derived general formulas for sums of powers using analogy.
Highlighted the role of inductive reasoning and heuristics in mathematical discovery.
Connected historical methods to modern problem-solving approaches.
Abstract
What is a general expression for the sum of the first n integers, each raised to the mth power, where m is a positive integer? Answering this question will be the aim of the paper....We will take the unorthodox approach of presenting the material from the point of view of someone who is trying to solve the problem himself. Keywords: analogy, Johann Faulhaber, finite sums, heuristics, inductive reasoning, number theory, George Polya, problem solving, teaching of mathematics
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistory and Theory of Mathematics · Mathematics and Applications
