Number Theory Commons^™

Generating Pythagorean Triples: A Gnomonic Exploration, Janet Heine Barnett

Number Theory

No abstract provided.

Generating Pythagorean Triples: The Methods Of Pythagoras And Of Plato Via Gnomons, Janet Heine Barnett

Number Theory

No abstract provided.

Primes, Divisibility, And Factoring, Dominic Klyve

Number Theory

No abstract provided.

Numbers In Base B That Generate Primes With Help The Luhn Function Of Order Ω, Florentin Smarandache, Octavian Cira

Branch Mathematics and Statistics Faculty and Staff Publications

We put the problem to determine the sets of integers in base b ≥ 2 that generate primes with using a function.

On P-Adic Fields And P-Groups, Luis A. Sordo Vieira

Theses and Dissertations--Mathematics

The dissertation is divided into two parts. The first part mainly treats a conjecture of Emil Artin from the 1930s. Namely, if f = a_1x_1^d + a_2x_2^d +...+ a_{d^2+1}x^d where the coefficients a_i lie in a finite unramified extension of a rational p-adic field, where p is an odd prime, then f is isotropic. We also deal with systems of quadratic forms over finite fields and study the isotropicity of the system relative to the number of variables. We also study a variant of the classical Davenport constant of finite abelian groups and relate it to the isotropicity of diagonal …

A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero

Undergraduate Honors Thesis Collection

This thesis displays a sample distribution, generated from both a simulation (for large n) by computer program and explicitly calculated (for smaller n), that is not governed by the Central Limit Theorem and, in fact seems to display chaotic behavior. To our knowledge, the explicit calculation of the sample distribution function is new. This project outlines the results that have found a relation to number theory in a probabilistic game that has perplexed mathematicians for hundreds of years.

Integer Generalized Splines On The Diamond Graph, Emmet Reza Mahdavi

Senior Projects Spring 2016

In this project we extend previous research on integer splines on graphs, and we use the methods developed on n-cycles to characterize integer splines on the diamond graph. First, we find an explicit module basis consisting of flow-up classes. Then we develop a determinantal criterion for when a given set of splines forms a basis.

A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot

Electronic Theses and Dissertations

Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …

A Short Note On Sums Of Powers Of Reciprocals Of Polygonal Numbers, Jihang Wang, Suman Balasubramanian

Student Research

This paper presents the summation of powers of reciprocals of polygonal numbers. Several summation formulas of the reciprocals of generalized polygonal numbers are presented as examples of specific cases in this paper.

Commutative N-Ary Arithmetic, Aram Bingham

University of New Orleans Theses and Dissertations

Motivated by primality and integer factorization, this thesis introduces generalizations of standard binary multiplication to commutative n-ary operations based upon geometric construction and representation. This class of operations are constructed to preserve commutativity and identity so that binary multiplication is included as a special case, in order to preserve relationships with ordinary multiplicative number theory. This leads to a study of their expression in terms of elementary symmetric polynomials, and connections are made to results from the theory of polyadic (n-ary) groups. Higher order operations yield wider factorization and representation possibilities which correspond to reductions in the set of primes …

Explorations Of The Collatz Conjecture (Mod M), Glenn Micah Jackson Jr

Honors College Theses

The Collatz Conjecture is a deceptively difficult problem recently developed in mathematics. In full, the conjecture states: Begin with any positive integer and generate a sequence as follows: If a number is even, divide it by two. Else, multiply by three and add one. Repetition of this process will eventually reach the value 1. Proof or disproof of this seemingly simple conjecture have remained elusive. However, it is known that if the generated Collatz Sequence reaches a cycle other than 4, 2, 1, the conjecture is disproven. This fact has motivated our search for occurrences of 4, 2, 1, and …

Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair

Graduate Student Publications and Research

Let p_b(n) be the number of integer partitions of n whose parts are powers of b. For each m there is a generating function identity:

f_m(b,q)\sum_{n} p_b(n) q^n = (1-q)^m \sum_{n} p_b(b^m n q)q^n

where n ranges over all integer values. The proof of this identity appears in the doctoral thesis of the author. For more information see http://dakota.tensen.net/2015/rp/.

This dataset is a JSON object with keys m from 1 to 23 whose values are f_m(b,q).

Integral Generalized Binomial Coefficients Of Multiplicative Functions, Imanuel Chen

Summer Research

The binomial coefficients are interestingly always integral. However, when you generalize the binomial coefficients to any class of function, this is not always the case. Multiplicative functions satisfy the properties: f(ab) = f(a)f(b) when a and b are relatively prime, and f(1) = 1. Tom Edgar of Pacific Lutheran University and Michael Spivey of the University of Puget Sound developed a Corollary that determines which values of n and m will always have integral generalized binomial coefficients for all multiplicative functions. The purpose of this research was to determine as many patterns within this corollary as possible as well as …

Natural Neutrosophic Numbers And Mod Neutrosophic Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors answer the question proposed by Florentin Smarandache “Does there exist neutrosophic numbers which are such that they take values differently and behave differently from I; the indeterminate?”. We have constructed a class of natural neutrosophic numbers m 0I , m xI , m yI , m zI where m 0I × m 0I = m 0I , m xI × m xI = m xI and m yI × m yI = m yI and m yI × m xI = m 0I and m zI × m zI = m 0I . Here take m …

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.

Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna

Honors Scholar Theses

Finite fields, and the polynomial rings over them, have many neat algebraic properties and identities that are very convenient to work with. In this paper we will start by exploring said properties with the goal in mind of being able to use said properties to efficiently irreducibly factorize polynomials over these fields, an important action in the fields of discrete mathematics and computer science. Necessarily, we must also introduce the concept of an algorithm’s speed as well as particularly speeds of basic modular and integral arithmetic opera- tions. Outlining these concepts will have laid the groundwork for us to introduce …

A Frobenius Question Related To Actions On Curves In Characteristic P, Darren B. Glass

Math Faculty Publications

We consider which integers g can occur as the genus and of a curve defined over a field of characteristic p which admits an automorphism of degree pq, where p and q are distinct primes. This investigation leads us to consider a certain family of three-dimensional Frobenius problems and prove explicit formulas giving their solution in many cases.

The Kronecker-Weber Theorem: An Exposition, Amber Verser

Lawrence University Honors Projects

This paper is an investigation of the mathematics necessary to understand the Kronecker-Weber Theorem. Following an article by Greenberg, published in The American Mathematical Monthly in 1974, the presented proof does not use class field theory, as the most traditional treatments of the theorem do, but rather returns to more basic mathematics, like the original proofs of the theorem. This paper seeks to present the necessary mathematical background to understand the proof for a reader with a solid undergraduate background in abstract algebra. Its goal is to make what is usually an advanced topic in the study of algebraic number …

Comparing The Algebraic And Analytical Properties Of P-Adic Numbers With Real Numbers, Joseph Colton Wilson

Theses Digitization Project

This study will provide a glimpse into the world of p-adic numbers, which encompasses a different way to measure the distance between rational numbers. Simple calculations and surprising results are examined to help familiarize the reader to the new space.

The Fibonacci Sequence And Hosoya's Triangle, Jeffrey Lee Smith

Theses Digitization Project

The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci numbers.

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

Pomona Faculty Publications and Research

No abstract provided.

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.

Orthogonal Polynomials, George Gevork Antashyan

Theses Digitization Project

This thesis will show work on Orthogonal Polynomials. In mathematics, the type of polynomials that are orthogonal to each other under inner product are called orthogonal polynomials. Jacobi polynomials, Laguerre polynomials, and Hermite polynomials are examples of classical orthogonal polynomials that was invented in the nineteenth century. The theory of rational approximations is one of the most important applications of orthogonal polynomials.

Leonhard Euler's Contribution To Infinite Polynomials, Jack Dean Meekins

Theses Digitization Project

This thesis will focus on Euler's famous method for solving the infinite polynomial. It will show how he manipulated the sine function to find all possible points along the sine function such that the sine A would equal to y; these would be roots of the polynomial. It also shows how Euler set the infinite polynomial equal to the infinite product allowing him to determine which coefficients were equal to which reciprocals of the roots, roots squared, roots cubed, etc.

Prouhet-Tarry-Escott Problem, Juan Manuel Gutierrez

Theses Digitization Project

The purpose of this research paper is to gain a deeper understanding of a famous unsolved mathematical problem known as the Prouhet-Terry-Escott Problem. The Prouhet-Terry-Escott Problem is a complex problem that still has much to be discovered. This fascinating problem shows up in many areas of mathematics such as the study of polynomials, graph theory, and the theory of integral quadratic forms.

Solutions To A Generalized Pell Equation, Kyle Christopher Castro

Theses Digitization Project

This study aims to extend the notion of continued fractions to a new field Q (x)*, in order to find solutions to generalized Pell's Equations in Q [x] . The investigation of these new solutions to Pell's Equation will begin with the necessary extensions of theorems as they apply to polynomials with rational coefficients and fractions of such polynomials in order to describe each "family" of solutions.

Special Quasi Dual Numbers And Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduce a new notion called special quasi dual number, x = a + bg.

Among the reals – 1 behaves in this way, for (– 1)2 = 1 = – (– 1). Likewise –I behaves in such a way (– I)2 = – (– I). These special quasi dual numbers can be generated from matrices with entries from 1 or I using only the natural product ×n. Another rich source of these special quasi dual numbers or quasi special dual numbers is Zn, n a composite number. For instance 8 in Z12 is such that …

The Fibonacci Sequence, Arik Avagyan

A with Honors Projects

A review was made of the Fibonacci sequence, its characteristics and applications.

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.

Sylvester: Ushering In The Modern Era Of Research On Odd Perfect Numbers, Steven Gimbel, John Jaroma

Philosophy Faculty Publications

In 1888, James Joseph Sylvester (1814-1897) published a series of papers that he hoped would pave the way for a general proof of the nonexistence of an odd perfect number (OPN). Seemingly unaware that more than fifty years earlier Benjamin Peirce had proved that an odd perfect number must have at least four distinct prime divisors, Sylvester began his fundamental assault on the problem by establishing the same result. Later that same year, he strengthened his conclusion to five. These findings would help to mark the beginning of the modern era of research on odd perfect numbers. Sylvester's bound stood …