Article
Version 1
Preserved in Portico This version is not peer-reviewed
Exploring Polygonal Number Sieves through Computational Triangulation
Version 1
: Received: 17 November 2023 / Approved: 17 November 2023 / Online: 20 November 2023 (07:51:53 CET)
A peer-reviewed article of this Preprint also exists.
Abramovich, S. Exploring Polygonal Number Sieves through Computational Triangulation. Computation 2023, 11, 251. Abramovich, S. Exploring Polygonal Number Sieves through Computational Triangulation. Computation 2023, 11, 251.
Abstract
The paper deals with exploration of subsequences of polygonal numbers of different sides derived through step-by-step elimination of terms of the original sequences. Eliminations are based on special rules similarly to how the classic sieve of Eratosthenes was developed through the elimination of multiples of primes. These elementary number theory activities, appropriate for technology-enhanced secondary mathematics education courses, are supported by a spreadsheet, Wolfram Alpha, Maple, and the Online Encyclopedia of Integer Sequences. General formulas for subsequences of polygonal numbers referred to in the paper as polygonal number sieves of order k that include base-two exponential functions of k have been developed. Different problem-solving approaches to the derivation of such and other sieves based on the technology-immune/technology-enabled framework have been used. The accuracy of computations and mathematical reasoning is confirmed through the technique of computational triangulation enabled by using more than one digital tool. A few relevant excerpts from the history of mathematics are briefly featured.
Keywords
computation; number theory; triangulation; polygonal numbers; spreadsheet; Wolfram Alpha; Maple
Subject
Computer Science and Mathematics, Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
