English
Related papers

Related papers: An arithmetical excursion via Stoneham numbers

200 papers

In this note, we study the problem of existence of sequences of consecutive 1's in the periodic part of the continued fractions expansions of square roots of primes. We prove unconditionally that, for a given $N\gg 1$, there are at least…

Number Theory · Mathematics 2019-04-09 Piotr Miska , Maciej Ulas

The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…

Number Theory · Mathematics 2020-10-16 Laura Capuano , Nadir Murru , Lea Terracini

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

Number Theory · Mathematics 2023-09-04 Vítězslav Kala , Piotr Miska

Expressions of type $(p^q-1)/(p-1)$ and $a^2+ab+b^2$, where $a, b$ are natural and $p, q$ are prime numbers, are studied.

General Mathematics · Mathematics 2023-02-06 Zurab Aghdgomelashvili

We study rational numbers with purely periodic R\'enyi $\beta$-expansions. For bases $\beta$ satisfying $\beta^2=a\beta+b$ with $b$ dividing $a$, we give a necessary and sufficient condition for $\gamma(\beta)=1$, i.e., that all rational…

Dynamical Systems · Mathematics 2018-03-15 Tomáš Hejda , Wolfgang Steiner

In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…

Number Theory · Mathematics 2018-05-04 Arnold Adelberg

In this paper we give an algorithm to calculate the coefficients of the p-adic expansion of a rational numbers, and we give a method to decide whether this expansion is periodic or ultimately periodic.

Number Theory · Mathematics 2024-05-24 R. Belhadef , H-A. Esbelin

Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…

Number Theory · Mathematics 2021-07-27 Kalyan Chakraborty , Krishnarjun Krishnamoorthy

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

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…

Number Theory · Mathematics 2017-08-24 Yann Bugeaud , Dong Han Kim

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

Number Theory · Mathematics 2013-03-01 Terence Tao , Tamar Ziegler

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Number Theory · Mathematics 2007-08-09 William D. Banks , Igor E. Shparlinski

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

Number Theory · Mathematics 2016-12-06 William D. Banks , Victor Z. Guo

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Logic in Computer Science · Computer Science 2022-05-25 Ruben Gamboa , Woodrow Gamboa

We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…

Number Theory · Mathematics 2022-06-15 Khristo N. Boyadzhiev

In a landmark paper on arithmetical properties of Lambert series, Erd\H{o}s proved that $\sum_{n=1}^{\infty} \frac{1}{2^{n} - 1}$ is irrational. This value $E$ is now referred to as the Erd\H{o}s-Borwein constant. Crandall, in 2012, studied…

Number Theory · Mathematics 2026-05-26 John M. Campbell

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

Number Theory · Mathematics 2012-11-16 Jean Bourgain

Let $p$ be a prime $\equiv 3$ mod 4, $p>3$, and suppose that 10 has the order $(p-1)/2$ mod p. Then $1/p$ has a decimal period of length $(p-1)/2$. We express the frequency of each digit $0,\ldots,9$ in this period in terms of the class…

Number Theory · Mathematics 2026-04-28 Kurt Girstmair

We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$,…

Number Theory · Mathematics 2020-03-02 Zhi-Wei Sun

We introduce a refinement of the classical Liouville function to primes in arithmetic progressions. Using this, we discover new biases in the appearances of primes in a given arithmetic progression in the prime factorizations of integers.…

Number Theory · Mathematics 2020-07-24 Peter Humphries , Snehal M. Shekatkar , Tian An Wong
‹ Prev 1 2 3 10 Next ›