相关论文: Unit fractions with shifted prime denominators
Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{\nu \geq 1} \left\{\frac{n}{p^\nu}\right\} > 1 \quad \iff \quad p \mid…
Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…
Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$
For a positive integer $n$ let $H_n=\sum_{k=1}^{n}1/k$ be the $n$th harmonic number. Z. W. Sun conjectured that for any prime $p\ge 5$, $$ \sum_{k=1}^{p-1}\frac{H_k}{k\cdot 2^k} \equiv7/24pB_{p-3}\pmod{p^2}. $$ This conjecture is recently…
Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…
Let $G$ be a finite group of order divisible by a prime $p$. The number of $p$-regular and $p'$-regular conjugacy classes of $G$ is at least $2\sqrt{p-1}$. Also, the number of $p$-rational and $p'$-rational irreducible characters of $G$ is…
We prove that any set $A\subset \mathbb{N}$ of positive upper density contains a finite $S\subset A$ such that $\sum_{n\in S}\frac{1}{n}=1$, answering a question of Erd\H{o}s and Graham.
Let p be a prime = 3 (mod 4). A number of elegant number-theoretical properties of the sums T(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} tan(n^2\pi/p) and C(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} cot(n^2\pi/p) are proved. For example, T(p) equals p times…
We show that each rational number $r$, $0\le r<1$, occurs as the fractional part of a Dedekind sum $S(m,n)$.
Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…
Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac p{k+b}\pmod {p^2}$. For $n=0,1,2,\ldots$ let $D_n$ and $b_n$ be Domb…
A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…
In this paper, we confirm some congruences conjectured by V.J.W. Guo and M.J. Schlosser recently. For example, we show that for primes $p>3$, $$…
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…
For $k=1,2,\ldots$ let $H_k$ denote the harmonic number $\sum_{j=1}^k 1/j$. In this paper we establish some new congruences involving harmonic numbers. For example, we show that for any prime $p>3$ we have…
Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…
In this paper, we mainly prove a congruence conjecture of Z.-W. Sun \cite{Sjnt}: Let $p>5$ be a prime. Then $$ \sum_{k=(p+1)/2}^{p-1}\frac{\binom{2k}k^2}{k16^k}\equiv-\frac{21}2H_{p-1}\pmod{p^4}, $$ where $H_n$ denotes the $n$-th harmonic…
We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
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}.…