Number Theory Commons^™

Using Bloom's Taxonomy For Math Outreach Within And Outside The Classroom, Manmohan Kaur

Journal of Humanistic Mathematics

Not everyone is a great artist, but we don’t often hear, “I dislike art.” Most people are able to appreciate visual arts, music and sports, without necessarily excelling in it themselves. On the other hand, the phrase “I dislike math” is widely prevalent. This is especially ironic in our current society, where mathematics affects our day-to-day activities in essential ways such as e-commerce and e-mail. This paper describes the opportunity to popularize mathematics by focusing on its fun and creative aspects, and illustrates this opportunity through a brief discussion of interdisciplinary topics that expose the beauty, elegance and value of …

Generalized Far-Difference Representations, Prakod Ngamlamai

HMC Senior Theses

Integers are often represented as a base-$b$ representation by the sum $\sum c_ib^i$. Lekkerkerker and Zeckendorf later provided the rules for representing integers as the sum of Fibonacci numbers. Hannah Alpert then introduced the far-difference representation by providing rules for writing an integer with both positive and negative multiples of Fibonacci numbers. Our work aims to generalize her work to a broader family of linear recurrences. To do so, we describe desired properties of the representations, such as lexicographic ordering, and provide a family of algorithms for each linear recurrence that generate unique representations for any integer. We then prove …

A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman

HMC Senior Theses

We can think of a pixel as a particle in three dimensional space, where its x, y and z coordinates correspond to its level of red, green, and blue, respectively. Just as a particle’s motion is guided by physical rules like gravity, we can construct rules to guide a pixel’s motion through color space. We can develop striking visuals by applying these rules, called dynamical systems, onto images using animation engines. This project explores a number of these systems while exposing the underlying algebraic structure of color space. We also build and demonstrate a Visual DJ circuit board for …

Plane Figurate Number Proofs Without Words Explained With Pattern Blocks, Gunhan Caglayan

Journal of Humanistic Mathematics

This article focuses on an artistic interpretation of pattern block designs with primary focus on the connection between pattern blocks and plane figurate numbers. Through this interpretation, it tells the story behind a handful of proofs without words (PWWs) that are inspired by such pattern block designs.

Interpolating The Riemann Zeta Function In The P-Adics, Rebecca Mamlet

Scripps Senior Theses

In this thesis, we develop the Kubota-Leopoldt Riemann zeta function in the p-adic integers. We follow Neil Koblitz's interpolation of Riemann zeta, using Bernoulli measures and p-adic integrals. The underlying goal is to better understand p-adic expansions and computations. We finish by connecting the Riemann zeta function to L-functions and their p-adic interpolations.

Arithmetics, Interrupted, Matilde Lalín

Journal of Humanistic Mathematics

I share some of my adventures in mathematical research and homeschooling in the time of COVID-19.

Computational Thinking In Mathematics And Computer Science: What Programming Does To Your Head, Al Cuoco, E. Paul Goldenberg

Journal of Humanistic Mathematics

How you think about a phenomenon certainly influences how you create a program to model it. The main point of this essay is that the influence goes both ways: creating programs influences how you think. The programs we are talking about are not just the ones we write for a computer. Programs can be implemented on a computer or with physical devices or in your mind. The implementation can bring your ideas to life. Often, though, the implementation and the ideas develop in tandem, each acting as a mirror on the other. We describe an example of how programming and …

Tiling Representations Of Zeckendorf Decompositions, John Lentfer

HMC Senior Theses

Zeckendorf’s theorem states that every positive integer can be decomposed uniquely into a sum of non-consecutive Fibonacci numbers (where f₁ = 1 and f₂ = 2). Previous work by Grabner and Tichy (1990) and Miller and Wang (2012) has found a generalization of Zeckendorf’s theorem to a larger class of recurrent sequences, called Positive Linear Recurrence Sequences (PLRS’s). We apply well-known tiling interpretations of recurrence sequences from Benjamin and Quinn (2003) to PLRS’s. We exploit that tiling interpretation to create a new tiling interpretation specific to PLRS’s that captures the behavior of the generalized Zeckendorf’s theorem.

On Properties Of Positive Semigroups In Lattices And Totally Real Number Fields, Siki Wang

