English
Related papers

Related papers: An arithmetical excursion via Stoneham numbers

200 papers

For a Carmichael number $n$ with prime factors $p_1,\cdots,p_m$, define $$K=GCD[p_1-1,\cdots,p_m-1],$$ and let $C_\nu(X)$ denote the number of Carmichael numbers up to $X$ such that $K=\nu$. Assuming a strong conjecture on the first prime…

Number Theory · Mathematics 2024-10-29 Thomas Wright

We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…

Number Theory · Mathematics 2008-07-29 Vladimir Shevelev

We compute all primes up to $6.25\times 10^{28}$ of the form $m^2+1$. Calculations using this list verify, up to our bound, a less famous conjecture of Goldbach. We introduce `Goldbach champions' as part of the verification process and…

Number Theory · Mathematics 2025-02-07 Jon Grantham , Hester Graves

I give some claims on primorial prime numbers for interested readers in number theory.

General Mathematics · Mathematics 2007-05-23 Turker Ozsari

For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…

Number Theory · Mathematics 2009-07-31 Vladimir Shevelev

The abstract of the original paper was as follows: We explore some questions related to one of Brizolis: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? We extend this question to…

Number Theory · Mathematics 2007-05-23 Joshua Holden

Let us denote by $Z_{b}(n)$ the number of trailing zeroes in the base b expansion of $n!$. In this paper we study the connection between the expression of $\vartheta(b):=\lim_{n\to \infty}Z_{b}(n)/n$ in base $b$, and that of $Z_{b}(b^{k})$.…

Number Theory · Mathematics 2010-02-23 Antonio M. Oller-Marcen , Jose Maria Grau

In 1927, E. Artin conjectured that all non-square integers $a\neq -1$ are a primitive root of $\mathbb{F}_p$ for infinitely many primes $p$. In 1967, Hooley showed that this conjecture follows from the Generalized Riemann Hypothesis (GRH).…

Number Theory · Mathematics 2024-11-22 Noam Kimmel

In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…

Combinatorics · Mathematics 2016-07-05 Farid Bencherif , Rachid Boumahdi

For $\alpha>1$ we represent a real number in $(0,1]$ in the form \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $d_{i}\in\mathbb{N}$. We discuss ergodic theoretical and dimension theoretical aspects of this…

Dynamical Systems · Mathematics 2024-06-18 Jörg Neunhäuserer

Let $b \ge 2$ be an integer and $\xi$ an irrational real number. We prove that, if the irrationality exponent of $\xi$ is equal to $2$ or slightly greater than $2$, then the $b$-ary expansion of $\xi$ cannot be `too simple', in a suitable…

Number Theory · Mathematics 2015-10-02 Yann Bugeaud , Dong Han Kim

Enumerating the number of times one word occurs in another is a much-studied combinatorial subject. By utilizing a method that we call ``lexicographic extreme referencing'', we provide a formula for computing occurrences of one binary word…

Combinatorics · Mathematics 2025-07-08 Roger Tian

In this short note we prove that, if $p$ is an odd prime dividing the order of a sporadic simple group, then with the exception of four groups for $p=3$, all sporadic simple groups are generated by an involution and an element of order $p$.

Group Theory · Mathematics 2015-07-08 David A. Craven

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

Number Theory · Mathematics 2024-06-13 Fei Xue , Jinjiang Li , Min Zhang

In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.

Combinatorics · Mathematics 2011-03-08 Ayse Karaman

In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.

Number Theory · Mathematics 2013-05-17 Timothy Foo , Liangyi Zhao

The purpose of this note is give some evidence in support of conjectures of Poonen, and Morton and Silverman, on the periods of rational numbers under the iteration of quadratic polynomials. In particular, Poonen conjectured that there are…

Dynamical Systems · Mathematics 2010-04-14 Benjamin Hutz , Patrick Ingram

Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.

Number Theory · Mathematics 2024-03-19 Thomas Wright

For a prime $p$, let $E_{p,p^m}=\{\begin{pmatrix}a&b\\p^{m-1}c&d\end{pmatrix}|a,b,c\in\mathbb{Z}_{p},~\mathrm{and}~d\in \mathbb{Z}_{p^{m}}\}$. We first establish a ring isomorphism from $\mathrm{End}(\mathbb{Z}_p\times\mathbb{Z}_p^m)$ onto…

Number Theory · Mathematics 2016-05-04 Xiusheng Liu , Hualu Liu

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

Number Theory · Mathematics 2013-02-14 D. Bazzanella , A. Languasco , A. Zaccagnini