Number Theory Commons^™

Determinants And Invertibility In Finite Modular Systems, Osasu Omobude

Discovery Day - Daytona Beach

This project investigates determinants and matrix invertibility in finite modular systems, focusing on matrices over Zn. Using the Hill cipher as context, it examines the algebraic conditions under which a matrix is invertible in modular arithmetic. In particular, the project studies how the determinant determines invertibility, showing that a matrix over Zn is invertible if and only if its determinant is coprime with n.   The project further compares invertibility over the real numbers with invertibility over modular systems, highlighting the distinction between prime moduli Zp and composite moduli. In the prime case, matrices behave similarly to those over fields, where …

Complex Continued Fractions And Inadmissible Sequences, Carolina A. Rizzi, Holly Vanlooy

Rose-Hulman Undergraduate Mathematics Journal

Serret's Theorem says that real numbers are related by a type of Möbius transformation if and only if the tails of their regular continued fraction expansions are the same. Serret’s Theorem does not hold for Hurwitz Continued Fractions in the complex plane due to a counterexample of Lakein. By applying transformations that convert inadmissible sequences into their admissible forms, we explain Lakein's counterexample from an algorithmic perspective. We provide additional counterexamples and prove that there exists an uncountably infinite family of counterexamples.

Bridging Discrete And Continuous Systems: Fibonacci Sequences And Exponential Growth From Odes, Martyna Wojcik

Discovery Day - Daytona Beach

Bridging Discrete and Continuous Systems: Fibonacci Sequences and Exponential Growth from Ordinary Differential Equations       It has been observed that nature often exhibits specific patterns of growth and structure in biological systems and spiral formations. The Fibonacci sequence, defined as a discrete recursive sequence where each term is generated as the sum of the two preceding terms, “has been applied extensively to understand some natural phenomena” (Pakdemirli, 2023). In contrast, exponential growth describes a continuous process in which the rate of change of a quantity is proportional to its current value. Such behavior is modeled using differential equations that “produce solutions …

Visualizing Irrationality: Digit Mosaics In Okabe–Ito, Raven Quilestino-Olario

Journal of Humanistic Mathematics

Five visual mosaics translate 10,000-digit segments of well-known mathematical constants into color. For each constant, the digits are placed in a 100×100 grid read left to right and top to bottom, including the digit before the decimal point, and each digit (0–9) is mapped to a color in the Okabe–Ito palette. A matching bar chart shows the digit counts within the same window, allowing quick comparison of how evenly digits appear. The series includes π, e, √2, φ, and the Euler–Mascheroni constant γ. Together, the mosaics and counts turn numerical randomness into visual harmony while keeping the work readable for …

A Closed Form For The Pulsar Sequence, Ryan Z. Liu

Rose-Hulman Undergraduate Mathematics Journal

In this paper, we study the Pulsar Sequence, an integer sequence derived from Latin-square-based “Pulsar puzzles” introduced by the Cracking the Cryptic YouTube channel. A Pulsar puzzle consists of two interlocked spirals of circled and uncircled squares, generating the Dual and Pulsar sequences, respectively. We investigate the properties of the Pulsar puzzle and focus our work on constructing the Pulsar Sequence, allowing us to solve a Pulsar puzzle of any size. A general formula to calculate any term of the Pulsar Sequence is proposed at the end of the paper.

Multiplicity Of Laplacian Eigenvalues That Can Be Represented By Sum Of Two Squares Using Number Theory, Changfeng Zhou

Rose-Hulman Undergraduate Mathematics Journal

In this article, we use results of Number Theory to prove the conjecture on the eigenvalue problem of a 2D elliptic PDE proposed by P.Korman in his recent paper \cite{ref}: for any even integer $2k$, one can find an eigenvalue $N$ that can be represented as $N=a^{2}+b^{2}$, with integers $a\neq b$ with multiplicity $2k$, while for any odd integer $2k + 1$, one can find an integer $M$ that can be represented as $M=a^{2}+b^{2}$ with $a\neq b$ and multiplicity $2k+1$. In addition, the manuscript gives the formula to find those $N$'s.

Symmetries In Apollonian Circle Packings, Clyde Kertzer

Rose-Hulman Undergraduate Mathematics Journal

An Apollonian circle packing is generated from a Descartes quadruple (a set of four mutually tangent circles) by repeatedly filling the spaces between mutually tangent circles with further tangent circles. By studying the circles' curvatures $a,b,c,d$, two distinct types of symmetric packings appear: one where $a+b+c=d$ and one where $c=d$. We give complete parameterizations of these symmetric packings and count how many packings of each type are contained by a given enclosing circle.

Gauss Composition And Orthogonal Modular Forms On Binary Lattices, Haochen Wu

