Related papers: A primality criterion based on a Lucas' congruence

A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…

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…

In this paper, we present several new $q$-congruences on the $q$-trinomial coefficients introduced by Andrews and Baxter. As a conclusion, we obtain the following congruence: \begin{align*}…

Let $n$ be a nonnegative integer. The $n$-th Ap\'{e}ry number is defined by $$ A_n:=\sum_{k=0}^n\binom{n+k}{k}^2\binom{n}{k}^2. $$ Z.-W. Sun ever investigated the congruence properties of Ap\'{e}ry numbers and posed some conjectures. For…

A positive square-free integer is called a \textit{congruent number} if it arises as the area of a right triangle with rational side lengths. Let $ n = p_1p_2 \cdots p_t q $ be a square-free integer, where each $ p_i \equiv 1 \pmod{8} $ and…

Let $k\ge 1$ be an integer, and let $(U_n)$ be the Lucas sequence of the first kind defined by \begin{equation*}\label{Eq:Lucas} U_0=0,\quad U_1=1\quad \mbox{and} \quad U_n=kU_{n-1}+U_{n-2} \quad \mbox{ for $n\ge 2$}. \end{equation*} It is…

We describe a primality test for number $M=(2p)^{2^n}+1$ with odd prime $p$ and positive integer $n$. And we also give the special primality criteria for all odd primes $p$ not exceeding 19. All these primality tests run in polynomial time…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

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…

A set of positive integers is primitive (or 1-primitive) if no member divides another. Erd\H{o}s proved in 1935 that the weighted sum $\sum1/(n \log n)$ for $n$ ranging over a primitive set $A$ is universally bounded over all choices for…

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Let $\omega^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Assuming the Elliott--Halberstam Conjecture, we prove a conjecture posted by M. R. Murty and V. K. Murty in 2021 which states that $$\sum_{n\leqslant…

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is…

We prove a $q$-analog of a classical binomial congruence due to Ljunggren which states that \[ \binom{a p}{b p} \equiv \binom{a}{b} \] modulo $p^3$ for primes $p\ge5$. This congruence subsumes and builds on earlier congruences by Babbage,…

In the first paper under this title (1977), the first author utilized a duality identity between the largest and smallest prime factors involving the Moebius function, to establish the following result as a consequence of the Prime Number…