CMC Senior Theses

In this thesis, we give estimates on the successive minima of positive semigroups in lattices and ideals in totally real number fields. In Chapter 1 we give a brief overview of the thesis, while Chapters 2 – 4 provide expository material on some fundamental theorems about lattices, number fields and height functions, hence setting the necessary background for the original results presented in Chapter 5. The results in Chapter 5 can be summarized as follows. For a full-rank lattice L ⊂ Rd, we are concerned with the semigroup L+ ⊆ L, which denotes the set of all vectors with nonnegative …

A Few Firsts In The Epsilon Years Of My Career, Heidi Goodson

Journal of Humanistic Mathematics

In this essay, I describe the unexpected ways I achieved some milestones in the early years of my career.

A Math Poem, Sara R. Katz

Journal of Humanistic Mathematics

No abstract provided.

Adinkras And Arithmetical Graphs, Madeleine Weinstein

HMC Senior Theses

Adinkras and arithmetical graphs have divergent origins. In the spirit of Feynman diagrams, adinkras encode representations of supersymmetry algebras as graphs with additional structures. Arithmetical graphs, on the other hand, arise in algebraic geometry, and give an arithmetical structure to a graph. In this thesis, we will interpret adinkras as arithmetical graphs and see what can be learned.

Our work consists of three main strands. First, we investigate arithmetical structures on the underlying graph of an adinkra in the specific case where the underlying graph is a hypercube. We classify all such arithmetical structures and compute some of the corresponding …

Visual Properties Of Generalized Kloosterman Sums, Paula Burkhardt '16, Alice Zhuo-Yu Chan '14, Gabriel Currier '16, Stephan Ramon Garcia, Florian Luca, Hong Suh '16

Pomona Faculty Publications and Research

For a positive integer m and a subgroup A of the unit group (Z/mZ)^x, the corresponding generalized Kloosterman sum is the function K(a, b, m, A) = Σ_uEA e(au+bu^-1/m). Unlike classical Kloosterman sums, which are real valued, generalized Kloosterman sums display a surprising array of visual features when their values are plotted in the complex plane. In a variety of instances, we identify the precise number-theoretic conditions that give rise to particular phenomena.

A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley

Scripps Senior Theses

The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this asymmetry that makes it secure.

This paper describes the mathematics (and some of the computer science) necessary to understand and compute an attack on the elliptic curve discrete logarithm problem that works in a special case. The algorithm, proposed by Nigel Smart, renders the elliptic curve discrete logarithm problem easy in both directions for elliptic curves of …

On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh

CMC Senior Theses

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

Elliptic Curves And The Congruent Number Problem, Jonathan Star

CMC Senior Theses

In this paper we explain the congruent number problem and its connection to elliptic curves. We begin with a brief history of the problem and some early attempts to understand congruent numbers. We then introduce elliptic curves and many of their basic properties, as well as explain a few key theorems in the study of elliptic curves. Following this, we prove that determining whether or not a number n is congruent is equivalent to determining whether or not the algebraic rank of a corresponding elliptic curve E_n is 0. We then introduce L-functions and explain the Birch and …

There And Back Again: Elliptic Curves, Modular Forms, And L-Functions, Allison F. Arnold-Roksandich

HMC Senior Theses

L-functions form a connection between elliptic curves and modular forms. The goals of this thesis will be to discuss this connection, and to see similar connections for arithmetic functions.

Finding Zeros Of Rational Quadratic Forms, John F. Shaughnessy

CMC Senior Theses

In this thesis, we introduce the notion of quadratic forms and provide motivation for their study. We begin by discussing Diophantine equations, the field of p-adic numbers, and the Hasse-Minkowski Theorem that allows us to use p-adic analysis determine whether a quadratic form has a rational root. We then discuss search bounds and state Cassels' Theorem for small-height zeros of rational quadratic forms. We end with a proof of Cassels' Theorem and suggestions for further reading.

Quotients Of Gaussian Primes, Stephan Ramon Garcia

Pomona Faculty Publications and Research

It has been observed many times, both in the Monthly and elsewhere, that the set of all quotients of prime numbers is dense in the positive real numbers. In this short note we answer the related question: "Is the set of all quotients of Gaussian primes dense in the complex plane?"

