Related papers: A binary additive equation involving fractional po…

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.

Let $h$ and $l$ be integers such that $0\le h\le 2$, $0\le l\le 4$. We obtain asymptotic formulas for the numbers of solutions of the equations $n-3m=h$, $n-5m=l$ in positive integers $m$ and $n$ of a special kind, $m\le X$.

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

In this methodological paper, we first review the classic cubic Diophantine equation $a^3 + b^3 + c^3 = d^3$, and consider the specific class of solutions $q_1^3 + q_2^3 + q_3^3 = q_4^3$ with each $q_i$ being a binary quadratic form. Next…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

For a composite $n$ and an odd $c$ with $c$ not dividing $n$, the number of solutions to the equation $n+a\equiv b\mod c$ with $a,b$ quadratic residues modulus $c$ is calculated. We establish a direct relation with those modular solutions…

Let [\theta] denote the integer part and {\theta} the fractional part of the real number \theta. For \theta > 1 and {\theta^{1/n}} \neq 0, define M_{\theta}(n) = [1/{\theta^{1/n}}]. The arithmetic function M_{\theta}(n) is eventually…

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

If $N = {p^k}{m^2}$ is an odd perfect number with special prime factor $p$, then it is proved that ${p^k} < (2/3){m^2}$. Numerical results on the abundancy indices $\frac{\sigma(p^k)}{p^k}$ and $\frac{\sigma(m^2)}{m^2}$, and the ratios…

Let $ \{F_n\}_{n\ge 0} $ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F,p}(c)$ for the number of distinct representations of $c$ as $F_k-p^\ell$ with $k\ge 2$ and $\ell\ge 0$. We prove that…

Let $F_n$ be the $n$-th Fibonacci number. In this paper, we study the Diophantine equation $F_n+F_m=p^xq^y$ in nonnegative integers $n\ge m$, $x$ and $y$, where $p$ and $q$ are fixed distinct prime numbers. We determine all pairs of primes…

Given a set of positive integers A = {a_1,...,a_n}, we study the number p_A (t) of nonnegative integer solutions (m_1,...,m_n) to m_1 a_1 + ... m_n a_n = t. We derive an explicit formula for the polynomial part of p_A.

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