Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
Articles 1 - 18 of 18
Full-Text Articles in Physical Sciences and Mathematics
Research On Arithmetic, Erik R. Tou
Research On Arithmetic, Erik R. Tou
Euleriana
In this English translation, some of Joseph-Louis Lagrange's early number theory is presented. Here, he laid out a theory of binary quadratic forms with special attention to the representation problem: determining those integers which may be represented by a given form, and cataloguing the possible forms of their divisors.
Further Generalizations Of Happy Numbers, E. Simonton Williams
Further Generalizations Of Happy Numbers, E. Simonton Williams
Rose-Hulman Undergraduate Mathematics Journal
A positive integer n is defined to be happy if iteration of the function taking the sum of the squares of the digits of n eventually reaches 1. In this paper we generalize the concept of happy numbers in several ways. First we confirm known results of Grundman and Teeple and establish further results extending the known structure of happy numbers to higher powers. Then we construct a similar function expanding the definition of happy numbers to negative integers. Working with this function, we prove a range of results paralleling those already proven for traditional and generalized happy numbers. Finally, …
Solution Of The Diophantine Equation (Maa+Nbb)=Cd(Mcc+Ndd) Using Rational Numbers, Georg Ehlers
Solution Of The Diophantine Equation (Maa+Nbb)=Cd(Mcc+Ndd) Using Rational Numbers, Georg Ehlers
Euleriana
This paper (E716) was published in Nova acta Academiae scientiarum imperialis petropolitanae, Volume 13 (1795/96), pp. 45-63. It was also included in Commentationes Arithmeticae, Volume II, as Number LXVIII, pp. 281-293 (E791). Euler starts with Fermat's Last Theorem and mentions the proofs for the cases n=3 and n=4 which he had completed himself earlier. He then moves on to make the sum of powers conjecture, which was later disproved in the second half of the 20th century. In this context he discusses his discovery of 134^4+133^4=158^4+59^4, which he calls unexpected. Euler derives the title equation from A^4+B^4=C^4+D^4, generalizing it to …
Some Thoughts On The 3 × 3 Magic Square Of Squares Problem, Desmond Weisenberg
Some Thoughts On The 3 × 3 Magic Square Of Squares Problem, Desmond Weisenberg
Rose-Hulman Undergraduate Mathematics Journal
A magic square is a square grid of numbers where each row, column, and long diagonal has the same sum (called the magic sum). An open problem popularized by Martin Gardner asks whether there exists a 3×3 magic square of distinct positive square numbers. In this paper, we expand on existing results about the prime factors of elements of such a square, and then provide a full list of the ways a prime factor could appear in one. We also suggest a separate possible computational approach based on the prime signature of the center entry of the square.
Euler Archive Spotlight, Erik R. Tou
Euler Archive Spotlight, Erik R. Tou
Euleriana
A survey of two translations posted to the Euler Archive in 2022.
Euler's Anticipations, Christopher Goff, Erik Tou
Euler's Anticipations, Christopher Goff, Erik Tou
Euleriana
Welcome to Volume 3 of Euleriana. This issue highlights occasions where Euler's work anticipated future results from other others, sometimes by decades or even centuries!
Unsolved Haiku, Scott W. Williams
Unsolved Haiku, Scott W. Williams
Journal of Humanistic Mathematics
This poem describes the still unsolved 1937 conjecture of Lloyd Collatz: Do repeated applications of the algorithm described yield the number 1?
The Genesis Of A Theorem, Osvaldo Marrero
The Genesis Of A Theorem, Osvaldo Marrero
Journal of Humanistic Mathematics
We present the story of a theorem's conception and birth. The tale begins with the circumstances in which the idea sprouted; then is the question's origin; next comes the preliminary investigation, which led to the conjecture and the proof; finally, we state the theorem. Our discussion is accessible to anyone who knows mathematical induction. Therefore, this material can be used for instruction in a variety of courses. In particular, this story may be used in undergraduate courses as an example of how mathematicians do research. As a bonus, the proof by induction is not of the simplest kind, because it …
Meertens Number And Its Variations, Chai Wah Wu
Meertens Number And Its Variations, Chai Wah Wu
Communications on Number Theory and Combinatorial Theory
In 1998, Bird introduced Meertens numbers as numbers that are invariant under a map similar to the Gödel encoding. In base 10, the only known Meertens number is 81312000. We look at some properties of Meertens numbers and consider variations of this concept. In particular, we consider variations of Meertens numbers where there is a finite time algorithm to decide whether such numbers exist, exhibit infinite families of these variations and provide bounds on parameters needed for their existence.
Squate, Tom Blackford
Squate, Tom Blackford
Journal of Humanistic Mathematics
This is the story of a middle school student who befriends an irrational number, the square root of eight.
A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian
A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian
Rose-Hulman Undergraduate Mathematics Journal
Artin’s Primitive Root Conjecture represents one of many famous problems in elementary number theory that has resisted complete solution thus far. Significant progress was made in 1967, when Christopher Hooley published a conditional proof of the conjecture under the assumption of a certain case of the Generalised Riemann Hypothesis. In this survey we present a description of the conjecture and the underlying algebraic theory, and provide a detailed account of Hooley’s proof which is intended to be accessible to those with only undergraduate level knowledge. We also discuss a result concerning the qx+1 problem, whose proof requires similar techniques to …
The Name Tag Problem, Christian Carley
The Name Tag Problem, Christian Carley
Rose-Hulman Undergraduate Mathematics Journal
The Name Tag Problem is a thought experiment that, when formalized, serves as an introduction to the concept of an orthomorphism of $\Zn$. Orthomorphisms are a type of group permutation and their graphs are used to construct mutually orthogonal Latin squares, affine planes and other objects. This paper walks through the formalization of the Name Tag Problem and its linear solutions, which center around modular arithmetic. The characterization of which linear mappings give rise to these solutions developed in this paper can be used to calculate the exact number of linear orthomorphisms for any additive group Z/nZ, which is demonstrated …
Properties Enjoyed By The Highest Digit In A Base Other Than The Base 10, Sudhir Goel, Kathy Simons
Properties Enjoyed By The Highest Digit In A Base Other Than The Base 10, Sudhir Goel, Kathy Simons
Georgia Journal of Science
The number nine in base ten enjoys some nice arithmetic properties. In this paper, we show that these properties are not intrinsic to the number nine; in fact, they are true for the largest digit in any base b. Four properties involving the final sums of all the digits of a number in a non-decimal base are explored and proofs of these properties are given in the appendix.
Prove It!, Kenny W. Moran
Prove It!, Kenny W. Moran
Journal of Humanistic Mathematics
A dialogue between a mathematics professor, Frank, and his daughter, Sarah, a mathematical savant with a powerful mathematical intuition. Sarah's intuition allows her to stumble into some famous theorems from number theory, but her lack of academic mathematical background makes it difficult for her to understand Frank's insistence on the value of proof and formality.
Some Conjectures Concerning Triangular Numbers, Bruce Brandt
Some Conjectures Concerning Triangular Numbers, Bruce Brandt
Journal of the Minnesota Academy of Science
Strong empirical evidence supports conjectures that certain number patterns always hold. These patterns concern the function cr, defined by the equation cr(n) = n - m2, m2 being the nearest square to n, on the domain of the triangular numbers. Triangular squares or triangular numbers of the form m2+m are also mentioned in most of the conjectures. One of the conjectures, for example, is that the sum of cr over the triangular numbers up to a triangular square is 0. Some of these patterns can be described by strings of symbols, such as "S" and "L," formed by first writing …
Supplement To "Some Conjectures Concerning Triangular Numbers", Bruce Brandt
Supplement To "Some Conjectures Concerning Triangular Numbers", Bruce Brandt
Journal of the Minnesota Academy of Science
In a previous paper (1), I stated many conjectures about triangular numbers. Since submitting that paper I have discovered many more results, including generalizations, which are presented here.
Irrational Numbers And Reality, Arnold H. Veldkamp
What Is Number?, Willis J. Alberda