English
Related papers

Related papers: Determining Mills' Constant and a Note on Honaker'…

200 papers

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

History and Overview · Mathematics 2008-04-15 Leonhard Euler

For $n \geq 1$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $$S= \{1,7,11,13,17,19,23,29 \},$$ the set of positive integers which are both less than and relatively prime to $30.$ For $ x \geq 0,$ let \\ $T_x := \{ 30x+i \; | \; i…

General Mathematics · Mathematics 2024-07-29 Mbakiso F. Mothebe , Dintle N. Kagiso , Ben T. Modise

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Number Theory · Mathematics 2024-09-20 Ali Alsetri , Xuancheng Shao

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Number Theory · Mathematics 2008-10-06 Joseph B. Keller

This paper proves Firoozbakht's conjecture using Rosser and Schoenfelds' inequality on the distribution of primes. This inequality is valid for all natural numbers ${n\geq 21}$. Firoozbakht's conjecture states that if $ {p_{n}}$ and…

General Mathematics · Mathematics 2016-06-07 Ahmad Sabihi

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

Number Theory · Mathematics 2020-03-03 Shaofang Hong , Min Qiu

In this paper, we give a short and entirely elementary proof of the proposition ``For any positive integer $ N $, there exists a real number $ L $ such that for any real number $ x \geqq L $, there are at least $ N $ primes in the interval…

Number Theory · Mathematics 2025-08-05 Hiroki Aoki , Riku Higa , Ryosei Sugawara

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

Number Theory · Mathematics 2022-07-19 Alina Carmen Cojocaru , McKinley Meyer

The results of the computer hunt for the primes of the form $q = m^2+1$ up to $10^{20}$ are reported. The number of sign changes of the difference $\pi_q(x) - \frac{C_q}{2}\int_2^x{du \over \sqrt{u}\log(u)}$ and the error term for this…

Number Theory · Mathematics 2015-12-22 Marek Wolf

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

General Mathematics · Mathematics 2009-09-14 Shaohua Zhang

For $a \neq 1$ and $p$ prime, we define numbers of the form $pa^2$ to be Square-Prime (SP) Numbers. For example, 75 = 3 $\cdot$ 25; 108 = 3 $\cdot$ 36; 45 = 5 $\cdot$ 9. These numbers are listed in the OEIS as A228056. We study the…

Number Theory · Mathematics 2024-12-11 Raghavendra N. Bhat

Let $m\in\mathbb{Z}$ be an integer and $L_m=\mathbb{Q}(\alpha)$ be the simplest cubic field with class number $h_m$ and conductor $\mathfrak{f}_m$ where $\alpha$ is a root of $f_m(X)=X^3-mX^2-(m+3)X-1$. Let $\mathcal{O}_{L_m}$ be the ring…

Number Theory · Mathematics 2026-04-07 Akinari Hoshi , Hiroaki Iida

Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. Define $n$ to be stable if for all $k\ge 0$, we have $\|3^k n\|=\|n\|+3k$. In [7],…

Number Theory · Mathematics 2018-05-28 Harry Altman

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

Number Theory · Mathematics 2021-06-15 Tianfang Qi , Su Hu

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

Number Theory · Mathematics 2017-05-12 Alessandro Languasco , Alessandro Zaccagnini

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…

Number Theory · Mathematics 2012-07-24 Dmitriy Frolenkov , Igor D. Kan

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

Number Theory · Mathematics 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […

Number Theory · Mathematics 2023-12-20 Arvind Kumar , Moni Kumari

The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible…

Number Theory · Mathematics 2007-05-23 Yong-Gao Chen , Gabor Kun , Gabor Pete , Imre Z. Ruzsa , Adam Timar
‹ Prev 1 8 9 10 Next ›