Number Theory Commons^™

On Properties Of Weil Sums Of Binomials, Liem P. Nguyen

LSU Doctoral Dissertations

This dissertation explores questions regarding the Weil sum of binomials, a finite field character sum originated from information theory. The Weil spectrum counts distinct values of the Weil sum through invertible elements in the finite field. The value of these sums and the size of the Weil spectrum are of particular interest, as they link problems in information theory, coding theory, and cryptography to other areas of math such as number theory and arithmetic geometry. In the setting of Niho exponents, we prove the Vanishing Conjecture of Helleseth ($1971$) on the presence of zero values in the Weil spectrum and …

Streaming Down The Stern-Brocot Tree: Finding And Expressing Solutions To Pell's Equation In Sl(2,Z), Marcus L. Shell

Theses

This paper explores and elaborates on a method of solving Pell’s equation as introduced by Norman Wildberger. In the first chapters of the paper, foundational topics are introduced in expository style including an explanation of Pell’s equation. An explanation of continued fractions and their ability to express quadratic irrationals is provided as well as a connection to the Stern-Brocot tree and a convenient means of representation for each in terms of 2×2 matrices with integer elements. This representation will provide a useful way of navigating the Stern-Brocot tree computationally and permit us a means of computing continued fractions without the …

The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall

University Scholar Projects

The Riemann Hypothesis, posed in 1859 by Bernhard Riemann, is about zeros
of the Riemann zeta-function in the complex plane. The zeta-function can be repre-
sented as a sum over positive integers n of terms 1/ns when s is a complex number
with real part greater than 1. It may also be represented in this region as a prod-
uct over the primes called an Euler product. These definitions of the zeta-function
allow us to find other representations that are valid in more of the complex plane,
including a product representation over its zeros. The Riemann Hypothesis says that
all …

On Elliptic Curves, Montana S. Miller

Graduate Theses/Dissertations

An elliptic curve over the rational numbers is given by the equation y² = x³+Ax+B. In our thesis, we study elliptic curves. It is known that the set of rational points on the elliptic curve form a finitely generated abelian group induced by the secant-tangent addition law. We present an elementary proof of associativity using Maple. We also present a relatively concise proof of the Mordell-Weil Theorem.

2-Adic Valuations Of Square Spiral Sequences, Minh Nguyen

Honors Theses

The study of p-adic valuations is connected to the problem of factorization of integers, an essential question in number theory and computer science. Given a nonzero integer n and prime number p, the p-adic valuation of n, which is commonly denoted as νp(n), is the greatest non-negative integer ν such that p ν | n. In this paper, we analyze the properties of the 2-adic valuations of some integer sequences constructed from Ulam square spirals. Most sequences considered were diagonal sequences of the form 4n 2 + bn + c from the Ulam spiral with center value of 1. Other …

Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang

Electronic Theses and Dissertations

While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …

A Weighted Version Of Erdős-Kac Theorem, Unique Subedi

Honors Theses

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. A celebrated result of Erd{\H o}s and Kac states that $\omega(n)$ as a Gaussian distribution. In this thesis, we establish a weighted version of Erd{\H o}s-Kac Theorem. Specifically, we show that the Gaussian limiting distribution is preserved, but shifted, when $\omega(n)$ is weighted by the $k-$fold divisor function $\tau_k(n)$. We establish this result by computing all positive integral moments of $\omega(n)$ weighted by $\tau_k(n)$.

We also provide a proof of the classical identity of $\zeta(2n)$ for $n \in \mathbb{N}$ using Dirichlet's kernel.

A History And Translation Of Lagrange's "Sur Quelques Problèmes De L'Analyse De Diophante'', Christopher Goff, Michael Saclolo

Euleriana

Among Lagrange's many achievements in number theory is a solution to the problem posed and solved by Fermat of finding a right triangle whose legs sum to a perfect square and whose hypotenuse is also a square. This article chronicles various appearances of the problem, including multiple solutions by Euler, all of which inadequately address completeness and minimality of solutions. Finally, we summarize and translate Lagrange's paper in which he solves the problem completely, thus successfully proving the minimality of Fermat's original solution.

Theory And Application Of Hypersoft Set, Florentin Smarandache, Muhammad Saeed, Muhammad Saqlain, Mohamed Abdel-Baset

Branch Mathematics and Statistics Faculty and Staff Publications

Aims and Scope Florentin Smarandache generalize the soft set to the hypersoft set by transforming the function �� into a multi-argument function. This extension reveals that the hypersoft set with neutrosophic, intuitionistic, and fuzzy set theory will be very helpful to construct a connection between alternatives and attributes. Also, the hypersoft set will reduce the complexity of the case study. The Book “Theory and Application of Hypersoft Set” focuses on theories, methods, algorithms for decision making and also applications involving neutrosophic, intuitionistic, and fuzzy information. Our goal is to develop a strong relationship with the MCDM solving techniques and to …

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 …

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 …