Dartmouth College Ph.D Dissertations

We revisit Gauss composition over a general base scheme, with a focus on orthogonal groups. We show that the Clifford and norm functors provide a discriminant-preserving equivalence of categories between binary quadratic modules and pseudoregular modules over quadratic algebras. This perspective synthesizes the constructions of Kneser and Wood, reconciling algebraic and geometric approaches and clarifying the role of orientations and the natural emergence of narrow class groups.

As an application, we restrict to lattices and show that binary orthogonal eigenforms correspond to Hecke characters. Using theta series, we show the explicit connection between Hilbert modular forms and orthogonal modular forms …

Primitive Pythagorean Triples In Lean And Reduction Modulo Odd Prime Powers, Luke Biddle

Mathematical Sciences Undergraduate Honors Theses

Primitive Pythagorean triples (PPTs) are (a,b,c) triples that satisfy the Pythagorean theorem and share no other common factors outside of 1. This project examines these PPTs reduction modulo odd prime powers by combining proof writing and number-theoretical analysis with the process of verification and formalization in the Lean proof coding language. Using the parameterization of PPTs generated by using the unit circle with additional conditions, we investigate how these triples behave modulo  for odd primes , with emphasis on counting the number of elements in the set of PPTs (a,b,c) modulo pⁿ . By using cases based on initial …

Numerical And Harmonic Analysis Of Simplex Number Parity, Hunter Dm Hannula

All NMU Master's Theses

The primary object of this thesis is the study of periodicity in the parity of simplex numbers by number-theoretic and harmonic methods. The regular d-simplex numbers are introduced geometrically, arithmetically, and combinatorially. We demonstrate that all sequences indexing even d-simplex numbers are defined by finitely many congruences in a single modulus, and are thus quasiperiodic. We therefore show that these "even index-sequences" are  particular elements in an affine space of functions, providing a natural decomposition result. We then introduce the discrete Fourier transform to construct the periodic parts of each index sequence, enabling the development of explicit forms for the …

Monomial Quadratic Identities Of Hecke Eigenforms, Trevor Vilardi

All Dissertations

Duke and Ghate independently studied the question of when it is possible for the product of two eigenforms to be an eigenform. In this dissertation, we take up a generalization of that question, namely is it possible for the product of two eigenforms to be equal to a different product of two eigenforms? Under this formulation, the question becomes closer to one about unique factorization, i.e., how closely do eigenforms work like irreducible elements? Our conjecture is that there are only finitely many cases where the product of two eigenforms is equal to a different product of two eigenforms, and …

Sumset Lower Bounds In Abelian Groups, Van T. Huynh

Honors Theses

This thesis investigates sumset lower bounds across discrete and continuous settings. We begin with general inequalities in torsion-free abelian groups and then specialize to the integers modulo prime p, where we present the Cauchy–Davenport Theorem, which establishes the bound ∣A+B∣≥min(p,∣A∣+∣B∣−1). The equality case is further examined via Vosper's Theorem, which characterizes subsets attaining this bound as arithmetic progressions under suitable conditions. The continuous analogue in Euclidean spaces is then considered, where cardinality is replaced by Lebesgue measure. In this setting, the Brunn–Minkowski Inequality provides a sharp lower bound for the Lebesgue measure of A+B and serves as a geometric counterpart …

When A Sum Of Cubes Equals The Square Of The Sum, Jessica M. Aguilar

Electronic Theses, Projects, and Dissertations

This thesis investigates extensions and structural generalizations of the classical identity \[ \sum_{k=1}^{n} k^3 = \left( \sum_{k=1}^{n} k \right)^2, \] traditionally attributed to Nicomachus of Gerasa. Despite its simple look, this cube - square identity reveals connections between combinatorics, multiplicative number theory, and Diophantine equations.

We begin by presenting an expanded combinatorial proof of the identity based on Stein’s rectangle - counting argument, clarifying the geometric structure underlying the formula. We then establish a multiplicative analogue using Euler’s divisor-counting function \( \tau(n) \), proving that \[ \sum_{d \mid n} \tau(d)^3 = \left( \sum_{d \mid n} \tau(d) \right)^2, \] thereby extending …

From Counting To Advanced Math: How Five Simple Axioms Shape The Mathematical Landscape, Joy Skaggs

ATU Scholars Symposium

In the late nineteenth and early twentieth centuries, mathematics faced a foundational crisis: Greog Cantor’s set theory led to an interesting self-referencing paradox in math and questions about the logical consistency of mathematics. From this crisis, two opposing viewpoints emerged: the Formalists and the Intuitionists. The Formalists praised Cantor’s work as a way to place math on a secure logical foundation, ensuring the discipline’s purity, however the Intuitionists despised Cantor’s work and heralded Cantor as a charlatan and corrupter of the youth. The leader of the Formalists, David Hilbert, proposed a formal system of rigorous proofs to build a complete …

