Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Discrete Mathematics and Combinatorics (8)
- Algebra (7)
- Applied Mathematics (6)
- Logic and Foundations (6)
- Other Mathematics (6)
-
- Analysis (4)
- Computer Sciences (4)
- Information Security (4)
- Harmonic Analysis and Representation (3)
- Set Theory (3)
- Ordinary Differential Equations and Applied Dynamics (2)
- Other Physical Sciences and Mathematics (2)
- Special Functions (2)
- Accounting (1)
- Algebraic Geometry (1)
- Applied Statistics (1)
- Business (1)
- Control Theory (1)
- Curriculum and Instruction (1)
- Dynamic Systems (1)
- Dynamical Systems (1)
- Education (1)
- Educational Methods (1)
- Finance and Financial Management (1)
- Higher Education (1)
- Management Sciences and Quantitative Methods (1)
- Numerical Analysis and Computation (1)
- Institution
-
- University of New Mexico (8)
- City University of New York (CUNY) (3)
- Prairie View A&M University (3)
- California State University, San Bernardino (2)
- Colby College (2)
-
- Rose-Hulman Institute of Technology (2)
- The University of Akron (2)
- Boise State University (1)
- East Tennessee State University (1)
- Illinois Math and Science Academy (1)
- Liberty University (1)
- Michigan Technological University (1)
- Montclair State University (1)
- Murray State University (1)
- Sacred Heart University (1)
- Smith College (1)
- University of Minnesota Morris Digital Well (1)
- Ursinus College (1)
- Keyword
-
- Cryptography (3)
- Mathematics (3)
- Number theory (3)
- Generating function (2)
- Neutrosophic logic (2)
-
- RSA (2)
- $j$-invariant (1)
- Advanced Encryption Standard (1)
- Algebra (1)
- Algebraic geometry (1)
- Algorithm (1)
- Asymmetric Cryptography (1)
- Asymmetric key encryption (1)
- Automorphic forms (1)
- Bell polynomial of the second kind (1)
- Big data (1)
- Cartan (1)
- Character sums (1)
- Class number (1)
- Coefficient (1)
- Combinatorial identity (1)
- Combinatorics (1)
- Congruences (1)
- Crypto-mathematics (1)
- Cryptography. (1)
- Cryptology (1)
- Cryptosystems (1)
- Data Encryption Standard (1)
- Diamond colored (1)
- Diffie-Hellman (1)
- Publication
-
- Branch Mathematics and Statistics Faculty and Staff Publications (8)
- Applications and Applied Mathematics: An International Journal (AAM) (3)
- Electronic Theses, Projects, and Dissertations (2)
- Honors Theses (2)
- Publications and Research (2)
-
- Rose-Hulman Undergraduate Mathematics Journal (2)
- Williams Honors College, Honors Research Projects (2)
- Boise State University Theses and Dissertations (1)
- Department of Applied Mathematics and Statistics Faculty Scholarship and Creative Works (1)
- Dissertations, Master's Theses and Master's Reports (1)
- Dissertations, Theses, and Capstone Projects (1)
- Doctoral Dissertations (1)
- Electronic Theses and Dissertations (1)
- Mathematics Publications (1)
- Mathematics Sciences: Faculty Publications (1)
- Mathematics Undergraduate Publications (1)
- Murray State Theses and Dissertations (1)
- Number Theory (1)
- Senior Honors Theses (1)
- Publication Type
Articles 31 - 33 of 33
Full-Text Articles in Number Theory
An Algorithm To Determine All Odd Primitive Abundant Numbers With D Prime Divisors, Jacob Liddy
An Algorithm To Determine All Odd Primitive Abundant Numbers With D Prime Divisors, Jacob Liddy
Williams Honors College, Honors Research Projects
An abundant number is said to be primitive if none of its proper divisors are abundant. Dickson proved that for an arbitrary positive integer d there exists only finitely many odd primitive abundant numbers having exactly d prime divisors. In this paper we describe a fast algorithm that finds all primitive odd numbers with d unique prime divisors. We use this algorithm to find all the number of odd primitive abundant numbers with 6 unique Divisors. We use this algorithm to prove that an odd weird number must have at least 6 prime divisors.
On The Density Of The Odd Values Of The Partition Function, Samuel Judge
On The Density Of The Odd Values Of The Partition Function, Samuel Judge
Dissertations, Master's Theses and Master's Reports
The purpose of this dissertation is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo $2$. We provide a doubly-indexed, infinite family of conjectural identities in the ring of series $\Z_2[[q]]$, which relate $p(n)$ with suitable $t$-multipartition functions, and show how to, in principle, prove each such identity. We will exhibit explicit proofs for $32$ of our identities. However, the conjecture remains open in full generality. A striking consequence of these conjectural identities is that, under suitable …
Special Values Of Ibukiyama-Saito L-Functions, Brad Isaacson
Special Values Of Ibukiyama-Saito L-Functions, Brad Isaacson
Publications and Research
Following the method of Arakawa, we express the special values of an L-function originally introduced by Arakawa and Hashimoto and later generalized by Ibukiyama and Saito at non-positive integers by finite sums of products of Bernoulli polynomials. As a corollary, we prove an infinite family of identities expressing finite sums of products of Bernoulli polynomials by generalized Bernoulli numbers.