Mathematical Magic: A Study Of Number Puzzles, Nicasio M. Velez

Rose-Hulman Undergraduate Mathematics Journal

Within this paper, we will briefly review the history of a collection of number puzzles which take the shape of squares, polygons, and polyhedra in both modular and nonmodular arithmetic. Among other results, we develop construction techniques for solutions of both Modulo and regular Magic Squares. For other polygons in nonmodular arithmetic, specifically of order 3, we present a proof of why there are only four Magic Triangles using linear algebra, disprove the existence of the Magic Tetrahedron in two ways, and utilizing the infamous 3-SUM combinatorics problem we disprove the existence of the Magic Octahedron.

Three Imprimitive Character Sums, Brad Isaacson

Publications and Research

We express three imprimitive character sums in terms of generalized Bernoulli numbers. These sums are generalizations of sums introduced and studied by Arakawa, Berndt, Ibukiyama, Kaneko and Ramanujan in the context of modular forms and theta function identities. As a corollary, we obtain a formula for cotangent power sums considered by Apostol.

Solving Neutrosophic Linear Equations Systems Using Symbolic Computation (Resolucion De Sistemas De Ecuaciones Lineales Neutrosóficas Mediante Computación Simbólica), Maykel Leyva-Vazquez, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we apply the concept of neutrosophic numbers to solve a systems of neutrophic linear equations using symbolic computation. Also, we utilize Jupyter, which is supported in Google Colaboratory for performing symbolic computation. The sympy library of Python is used to perform the process of neutrosophic computation. Systems of neutrosophic linear equations are solved through symbolic computation in Python. A case study was developed for the determination of vehicular traffic with indeterminacy. This king of computation opens new ways to deal with indeterminacy in real-world problems.

The Plus-Minus Davenport Constant Of Finite Abelian Groups, Darleen S. Perez-Lavin

Theses and Dissertations--Mathematics

Let G be a finite abelian group, written additively. The Davenport constant, D(G), is the smallest positive number s such that any subset of the group G, with cardinality at least s, contains a non-trivial zero-subsum. We focus on a variation of the Davenport constant where we allow addition and subtraction in the non-trivial zero-subsum. This constant is called the plus-minus Davenport constant, D_±(G). In the early 2000’s, Marchan, Ordaz, and Schmid proved that if the cardinality of G is less than or equal to 100, then the D_±(G) …

The Smallest Solution Of An Isotropic Quadratic Form, Deborah H. Blevins

Theses and Dissertations--Mathematics

An isotropic quadratic form f(x₁,...,x_n) = ∑ ⁿ_i=1 ∑ ⁿ_j=1 f_ijx_ix_j defined on a Z- lattice has a smallest solution, where the size of the solution is measured using the infinity norm (∥ ∥_∞), the l₁ norm (∥ ∥₁), or the Euclidean norm (∥ ∥₂). Much work has been done to find the least upper bound and greatest lower bound on the smallest solution, beginning with Cassels in the mid-1950’s. Defining F := (f₁₁,...,f …

Solubility Of Additive Forms Over Local Fields, Drew Duncan

Theses and Dissertations--Mathematics

Michael Knapp, in a previous work, conjectured that every additive sextic form over $\mathbb{Q}_2(\sqrt{-1})$ and $\mathbb{Q}_2(\sqrt{-5})$ in seven variables has a nontrivial zero. In this dissertation, I show that this conjecture is true, establishing that $$\Gamma^*(6, \mathbb{Q}_2(\sqrt{-1})) = \Gamma^*(6, \mathbb{Q}_2(\sqrt{-5})) = 7.$$ I then determine the minimal number of variables $\Gamma^*(d, K)$ which guarantees a nontrivial solution for every additive form of degree $d=2m$, $m$ odd, $m \ge 3$ over the six ramified quadratic extensions of $\mathbb{Q}_2$. We prove that if $$K \in \{\mathbb{Q}_2(\sqrt{2}), \mathbb{Q}_2(\sqrt{10}), \mathbb{Q}_2(\sqrt{-2}), \mathbb{Q}_2(\sqrt{-10})\},$$ then $$\Gamma^*(d,K) = \frac{3}{2}d,$$ and if $$K \in \{\mathbb{Q}_2(\sqrt{-1}), \mathbb{Q}_2(\sqrt{-5})\},$$ then $$\Gamma^*(d,K) = …

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 …

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.

Amm Problem #12219, Brad Isaacson

Publications and Research

No abstract provided.