The Modern History Of The Basel Problem, John Campbell, Paul Levrie

Euleriana

The \emph{Basel problem} refers to the problem of determining a closed form for the infinite series $\frac{1}{1^2} + \frac{1}{2^2} + \cdots$. If we consider what mathematical results have the most peer-reviewed papers devoted to new ways of proving such results, Euler's formula $\frac{1}{1^2} + \frac{1}{2^2} + \cdots = \frac{\pi^2}{6}$ is certainly among the top of such results. This motivates our historical study of peer-reviewed papers based on proofs of Euler's formula, and we introduce what appears to be the most comprehensive and up-to-date and exhaustive catalogue of peer-reviewed, published papers in the 20th and 21st centuries devoted to or mainly …

A Virtual Community Math Circle, Skona Brittain, Sayonita Ghosh Hajra, Steve Heller, Daniel Hodgins, Peter Petto, Gabriella Pinter, Lauren Rose, A. Gwinn Royal, Asmita Sodhi

Journal of Math Circles

The Julia Robinson Mathematics Festival (JRMF) Community Math Circle is free, volunteer-run, and online. We collaborate with JRMF and use their activities in our events. Started during the pandemic, the Community Math Circle continues to thrive. We have about 40 participants attending every month, typically kids aged 6 to 13, teachers, facilitators, and other adults. This article describes how our event is organized, planned, and executed, and how we train facilitators. We will also offer reflections on our successes and challenges.

Polygonal Number Similarity, Gunhan Caglayan

Journal of Humanistic Mathematics

This note takes an exploratory approach to define and then visualize the notion of polygonal number similarity between pairs of k-gonal numbers P_k(αn) and P_k(n) , where α is an integer scale factor of 2 or greater.

The Interaction Between Additive And Multiplicative Structures In Arithmetic Settings, Ali Alsetri

Theses and Dissertations--Mathematics

The first part of this thesis is concerned with Goldbach-type problems. In recent years, there has been an interest in developing density versions of Goldbach-type results. Namely, given a relatively dense subset A of the primes, one may study representations of integers as sums of primes belonging to the subset A. These density Goldbach-type results have been facilitated by the development of new tools from additive combinatorics, in particular the Fourier-analytic transference principle due to Green. We apply the transference principle to obtain a variant of Vinogradov’s theorem involving subsets of primes confined to the residue class 1 (mod 3). …

A New Parallel-In-Time Direct Inverse Method For Nonlinear Differential Equations, Nail K. Yamaleev, Subhash Paudel

Mathematics & Statistics Faculty Publications

We propose a new method for parallelization of the first-order backward difference discretization (BDF1) of the first-order time derivative in nonlinear partial differential equations, such as conservation law equations. The time derivative term is discretized by using the method of lines based on the implicit BDF1 scheme, while the inviscid and viscous terms are approximated by conventional 2nd-order central discretizations of the 1st- and 2nd-order derivatives in each spatial direction. The global system of nonlinear discrete equations in the space-time domain is solved by the Newton method for all time levels simultaneously. For the BDF1 discretization, this all-at-once system at …

Discussion Of The Collatz Conjecture, Morgan Hayes

Student Scholar Symposium

The Collatz conjecture was introduced in 1937, but, despite the efforts of many mathematicians, it has yet to be proven. It appears to have very little connection to other areas of mathematics, although some aspects of it allude to questions similar to those asked in studies of prime numbers and the Riemann Hypothesis. The nature of the Collatz sequence allows it to be useful in cryptography and semi-random number generation. Some, including Craig Alan Feinstein, believe a formal proof of the conjecture is not possible. Others believe mathematics has not been developed enough to resolve the issue. To enter into …

(R2094) On Mds Bisymmetric Rhotrices Using Self-Dual Bases And Conjugate Elements Of Finite Fields, Shalini Gupta, Ruchi Narang, Manpreet Singh

Applications and Applied Mathematics: An International Journal (AAM)

Bisymmetric matrices have wide range of applications in statistics, engineering problems, information theory and computer science including coding theory and cryptography. In cryptography, a rhotrix being a couple matrix doubles the security of the cryptosystem. Here, we construct maximum distance separable (MDS) bisymmetric rhotrices using self-dual bases and conjugate elements of finite fields. MDS rhotrices are very crucial for the designing of block ciphers and hash functions in cryptography.

(Si15-022) Five Efficient Cryptography Authentication Schemes With Functional Relation On General Spaces, L. Sreenivasulu Reddy, S. Lakshmisri

