Related papers: Toda primes

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…

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

There are two-dimensional Toda field equations corresponding to each (finite or affine) Lie algebra. The question addressed in this note is whether there exist integrable discrete versions of these. It is shown that for certain algebras…

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

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}$…

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Given a pair of distinct non-CM normalized eigenforms having integer Fourier coefficients $a_1 (n)$ and $a_2(n)$, we count positive integers $n$ with $(a_1(n), a_2(n))=1$ and make a conjecture about the density of the set of primes $p$ for…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Recently, Romik determined in [9] the Taylor expansion of the Jacobi theta constant \theta_3, around the point x = 1. He discovered a new integer sequence, (d(n))_0^\infty=1, 1, -1, 51, 849, -26199, \dots, from which the Taylor coefficients…

We show that for every positive integer $k$, there exist $k$ consecutive primes having the property that if any digit of any one of the primes, including any of the infinitely many leading zero digits, is changed, then that prime becomes…

We establish two new Waring--Goldbach type representations: every sufficiently large odd integer $n$ can be expressed as \[ n = p_1^2 + p_2^2 + p_3^3 + p_4^3 + p_5^5 + p_6^6 + p_7^c, \] where each $p_i$ is prime and $c \in \{6,7\}$.

For a fixed integer $r\ge1$, we say $k$-tuple integers $(x_1,\ldots,x_k)$ are relatively $r$-prime if there exists no prime $p$ such that all $k$ integers is multiple of $p^r$. Benkoski proved that the number of relatively $r$-prime…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…

By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…