Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Other Mathematics (94)
- Logic and Foundations (88)
- Algebra (70)
- Algebraic Geometry (54)
- Analysis (53)
-
- Set Theory (50)
- Applied Mathematics (40)
- Discrete Mathematics and Combinatorics (36)
- Education (18)
- Educational Methods (17)
- Science and Mathematics Education (17)
- Curriculum and Instruction (16)
- Higher Education (16)
- Computer Sciences (15)
- Other Physical Sciences and Mathematics (15)
- Geometry and Topology (8)
- Information Security (8)
- Theory and Algorithms (8)
- Harmonic Analysis and Representation (6)
- Engineering (5)
- Dynamical Systems (4)
- Physics (4)
- Special Functions (4)
- Statistics and Probability (4)
- Aerospace Engineering (3)
- Arts and Humanities (3)
- Business (3)
- Institution
-
- University of New Mexico (114)
- West Chester University (34)
- Ursinus College (16)
- Claremont Colleges (15)
- Rose-Hulman Institute of Technology (15)
-
- City University of New York (CUNY) (14)
- Southern Illinois University Carbondale (13)
- University of Minnesota Morris Digital Well (11)
- Gettysburg College (8)
- College of Saint Benedict and Saint John's University (6)
- Illinois Wesleyan University (6)
- Liberty University (5)
- Montclair State University (3)
- Western Kentucky University (3)
- Sacred Heart University (2)
- Smith College (2)
- The British University in Egypt (2)
- University of Connecticut (2)
- University of Nebraska - Lincoln (2)
- Belmont University (1)
- California State University, San Bernardino (1)
- Chapman University (1)
- DePauw University (1)
- Grand Valley State University (1)
- Illinois Math and Science Academy (1)
- Lawrence University (1)
- Macalester College (1)
- Merrimack College (1)
- Olivet Nazarene University (1)
- Parkland College (1)
- Keyword
-
- Neutrosophic logic (38)
- Number theory (27)
- Mathematics (15)
- Cryptography (10)
- Mathematical problems (8)
-
- Problems (8)
- Algebraic structures (7)
- Discrete logarithm (7)
- Geometry (7)
- Neutrosophic set (7)
- Divisibility (6)
- Polynomials (5)
- Prime numbers (5)
- Algebra (4)
- Elliptic curves (4)
- Number Theory (4)
- Wilson's theorem (4)
- Combinatorics (3)
- Diophantine equations (3)
- Discriminant (3)
- Exponential sums (3)
- Finite fields (3)
- Functional graphs (3)
- Fuzzy logic (3)
- Galois group (3)
- Galois theory (3)
- Graph theory (3)
- Hensel's lemma (3)
- Math (3)
- Neutrosophic Logic (3)
- Publication Year
- Publication
-
- Branch Mathematics and Statistics Faculty and Staff Publications (114)
- Mathematics Faculty Publications (41)
- Number Theory (16)
- Mathematical Sciences Technical Reports (MSTR) (14)
- Articles and Preprints (13)
-
- Mathematics Publications (11)
- Publications and Research (11)
- All HMC Faculty Publications and Research (8)
- Math Faculty Publications (7)
- Scholarship (6)
- Pomona Faculty Publications and Research (5)
- Senior Honors Theses (5)
- Masters Theses & Specialist Projects (3)
- Basic Science Engineering (2)
- CMC Faculty Publications and Research (2)
- Department of Mathematics Facuty Scholarship and Creative Works (2)
- Mathematics and Statistics: Faculty Publications (2)
- Open Educational Resources (2)
- Student Research (2)
- A with Honors Projects (1)
- CSB/SJU Distinguished Thesis (1)
- Department of Applied Mathematics and Statistics Faculty Scholarship and Creative Works (1)
- Exemplary Student Work (1)
- Faculty Publications (1)
- Graduate Student Publications and Research (1)
- Honors College (1)
- Honors Program Projects (1)
- Honors Scholar Theses (1)
- Honors Scholars Collaborative Projects (1)
- Honors Theses (1)
Articles 1 - 30 of 290
Full-Text Articles in Number Theory
Approaches To The Erdős–Straus Conjecture, Ivan V. Morozov
Approaches To The Erdős–Straus Conjecture, Ivan V. Morozov
Publications and Research
The Erdős–Straus conjecture, initially proposed in 1948 by Paul Erdős and Ernst G. Straus, asks whether the equation 4/n = 1/x + 1/y + 1/z is solvable for all n ∈ N and some x, y, z ∈ N. This problem touches on properties of Egyptian fractions, which had been used in ancient Egyptian mathematics. There exist many partial solutions, mainly in the form of arithmetic progressions and therefore residue classes. In this work we explore partial solutions and aim to expand them.
The Spectrum Of Nim-Values For Achievement Games For Generating Finite Groups, Bret J. Benesh, Dana C. Ernst, Nándor Sieben
The Spectrum Of Nim-Values For Achievement Games For Generating Finite Groups, Bret J. Benesh, Dana C. Ernst, Nándor Sieben
Mathematics Faculty Publications
We study an impartial achievement game introduced by Anderson and Harary. The game is played by two players who alternately select previously unselected elements of a finite group. The game ends when the jointly selected elements generate the group. The last player able to make a move is the winner of the game. We prove that the spectrum of nim-values of these games is {0, 1, 2, 3, 4}. This positively answers two conjectures from a previous paper by the last two authors.
One Formula For Non-Prime Numbers: Motivations And Characteristics, Mahmoud Mansour, Kamal Hassan Prof.
One Formula For Non-Prime Numbers: Motivations And Characteristics, Mahmoud Mansour, Kamal Hassan Prof.
Basic Science Engineering
Primes are essential for computer encryption and cryptography, as they are fundamental units of whole numbers and are of the highest importance due to their mathematical qualities. However, identifying a pattern of primes is not easy. Thinking in a different way may get benefits, by considering the opposite side of the problem which means focusing on non-prime numbers. Recently, researchers introduced, the pattern of non-primes in two maximal sets while in this paper, non-primes are presented in one formula. Getting one-way formula for non-primes may pave the way for further applications based on the idea of primes.
Lagrange’S Study Of Wilson’S Theorem, Carl Lienert
Lagrange’S Study Of Wilson’S Theorem, Carl Lienert
Number Theory
No abstract provided.
Lagrange’S Proof Of The Converse Of Wilson’S Theorem, Carl Lienert
Lagrange’S Proof Of The Converse Of Wilson’S Theorem, Carl Lienert
Number Theory
No abstract provided.
Lagrange’S Proof Of Wilson’S Theorem—And More!, Carl Lienert
Lagrange’S Proof Of Wilson’S Theorem—And More!, Carl Lienert
Number Theory
No abstract provided.
Lagrange’S Alternate Proof Of Wilson’S Theorem, Carl Lienert
Lagrange’S Alternate Proof Of Wilson’S Theorem, Carl Lienert
Number Theory
No abstract provided.
Decomposition Of Beatty And Complementary Sequences, Geremías Polanco
Decomposition Of Beatty And Complementary Sequences, Geremías Polanco
Mathematics and Statistics: Faculty Publications
In this paper we express the difference of two complementary Beatty sequences, as the sum of two Beatty sequences closely related to them. In the process we introduce a new Algorithm that generalizes the well known Minimum Excluded algorithm and provides a method to generate combinatorially any pair of complementary Beatty sequences.
Ramanujan–Sato Series For 1/Π, Timothy Huber, Daniel Schultz, Dongxi Ye
Ramanujan–Sato Series For 1/Π, Timothy Huber, Daniel Schultz, Dongxi Ye
School of Mathematical and Statistical Sciences Faculty Publications and Presentations
We compute Ramanujan–Sato series systematically in terms of Thompson series and their modular equations. A complete list of rational and quadratic series corresponding to singular values of the parameters is derived.
Number Theoretic Arithmetic Functions And Dirichlet Series, Ivan V. Morozov
Number Theoretic Arithmetic Functions And Dirichlet Series, Ivan V. Morozov
Publications and Research
In this study, we will study number theoretic functions and their associated Dirichlet series. This study lay the foundation for deep research that has applications in cryptography and theoretical studies. Our work will expand known results and venture into the complex plane.
Unique Factorization In The Rings Of Integers Of Quadratic Fields: A Method Of Proof, Zachary Warren
Unique Factorization In The Rings Of Integers Of Quadratic Fields: A Method Of Proof, Zachary Warren
Senior Honors Theses
It is a well-known property of the integers, that given any nonzero a ∈ Z, where a is not a unit, we are able to write a as a unique product of prime numbers. This is because the Fundamental Theorem of Arithmetic (FTA) holds in the integers and guarantees (1) that such a factorization exists, and (2) that it is unique. As we look at other domains, however, specifically those of the form O(√D) = {a + b√D | a, b ∈ Z, D a negative, squarefree integer}, we find that …
A Comparison Of Cryptographic Methods, Christopher Gilmore
A Comparison Of Cryptographic Methods, Christopher Gilmore
Senior Honors Theses
While elliptic curve cryptography and quantum cryptography are significantly different branches of cryptography, they provide a suitable reference point for comparison of the value of developing methods used in the present and investing in methods to be used in the future. Elliptic curve cryptography is quite common today, as it is generally secure and efficient. However, as the field of cryptography advances, the value of quantum cryptography’s inherent security from its basic properties should be considered, as a fully realized quantum cryptosystem has the potential to be quite powerful. Ultimately, it is of critical importance to determine the value of …
Structure Of Number Theoretic Graphs, Lee Trent
Structure Of Number Theoretic Graphs, Lee Trent
Mathematical Sciences Technical Reports (MSTR)
The tools of graph theory can be used to investigate the structure
imposed on the integers by various relations. Here we investigate two
kinds of graphs. The first, a square product graph, takes for its vertices
the integers 1 through n, and draws edges between numbers whose product
is a square. The second, a square product graph, has the same vertex set,
and draws edges between numbers whose sum is a square.
We investigate the structure of these graphs. For square product
graphs, we provide a rather complete characterization of their structure as
a union of disjoint complete graphs. For …
Nessie Notation: A New Tool In Sequential Substitution Systems And Graph Theory For Summarizing Concatenations, Colton Davis
Nessie Notation: A New Tool In Sequential Substitution Systems And Graph Theory For Summarizing Concatenations, Colton Davis
Student Research
While doing research looking for ways to categorize causal networks generated by Sequential Substitution Systems, I created a new notation to compactly summarize concatenations of integers or strings of integers, including infinite sequences of these, in the same way that sums, products, and unions of sets can be summarized. Using my method, any sequence of integers or strings of integers with a closed-form iterative pattern can be compactly summarized in just one line of mathematical notation, including graphs generated by Sequential Substitution Systems, many Primitive Pythagorean Triplets, and various Lucas sequences including the Fibonacci sequence and the sequence of square …
A Study Of Semiprime Arithmetic Sequences, Sam C. Uselton
A Study Of Semiprime Arithmetic Sequences, Sam C. Uselton
Honors Scholars Collaborative Projects
Semiprimes are positive integers of the form n = p*q where p and q are primes that are not necessarily distinct. Semiprimes can occur in arithmetic sequence, and the upper bound changes depending on the distance, d, between semiprimes in the sequence. The goal of this work is to present and prove theorems for different cases of semiprime arithmetic sequences, including d = 2k+1 where k is greater than or equal to 0 and d=2k where k is positive and not a multiple of 3, as well as a general case for finding upper bounds for varying distances. The building …
Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel
Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel
CSB/SJU Distinguished Thesis
Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants known as RLWE and PLWE have been shown to be more efficient, but the increased structure can leave them vulnerable to attacks for certain instantiations. This work aims to identify specific cases where proposed cryptographic schemes based on PLWE work particularly poorly under a specific attack.
Hypergeometric Motives, David P. Roberts, Fernando Rodriguez Villegas
Hypergeometric Motives, David P. Roberts, Fernando Rodriguez Villegas
Mathematics Publications
No abstract provided.
Amm Problem #12279, Brad Isaacson
Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas
Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas
Open Educational Resources
The first objective of this book is to define and discuss the meaning of truth in mathematics. We explore logics, both propositional and first-order , and the construction of proofs, both formally and human-targeted. Using the proof tools, this book then explores some very fundamental definitions of mathematics through set theory. This theory is then put in practice in several applications. The particular (but quite widespread) case of equivalence and order relations is studied with detail. Then we introduces sequences and proofs by induction, followed by number theory. Finally, a small introduction to combinatorics is …
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
This issue showcases a compilation of papers on fluid mechanics (FM) education, covering different sub topics of the subject. The success of the first volume [1] prompted us to consider another follow-up special issue on the topic, which has also been very successful in garnering an impressive variety of submissions. As a classical branch of science, the beauty and complexity of fluid dynamics cannot be overemphasized. This is an extremely well-studied subject which has now become a significant component of several major scientific disciplines ranging from aerospace engineering, astrophysics, atmospheric science (including climate modeling), biological and biomedical science …
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Mathematical Sciences Technical Reports (MSTR)
Hash functions map data of arbitrary length to data of predetermined length. Good hash functions are hard to predict, making them useful in cryptography. We are interested in the elliptic curve CGL hash function, which maps a bitstring to an elliptic curve by traversing an inputdetermined path through an isogeny graph. The nodes of an isogeny graph are elliptic curves, and the edges are special maps betwixt elliptic curves called isogenies. Knowing which hash values are most likely informs us of potential security weaknesses in the hash function. We use stochastic matrices to compute the expected probability distributions of the …
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
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 …
Theory And Application Of Hypersoft Set, Florentin Smarandache, Muhammad Saeed, Muhammad Saqlain, Mohamed Abdel-Baset
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 …
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
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.
Three Imprimitive Character Sums, Brad Isaacson
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.
Amm Problem #12219, Brad Isaacson
A Twisted Generalization Of The Classical Dedekind Sum, Brad Isaacson
A Twisted Generalization Of The Classical Dedekind Sum, Brad Isaacson
Publications and Research
In this paper, we express three different, yet related, character sums in terms of generalized Bernoulli numbers. Two of these sums are generalizations of sums introduced and studied by Berndt and Arakawa–Ibukiyama–Kaneko in the context of the theory of modular forms. A third sum generalizes a sum already studied by Ramanujan in the context of theta function identities. Our methods are elementary, relying only on basic facts from algebra and number theory.
On Generating Functions In Additive Number Theory, Ii: Lower-Order Terms And Applications To Pdes, J. Brandes, Scott T. Parsell, C. Poulias, G. Shakan, R. C. Vaughn
On Generating Functions In Additive Number Theory, Ii: Lower-Order Terms And Applications To Pdes, J. Brandes, Scott T. Parsell, C. Poulias, G. Shakan, R. C. Vaughn
Mathematics Faculty Publications
We obtain asymptotics for sums of the form
Sigma(p)(n=1) e(alpha(k) n(k) + alpha(1)n),
involving lower order main terms. As an application, we show that for almost all alpha(2) is an element of [0, 1) one has
sup(alpha 1 is an element of[0,1)) | Sigma(1 <= n <= P) e(alpha(1)(n(3) + n) + alpha(2)n(3))| << P3/4+epsilon,
and that in a suitable sense this is best possible. This allows us to improve bounds for the fractal dimension of solutions to the Schrodinger and Airy equations.
Decision Making On Teachers’ Adaptation To Cybergogy In Saturated Interval- Valued Refined Neutrosophic Overset /Underset /Offset Environment, Florentin Smarandache, Nivetha Martin, Priya R.
Decision Making On Teachers’ Adaptation To Cybergogy In Saturated Interval- Valued Refined Neutrosophic Overset /Underset /Offset Environment, Florentin Smarandache, Nivetha Martin, Priya R.
Branch Mathematics and Statistics Faculty and Staff Publications
Neutrosophic overset, neutrosophic underset and neutrosophic offset introduced by Smarandache are the special kinds of neutrosophic sets with values beyond the range [0,1] and these sets are pragmatic in nature as it represents the real life situations. This paper introduces the concept of saturated refined neutrosophic sets and extends the same to the special kinds of neutrosophic sets. The proposed concept is applied in decision making on Teacher’s adaptation to cybergogy. The decision making environment is characterized by different types of teachers, online teaching skills and various training methods. Fuzzy relation is used to match the most suitable method to …
Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya
Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
We examine two dimensional properties of vortex shedding past elliptical cylinders through numerical simulations. Specifically, we investigate the vortex formation length in the Reynolds number regime 10 to 100 for elliptical bodies of aspect ratio in the range 0.4 to 1.4. Our computations reveal that in the steady flow regime, the change in the vortex length follows a linear profile with respect to the Reynolds number, while in the unsteady regime, the time averaged vortex length decreases in an exponential manner with increasing Reynolds number. The transition in profile is used to identify the critical Reynolds number which marks the …