Applications and Applied Mathematics: An International Journal (AAM)

This work addresses the growing demand for diversification in cryptographic schemes to secure communication. This work proposes a novel suite of algorithms, including two block ciphers (TPBlock and TAP-Block), two stream ciphers (TP-Stream and TAP-Stream), and a zero-knowledge proof scheme (F-zero knowledge proof). All schemes leverage functional relations defined over the real number space with a dimension greater than one for encryption, decryption, and key generation, offering an alternative to the number-theoretical aspects and algebraic structures commonly used in existing schemes. The main goal of this work is to introduce and propose these five novel cryptographic schemes to provide authentication …

(Si15-064) Permutation Pentanomials Over Finite Fields With Even Characteristic, Shalini Gupta, Sushil Kumar, Ashima .

Applications and Applied Mathematics: An International Journal (AAM)

Permutation polynomials over finite fields constitute an active area of research and play an important role in diverse domains, including finite geometry, combinatorial design, coding theory, and cryptography. The study of these polynomials has a long history, and many results have been obtained in recent years. This paper presents new classes of permutation pentanomials based on permutation over the unit circle of finite fields with even characteristic that contribute to the theoretical development of permutation polynomials.

Incremental Increases Between Successive Integers When Raised To The Nth Power, Sutton J. Olesen

Rose-Hulman Undergraduate Mathematics Journal

For thousands of years, the beautiful field of number theory has captivated mathematicians with its elegant simplicity. Positive integers continue to reveal properties and relationships that are a joy to uncover, and in this paper, we investigate a pattern involving exponents and factorials while exploring some common notations in the field of number theory. Combinatorics, the field dealing with the mathematics of counting and arranging, also holds a presence in this paper. Pascal’s Triangle–the foundation of binomial expressions, also comes into play due to its tight relationship with combinatorics. Pascal’s Identity, the property that builds the triangle, becomes very useful …

An Interpolating Regime For The Extreme Values Of A Random Zeta Model, Christine K. Chang

Dissertations, Theses, and Capstone Projects

We study the large values of a random model of the Riemann zeta function over short intervals. The extreme value statistics depend on the interval size: the log-correlated regime governs intervals of order one while the i.i.d. regime emerges over longer intervals. The main focus is to describe the transition between these two well-understood regimes as the interval varies in length. This thesis shows that there is an intermediate regime where the behavior of the zeta model’s maxima cannot be entirely captured by either extreme— i.i.d. or fully log-correlated. This suggests that the Riemann zeta function exhibits correlations around its …

Universal Centralizers, Morita Abelianization, And Wonderful Models In Lie Theory, Peter Crooks

Funded Research Records

No abstract provided.

Parametrization Of Formal Norm Compatible Sequences, Joseph Dicapua

Dissertations, Theses, and Capstone Projects

We give a classification of power series parametrizing Lubin-Tate trace compatible sequences. This proof answers a question posed in the literature by Berger and Fourquaux. Lubin-Tate trace compatible sequences are a generalization of norm compatible sequences, which arise in Iwasawa theory and local class field theory. The result we prove generalizes the interpolation theorem proved by Coleman in the classical norm compatible sequence case. We also, jointly with Victor Kolyvagin, give a method for finding such series explicitly in certain special cases.

Langlands Reciprocity And The Splitting Behavior Of Primes In Number Fields, Skip E. Moses

Master's Theses

This thesis explores the evolution of reciprocity laws in number theory in order to provide a conceptual bridge between the classical ideas of quadratic reciprocity and the modern framework of the Langlands program. We develop the necessary algebraic background to understand how the splitting behavior of primes in number fields reflects deep arithmetic structure in ℚ. Starting with quadratic fields and cyclotomic extensions, we motivate the development of the Kronecker–Weber theorem and the characterization of abelian extensions of ℚ. We then introduce Artin reciprocity and show how it generalizes quadratic reciprocity through the formalism of Frobenius elements and Artin L-functions. …

A Study Of The Sum Of Divisors, Henry M. Willie

Miners Solving for Tomorrow Research Conference

No abstract provided.

Algorithms For Order Statistics In Farey Sequences: A Computational Study, Connor Weyers

School of Computing: Dissertations, Theses, and Student Research

Farey sequences are the sets of irreducible fractions in increasing order with denominator less or equal to some integer n. They are a well-known concept in number theory problems and are related to many other concepts in number theory including integer factoring, Fibonacci sequences, and Riemann’s Zeta function. In this paper, we investigate some known algorithms to solve certain problems in Farey sequences from a computational perspective. In particular, we implement established algorithms that have not been previously implemented with the goal of creating a package that can be used more broadly. We also develop a new algorithm for rational …