Rock Art Tallies: Mathematics On Stone In Western North America, James V. Rauff

Journal of Humanistic Mathematics

Western North America abounds with rock art sites. From Alberta to New Mexico and from Minnesota to California one can find the enigmatic rock paintings and rock carvings left by the pre-Columbian inhabitants. The images left behind on the rocks of the American plains and deserts are those of humanoids and animals, arrows and spears, and a variety of geometric shapes and abstract designs. Also included, in great numbers, are sequences of repeated shapes and marks that scholars have termed "tallies." The tallies are presumed to be an ancient accounting of something or some things. This article examines rock art …

Some Contributions To The Sociology Of Numbers, Robert Dawson

Journal of Humanistic Mathematics

Those who work with numbers eventually realize that they all have different personalities (the word "numbers" can of course be replaced by any number of other nouns here.) Here is one view of the issue.

Supercharacters, Exponential Sums, And The Uncertainty Principle, J.L. Brumbaugh '13, Madeleine Bulkow '14, Patrick S. Fleming, Luis Alberto Garcia '14, Stephan Ramon Garcia, Gizem Karaali, Matt Michal '15, Andrew P. Turner '14

Pomona Faculty Publications and Research

The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the actions of certain matrix groups, demonstrating that a variety of exponential sums of interest in number theory (e.g., Gauss, Ramanujan, and Kloosterman sums) arise in this manner. We develop a generalization of the discrete Fourier transform, in which supercharacters play the role of the Fourier exponential basis. We provide a corresponding uncertainty principle and compute the associated constants in several cases.

Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden

Scripps Senior Theses

This thesis examines the rank of elliptic curves. We first examine the correspondences between projective space and affine space, and use the projective point at infinity to establish the group law on elliptic curves. We prove a section of Mordell’s Theorem to establish that the abelian group of rational points on an elliptic curve is finitely generated. We then use homomorphisms established in our proof to find a formula for the rank, and then provide examples of computations.

A Tale Of Two Workshops: Two Workshops, Three Papers, New Ideas, Gizem Karaali

Pomona Faculty Publications and Research

No abstract provided.

Splitting Fields And Periods Of Fibonacci Sequences Modulo Primes, Sanjai Gupta, Parousia Rockstroh '08, Francis E. Su

All HMC Faculty Publications and Research

We consider the period of a Fibonacci sequence modulo a prime and provide an accessible, motivated treatment of this classical topic using only ideas from linear and abstract algebra. Our methods extend to general recurrences with prime moduli and provide some new insights. And our treatment highlights a nice application of the use of splitting fields that might be suitable to present in an undergraduate course in abstract algebra or Galois theory.

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.

Ramanujan Sums As Supercharacters, Christopher F. Fowler '12, Stephan Ramon Garcia, Gizem Karaali

Pomona Faculty Publications and Research

The theory of supercharacters, recently developed by Diaconis-Isaacs and Andre, can be used to derive the fundamental algebraic properties of Ramanujan sums. This machinery frequently yields one-line proofs of difficult identities and provides many novel formulas. In addition to exhibiting a new application of supercharacter theory, this article also serves as a blueprint for future work since some of the abstract results we develop are applicable in much greater generality.

The Combinatorialization Of Linear Recurrences, Arthur T. Benjamin, Halcyon Derks, Jennifer J. Quinn

All HMC Faculty Publications and Research

We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.

Algebraic Points Of Small Height Missing A Union Of Varieties, Lenny Fukshansky

CMC Faculty Publications and Research

Let K be a number field, Q, or the field of rational functions on a smooth projective curve over a perfect field, and let V be a subspace of K^N where N≥ 2. Let Z_K be a union of varieties defined over K such that V ⊈ Z_K. We prove the existence of a point of small height in V \ Z_K, providing an explicit upper bound on the height of such a point in terms of the height of V and the degree of hypersurface containing Z_K, where dependence on …

Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger

CMC Senior Theses

Followed two different proofs of van der Waerden's theorem. Found that the two proofs yield important information about arithmetic progressions and the theorem. van der Waerden's theorem explains the occurrence of arithmetic progressions which can be used to explain such things as the Bible Code.