Number Theory Commons^™

Eccentricity, Space Bending, Dimension, Florentin Smarandache, Marian Nitu, Mircea Eugen Selariu

Branch Mathematics and Statistics Faculty and Staff Publications

The main goal of this paper is to present new transformations, previously non-existent in traditional mathematics, that we call centric mathematics (CM) but that became possible due to the new born eccentric mathematics, and, implicitly, to the supermathematics (SM).

As shown in this work, the new geometric transformations, namely conversion or transfiguration, wipe the boundaries between discrete and continuous geometric forms, showing that the first ones are also continuous, being just apparently discontinuous.

Single Valued Neutrosophic Information Systems Based On Rough Set Theory, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

The theory of rough sets was firstly proposed by Pawlak. Later on, Smarandache introduced the concept of neutrosophic (NS) sets in 1998. In this paper based on the concept of rough neutrosohic set, we define the concept of single valued neutrosophic information systems. In addition, we will discuss the knowledge reduction and extension of the single valued neutrosophic information systems.

Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue

Scholarship

style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> prime factors for every style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">with the property that …

Interval Neutrosophic Rough Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This paper combines interval-valued neutrosophic sets and rough sets. It studies rougheness in interval-valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower an upper approximations of interval neutrosophic sets.

Importance Of Sources Using The Repeated Fusion Method And The Proportional Conflict Redistribution Rules #5 And #6, Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

We present in this paper some examples of how to compute by hand the PCR5 fusion rule for three sources, so the reader will better understand its mechanism. We also take into consideration the importance of sources, which is different from the classical discounting of sources.

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.

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 …

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 …

Number Theory Applications In Cryptography, Francesca Pizzigoni

Theses, Dissertations and Culminating Projects

This thesis provides a unique cryptosystem comprised of different number theory applications. We first consider the well-known Knapsack Problem and the resulting Knapsack Cryptosystem. It is known that when the Knapsack Problem involves a superincreasing sequence, the solution is easy to find. Two cryptosystems are designed and displayed in this thesis that allow two parties often called Alice and Bob use a common superincreasing sequence in the encryption and decryption process. They use this sequence and a variation of the Knapsack Cryptosystem to send and receive binary messages. The first cryptosystem assumes that Alice and Bob agree on a shared …

Aliquot Cycles For Elliptic Curves With Complex Multiplication, Thomas Morrell

Undergraduate Theses—Unrestricted

We review the history of elliptic curves and show that it is possible to form a group law using the points on an elliptic curve over some field L. We review various methods for computing the order of this group when L is finite, including the complex multiplication method. We then define and examine the properties of elliptic pairs, lists, and cycles, which are related to the notions of amicable pairs and aliquot cycles for elliptic curves, defined by Silverman and Stange. We then use the properties of elliptic pairs to prove that aliquot cycles of length greater than …

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.

A Study Of Finite Symmetrical Groups, May Majid

Theses Digitization Project

This study investigated finite homomorphic images of several progenitors, including 2*⁵ : S₅, 2*⁶ : A₆, and 3*⁵ : C₅ The technique of manual of double coset enumeration is used to construct several groups by hand and computer-based proofs are given for the isomorphism types of the groups that are not constructed.

Enumeration And Symmetric Presentations Of Groups, With Music Theory Applications, Jesse Graham Train

Theses Digitization Project

The purpose of this project is to construct groups as finite homomorphic images of infinite semi-direct products. In particular, we will construct certain classical groups and subgroups of sporadic groups, as well groups with applications to the field of music theory.

Pointless Hyperelliptic Curves, Ryan P. Becker, Darren B. Glass

Math Faculty Publications

In this paper we consider the question of whether there exists a hyperelliptic curve of genus g which is defined over but has no rational points over for various pairs . As an example of such a result, we show that if p is a prime such that is also prime then there will be pointless hyperelliptic curves over of every genus.

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.

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.

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.