Let $ε$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+ε},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j] \} $$ contains almost all the residue classes modulo $m$ (i.e., its cardinality is equal to $m+o(m)$). We further show that if $m$ is cubefree, then for any positive integers $N_1,N_2,N_3,N_4$ with $N_1N_2N_3N_4>m^{1+ε},$ the set $$ \{x_1x_2x_3x_4 \pmod m: \quad x_j\in [1,N_j] \} $$ also contains almost all the residue classes modulo $m.$
Let $p$ be a large prime parameter and let $p>N>p^{63/76+ε}.$ We prove that for any nonzero integer constant $k$ and any integer $λ\not\equiv 0\pmod p$ the congruence $$ p_1p_2(p_3+k)\equiv λ\pmod p $$ admits $(1+o(1))π(N)^3/p$ solutions in prime numbers $p_1, p_2, p_3\le N.$
In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv λ\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large prime number, $λ$ is an integer corpime to $p$. Our arguments are based on recent estimates of trigonometric sums over subgroups due to Shkredov and Shteinikov.
It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for every prime $p$. This characterization leads to an algorithm for computing all such solutions, when there is a finite number of them. More generally, our algorithm enables computing all the solutions below a much higher bound as compared to what can be achieved by a naive exhaustive search.
Let $\Bbb Z$ be the set of integers, and let $p$ be a prime of the form $4k+1$. Suppose $q\in\Bbb Z$, $2\nmid q$, $p\nmid q$, $p=c^2+d^2$, $c,d\in\Bbb Z$ and $c\equiv 1\pmod 4$. In this paper we continue to discuss congruences for $q^{[p/8]}\pmod p$ and present new reciprocity laws, but we assume $4p=x^2+qy^2$ or $p=x^2+2qy^2$, where $[\cdot]$ is the greatest integer function and $x,y\in\Bbb Z$.
For the unrestricted partition function $p(n)$ for integers $n \geq 0$, it is known that $p(49n + 19) \equiv 0 \pmod{49}$, $p(49n + 33) \equiv 0 \pmod{49}$, and $p(49n + 40) \equiv 0 \pmod{49}$ for all $n \geq 0$. We find witness identities for these Ramanujan congruences.
Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such congruences, those of the form $p_{-t}(\ell n + a) \equiv 0 \pmod {\ell}$, were previously studied by Kiming and Olsson. If $\ell \geq 5$ is prime and $-t \not \in \{\ell - 1, \ell -3\}$, then such congruences satisfy $24a \equiv -t \pmod {\ell}$. Inspired by Lin's example, we obtain natural infinite families of such congruences. If $\ell\equiv2\pmod{3}$ (resp. $\ell…
In this work we consider the congruence $\sum_{j=1}^{n-1} j^{k(n-1)} \equiv -1 \pmod n$ for each $k \in \mathbb{N}$, thus extending Giuga's ideas for $k=1$. In particular, it is proved that a pair $(n,k)\in \mathbb{N}^2$ satisfies this congruence if and only if $n$ is prime or a Giuga Number and $λ(n) \mid k(n-1)$. In passing, we establish new characterizations of Giuga numbers and we study some properties of the numbers $n$ satisfying $λ(n) \mid k(n-1)$.
Let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of weight $n$. Recently, Hirschhorn and Sellers, Yao, and Xia established a number of congruences modulo 2 and 5, 4 and 8, and 25 for $f(n)$, respectively. In this note, we shall prove several new congruences modulo 125 and 11 by using some results of modular forms. For example, for all $n\ge 0$, we have \begin{align*} f(1250n+125)&\equiv 0 \pmod{125},\\ f(1250n+1125)&\equiv 0 \pmod{125},\\ f(2750n+825)&\equiv 0 \pmod{11},\\ f(2750n+1925)&\equiv 0 \pmod{11}. \end{align*}
We show that if the congruence above holds and $n\mid m$, then the quotient $Q:=m/n$ satisfies $\sum_{p\mid Q} \frac{Q}{p}+1 \equiv 0\pmod{Q}$, where $p$ is prime. The only known solutions of the latter congruence are $Q=1$ and the eight known primary pseudoperfect numbers $2,6,42, 1806, 47058, 2214502422, 52495396602,$ and $8490421583559688410706771261086$. Fixing $Q$, we prove that the set of positive integers $n$ satisfying the congruence in the title, with $m=Q n$, is empty in case $Q=52495396602$, and in the other eight cases has an asymptotic density between bounds in $(0,1)$ that we pro…
We use the arithmetic of ideals in orders to parameterize the roots $μ\pmod m$ of the polynomial congruence $F(μ) \equiv 0 \pmod m$, $F(X) \in \mathbb{Z}[X]$ monic, irreducible and degree $d$. Our parameterization generalizes Gauss's classic parameterization of the roots of quadratic congruences using binary quadratic forms, which had previously only been extended to the cubic polynomial $F(X) = X^3 - 2$. We show that only a special class of ideals are needed to parameterize the roots $μ\pmod m$, and that in the cubic setting, $d = 3$, general ideals correspond to pairs of roots $μ_1 \pmod{m_1…
Let $p\equiv3\pmod{4}$ be a prime and $r$ a positive integer. We show that $$ \prod_{k=1}^{(p^{2r}-1)/2}\frac{4k-1}{4k+1}\equiv1\pmod{p^2}. $$ This confirms a recent conjecture of Guo.
Let $\ell \geq 5$ be prime. For the partition function $p(n)$ and $5 \leq \ell \leq 31$, Atkin found a number of examples of primes $Q \geq 5$ such that there exist congruences of the form $p(\ell Q^{3} n+β) \equiv 0 \pmod{\ell}.$ Recently, Ahlgren, Allen, and Tang proved that there are infinitely many such congruences for every $\ell$. In this paper, for a wide range of $c \in \mathbb{F}_{\ell}$, we prove congruences of the form $p(\ell Q^{3} n+β_{0}) \equiv c \cdot p(\ell Q n+β_{1}) \pmod{\ell}$ for infinitely many primes $Q$. For a positive integer $r$, let $p_{r}(n)$ be the $r$-colored par…
Let $p>3$ be a prime, and let $a$ be a rational p-adic integer. Let $\{B_n(x)\}$ and $\{E_n(x)\}$ denote the Bernoulli polynomials and Euler polynomials, respectively. In this paper we show that $$\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\equiv (-1)^{\langle a\rangle_p}+ p^2t(t+1)E_{p-3}(-a)\pmod{p^3}$$ and for $a\not\equiv -\frac 12\pmod p$, $$\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac 1{2k+1}\equiv \frac{1+2t}{1+2a} +p^2\frac{t(t+1)}{1+2a}B_{p-2}(-a)\pmod{p^3},$$ where $\langle a\rangle_p\in\{0,1,\ldots,p-1\}$ satisfying $a\equiv \langle a\rangle_p\pmod p$ and $t=(a-\langle a\rangle_p)/p$. Tak…
Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge 0$, \[\mathrm{pod}(3n+2)\equiv 2{{(-1)}^{n+1}}{{r}_{5}}(8n+5) \pmod{9}, \] and \[\mathrm{pod}(5n+2)\equiv 2{{(-1)}^{n}}{{r}_{3}}(8n+3) \pmod{5}.\] From which we deduce many interesting congruences including the following two infinite families of Ramanujan-type congruences: for $a \in \{11, 19\}$ and any integers $α\ge 1$ and $n \ge 0$, we have \[\mathrm{pod}\B…
We prove several results which imply the following consequences. For any $\varepsilon>0$ and any sufficiently large prime $p$, if $\cI_1,\ldots, \cI_{13}$ are intervals of cardinalities $|\cI_j|>p^{1/4+\varepsilon}$ and $abc\not\equiv 0\pmod p$, then the congruence $$ ax_1\cdots x_6+bx_7\cdots x_{13}\equiv c\pmod p $$ has a solution with $x_j\in\cI_j$. There exists an absolute constant $n_0\in\N$ such that for any $0<\varepsilon<1$ and any sufficiently large prime $p$, any quadratic residue $λ$ modulo $p$ can be represented in the form $$ x_1\cdots x_{n_0}\equiv λ\pmod p,\quad x_i\in\N,\quad x…
Let $q$ be an odd prime and $f(x)$, $g(x)$ be polynomials with integer coefficients. If the system of congruences $f(x) \equiv g(x) \equiv 0 \pmod{q}$ has $\ell$ solutions, then $R\left(f(x),g(x)\right)\equiv 0 \pmod{q^\ell}$, where $R\left(f(x),g(x)\right)$ is the resultant of the polynomials. Using this result we give new proofs of some known congruences involving the Lucas sequences.
We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmodα$ has the solution $β$ with $0 < β< α$ if and only if $α/β$ has a continued fraction expansion with sequence of quotients having one of a finite number of possible asymmetry types. This generalizes the old theorem that a rational number $α/β> 1$ in lowest terms has a symmetric continued fraction precisely when $β^2 \equiv \pm 1 \pmodα$.
In this paper we consider the congruence equation $q_1 q_2 \equiv c \pmod q$ with $a < q_1 \leq a + q^{1/2+ε}$ and $b < q_2 \leq b + q^{1/2+ε}$ and show that it has solution for almost all $a$ and $b$. Then we apply it to a question of Fujii and Kitaoka as well as generalize it to more variables. At the end, we will present a new way to attack the above congruence equation question through higher moments.
Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Recently, Fortin-Jacob-Mathieu and Hirschhorn-Sellers independently obtained 2-, 3- and 4-dissections of the generating function for $\overline{p}(n)$ and derived a number of congruences for $\overline{p}(n)$ modulo $4$, $8$ and $64$ including $\overline{p}(5n+2)\equiv 0 \pmod{4}$, $\overline{p}(4n+3)\equiv 0 \pmod{8}$ and $\overline{p}(8n+7)\equiv 0 \pmod{64}$. By employing dissection techniques, Yao and Xia obtained congruences for $\overline{p}(n)$ modulo $8, 16$ and $32$, such as $\overline{p}(48n+26) \equiv 0 \pmod{8}$, $\o…
Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+β)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural families distinguished by the square class of $1-24β\pmod\ell$. In recent decades much work has been done to understand congruences of the form $p(Q^m\ell n+β)\equiv 0\pmod\ell$. It is now known that there are many such congruences when $m\geq 4$, that such congruences are scarce (if they exist at all) when $m=1, 2$, and that for $m=0$ such congruences exist onl…
We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd} -{2^{n+1}+4\over n6^n} B_{p-n}({1\over 3}) &\pmod{p} &{if $n$ is even}. $$ where $n$ is a positive integer and $p$ is prime such that $p>\max(n+1,3)$.
Let $\{P_n\}$ be the Catalan-Larcombe-French numbers given by $P_0=1,\ P_1=8$ and $n^2P_n=8(3n^2-3n+1)P_{n-1}-128(n-1)^2P_{n-2}$ $(n\ge 2)$, and let $S_n=P_n/2^n$. In this paper we deduce congruences for $S_{mp^r}\pmod{p^{r+2}}$, $S_{mp^r-1}\pmod{p^r}$ and $S_{mp^r+1}\pmod{p^{2r}}$, where $p$ is an odd prime and $m,r$ are positive integers. We also prove that $S_{(p^2-1)/2}\equiv 0\pmod {p^2}$ for any prime $p\equiv 5,7\pmod 8$, and show that $\{S_m\}$ is log-convex.
Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper we solve some conjectures of Z.W. Sun concerning $\sum_{k=0}^{p-1}\binom{2k}k^3/m^k\pmod{p^2}$, $\sum_{k=0}^{p-1}\binom{2k}k\b{4k}{2k}/m^k\pmod p$ and $\sum_{k=0}^{p-1}\binom{2k}k^2\b{4k}{2k}/m^k\pmod {p^2}.$ In particular, we show that $\sum_{k=0}^{\frac{p-1}{2}}\binom{2k}k^3\equiv 0\pmod {p^2}$ for $p\equiv 3,5,6\pmod 7$. Let $P_n(x)$ be the Legendre polynomials. In the paper we also show that $ P_{[\frac {p}{4}]}(t)\equiv -\big(\frac{-6}{p}\big)\sum_{x=0}^{p-1} \big(\frac{x^3-3/2(3t+5)x-9t-7}{p}\big)\pmod p$ and d…
Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of congruences of the same kind $$\sum_{k=1}^{\lfloor\frac{ap}{r}\rfloor}\binom{2k}{k}x^k \pmod{p^2}$$ where $p$ is a prime such that $p\equiv 1 \pmod{r}$, $a/r$ is a fraction in $(1/2,1)$ and $x$ is a $p$-adic integer. The key ingredients are the $p$-adic Gamma functions $Γ_p$ and a special class of computer-discovered hypergeometric identities.
In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a subset of the field of residue classes modulo $p$ having small multiplicative doubling. We then use this estimate to show that the number of solutions of the congruence $$ x^n\equiv λ\pmod p; \quad x\in \N, \quad L<x<L+p/n, $$ is at most $p^{\frac{1}{3}-c}$ uniformly over positive integers $n, λ$ and $L$, for some absolute constant $c>0$. This implies, in part…
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 and Almkvist-Zudilin numbers, respectively. We also establish congruences for $$\sum_{n=0}^{p-1}\frac{D_n}{16^n},\quad \sum_{n=0}^{p-1}\frac{D_n}{4^n}, \quad \sum_{n=0}^{p-1}\frac{b_n}{(-3)^n},\quad \sum_{n=0}^{p-1}\frac{b_n}{(-27)^n}\pmod {p^2}$$ in terms of certain binary quadratic forms.
In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $\mathcal{P}_{n}$ denote the set of positive integers which are prime to $n$. In this note, we obtain the congruences for distinct odd primes $p,~q$ and positive integers $α,~β$, \begin{equation*} \sum\limits_{i+j+k=p^αq^β\atop{i,j,k\in\mathcal{P}_{pq}\atop{i\equiv j\equiv k\equiv 1\pmod{2}}}}\frac{1}{ijk}\equiv\frac{7}{8}(2-q)(1-\f…
We determine a necessary and sufficient condition for the infinitude of primes $p$ such that none of the equations $a_i^x \equiv b_i \pmod{p}, 1 \le i \le n,$ are solvable. We control the insolvability of $a^x \equiv b \pmod{p}$ by power residues for multiplicatively independent $a$ and $b$, and by divisibilities and, most importantly, parities of orders in multiplicatively dependent cases. We also consider a more general problem concerning divisibilities of orders. The problems are motivated by Artin's primitive root conjecture and its variants.
In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} Z(p^{r})\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $ Z(n)=\sum\limits_{i+j+k=n\atop{i,j,k\in\mathcal{P}_{n}}}\frac{1}{ijk}$ and $\mathcal{P}_{n}$ denote the set of positive integers which are prime to $n$. In this note, we obtain a congruence for distinct odd primes $p,~q$ and positive integers $α,~β$, \begin{equation*} Z(p^αq^β)\equiv 2(2-q)(1-\frac{1}{q^{3}})p^{α-1}q^{β-1}B_{p-3}\pmod{p^α} \end{equation*} and the necessary and sufficient co…
Let $p$ be a prime. In 1878 É. Lucas proved that the congruence $$ {p-1\choose k}\equiv (-1)^k\pmod{p}$$ holds for any nonnegative integer $k\in\{0,1,\ldots,p-1\}$. The converse statement was given in Problem 1494 of {\it Mathematics Magazine} proposed in 1997 by E. Deutsch and I.M. Gessel. In this note we generalize this converse assertion by the following result: If $n>1$ and $q>1$ are integers such that $$ {n-1\choose k}\equiv (-1)^k \pmod{q}$$ for every integer $k\in\{0,1,\ldots, n-1\}$, then $q$ is a prime and $n$ is a power of $q$.
We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables from rather general sets.
The cubic partitions of a natural number $n$, introduced by Chan and Kim, have generating function $\sum_{n=0}^{\infty}a(n)q^n= \frac{1}{(q; q)_{\infty}(q^2; q^2)_{\infty}}.$ In this paper, we generalize some results of Chen-Lin, which suggest that $a(n)$ should have analogous properties of the ordinary partition function. Specifically, we show that for every non-negative integer $n$, $a(5^4n+547)\equiv 0\pmod{5^2}, a(7^3n+190)\equiv 0\pmod{7^2}, a(7^3n+288 \equiv 0\pmod{7^2} and a(7^3n+337)\equiv 0\pmod{7^2}.$
Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Apéry numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For example, for any prime $p>5$ we have $$\sum_{k=1}^{p-1}\frac{g_k(-1)}{k}\equiv 0\pmod{p^2}\quad{and}\quad\sum_{k=1}^{p-1}\frac{g_k(-1)}{k^2}\equiv 0\pmod p.$$ This is similar to Wolstenholme's classical congruences $$\sum_{k=1}^{p-1}\frac1k\equiv0\pmod{p^2}\quad{and}\quad\sum_{k=1}^{p-1}\frac{1}{k^2}\equiv0\pmod p$$ for any prime $p>3$.
We investigate congruence relations of the form $p_r(\ell m n + t) \equiv 0 \pmod{\ell}$ for all $n$, where $p_r(n)$ is the number of $r$-colored partitions of $n$ and $m,\ell$ are distinct primes.
Motivated by a desire to understand the distribution of roots of cubic congruences, we re-derive a parametrization of roots $ν\pmod m$ of $X^3 \equiv 2 \pmod m$ found by Hooley. Although this parametrization does not lead us here to anything towards proving equidistribution of the sequence $\fracν{m} \pmod 1$, we are able to prove spacing results, and then a large sieve type inequality, which we view as analogous to the large sieve inequality for roots of quadratic congruences found by Fouvry and Iwaniec in their proof that there are infinitely many primes of the form $n^2 + p^2$. The parametr…
Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Hirschhorn and Sellers showed that $\overline{p}(4n+3)\equiv 0 \pmod{8}$ for $n\geq 0$. They also conjectured that $\overline{p}(40n+35)\equiv 0 \pmod{40}$ for $n\geq 0$. Chen and Xia proved this conjecture by using the $(p,k)$-parametrization of theta functions given by Alaca, Alaca and Williams. In this paper, we show that $\overline{p}(5n)\equiv (-1)^{n}\overline{p}(4\cdot 5n) \pmod{5}$ for $n \geq 0$ and $\overline{p}(n)\equiv (-1)^{n}\overline{p}(4n)\pmod{8}$ for $n \geq 0$ by using the relation of the generating function o…
For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence $x^x \equiv y^y \pmod p$, $1 \le x,y \le p-1$, which is of cryptographic relevance.
This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical evidence in favour of these conjectures, and discuss the algorithms used in our calculations.
In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the congruence \[ g(p_{1})\, + \,\ldots\, + \,g(p_{k}) \,\equiv\, m\pmod{q} \] in prime variables $p_{1},\ldots, p_{k}\le N$, $N\le q^{1-δ}$. Here $g(x)\,\equiv\,a\overline{x}+bx\pmod{q}$, where $a,b,m$ and $k\ge 3$ are arbitrary integers, $(ab,q)=1$. The main result of the paper gives an asymptotic formula for the number of solutions for the case when $q$ is coprime …
We show, in an effective way, that there exists a sequence of congruence classes $a_k\pmod {m_k}$ such that the minimal solution $n=n_k$ of the congruence $ϕ(n)\equiv a_k\pmod {m_k}$ exists and satisfies $\log n_k/\log m_k\to\infty $ as $k\to\infty$. Here, $ϕ(n)$ is the Euler function. This answers a question raised in \cite{FS}. We also show that every congruence class containing an even integer contains infinitely many values of the Carmichael function $λ(n)$ and the least such $n$ satisfies $n\ll m^{13}$.
We show that for any prime prime $p\not=2$ $$\sum_{k=1}^{p-1} {(-1)^k\over k}{-{1\over 2} \choose k} \equiv -\sum_{k=1}^{(p-1)/2}{1\over k} \pmod{p^3}$$ by expressing the l.h.s. as a combination of alternating multiple harmonic sums.
In this paper we establish some congruences involving the Apéry numbers $β_{n}=\sum_{k=0}^{n}\binom{n}{k}^2\binom{n+k}{k}$ $(n=0,1,2,\ldots)$. For example, we show that $$\sum_{k=0}^{n-1}(11k^2+13k+4)β_k\equiv0\pmod{2n^2}$$ for any positive integer $n$, and $$\sum_{k=0}^{p-1}(11k^2+13k+4)β_k\equiv 4p^2+4p^7B_{p-5}\pmod{p^8}$$ for any prime $p>3$, where $B_{p-5}$ is the $(p-5)$th Bernoulli number. We also present certain relations between congruence properties of the two kinds of Apery numbers, $β_n$ and $A_n=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2$.
Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo $a$ of the number of concave compositions. Let $c(n)$ be the number of concave compositions of $n$ having even length. It is easy to see that $c(n)$ is even for all $n\geq1$. Refining this fact, we prove that $$\#\{n<X:c(n)\equiv 0\pmod 4\}\gg\sqrt{X}$$ and also that for every $a>2$ and at least two distinct values of $r\in\{0,1,\dotsc,a-1\}$, $$\#\{n<X: c(n)\equiv r\pmod{a}\} > \frac{\log_2\log_3 X}{a}.$$ We obtain similar results for concave compositions of odd leng…
We find and prove a class of congruences modulo 4 for Andrews' partition with certain ternary quadratic form. We also discuss distribution of $\overline{\mathcal{EO}}(n)$ and further prove that $\overline{\mathcal{EO}}(n)\equiv0\pmod4$ for almost all $n$. This study was inspired by similar congruences modulo 4 in the work by the second author and Garvan.
Let $a(n)$ defined by $\sum_{n=1}^{\infty}a(n)q^n := \prod_{n=1}^{\infty}\frac{1}{(1-q^{3n})(1-q^n)^3}.$ In this note, we prove that for every non-negative integer $n$, a(15n+6) \equiv 0\pmod{5}, a(15n+12) \equiv 0\pmod{5}. As a corollary, we obtained some results of Ono
In this paper, we mainly prove the following congruence conjectured by J.-C. Liu: $$ {}_6F_5\bigg[\begin{matrix}\frac{5}{4}&\frac{1}{2}&\frac{1}{2}&\frac{1}{2}&\frac{1}{2}&\frac{1}{2}\\&\frac{1}{4}&1&1&1&1\end{matrix}\bigg|\ -1\bigg]_{\frac{p-1}{2}}\equiv-\frac{p^3}{16}Γ_p\left(\frac{1}{4}\right)^4\pmod{p^5}, $$ where $p\geq5$ are primes with $p\equiv3\pmod{4}$.
The Apéry numbers $A_n$ and central Delannoy numbers $D_n$ are defined by $$A_n=\sum_{k=0}^{n}{n+k\choose 2k}^2{2k\choose k}^2, \quad D_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}. $$ Motivated by some recent work of Z.-W. Sun, we prove the following congruences: \sum_{k=0}^{n-1}(2k+1)^{2r+1}A_k &\equiv \sum_{k=0}^{n-1}\varepsilon^k (2k+1)^{2r+1}D_k \equiv 0\pmod n, where $n\geqslant 1$, $r\geqslant 0$, and $\varepsilon=\pm1$. For $r=1$, we further show that \sum_{k=0}^{n-1}(2k+1)^{3}A_k &\equiv 0\pmod{n^3}, \quad \sum_{k=0}^{p-1}(2k+1)^{3}A_k &\equiv p^3 \pmod{2p^6}, where $p>3$ is a prime. …
Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak \binom{-1-a}k}{m^k}\equiv 0\pmod {p^2}.$$
For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th Euler number, $E_{n,a}$ can be viewed as a natural generalization of Euler numbers. In this paper we deduce some identities and an inversion formula involving $\{E_{n,a}\}$, and establish congruences for $E_{2n,a}\mod{2^{{\rm ord}_2n+8}}$, $E_{2n,a}\pmod{3^{{\rm ord}_3n+5}}$ and $E_{2n,a}\pmod{5^{{\rm ord}_5n+4}}$ provided that $a$ is a nonzero integer, where $…
We give q-analogues of the following congruences by Z.-W. Sun: \sum_{k=1}^{p-1}\frac{D_k}{k} \equiv -\frac{2^{p-1}-1}{p} \pmod p,\\ \sum_{k=1}^{p-1}\frac{H_k}{k 2^k}\equiv 0 \pmod{p},\quad p\geqslant 5, where p is a prime, D_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k} are the Delannoy numbers, and H_n=\sum_{k=1}^n\frac{1}{k} are the harmonic numbers. We also prove that, for any positive integer m and prime p>m+1, \sum_{1\leqslant k_1\leqslant \cdots \leqslant k_m\leqslant p-1}\frac{1}{k_1\cdots k_m 2^{k_m}} \equiv\frac{1}{2}\sum_{k=1}^{p-1}\frac{(-1)^{k-1}}{k^m} \pmod p, which is a multiple g…
Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equivλ\pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals of length $M$, under the assumption that $Q(x,y)-λ$ is an absolutely irreducible polynomial modulo $p$. In particular we prove that the number of solutions to this congruence is $M^{o(1)}$ when $M\ll p^{1/4}$. These estimates generalize a previous result by Cilleruelo and Garaev on the particular congruence $xy\equiv λ\pmod{p}$.
For a nonzero integer $a$ let ${E_n^{(a)}}$ be given by $\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n$ $(n=0,1,2,...)$, where $[x]$ is the greatest integer not exceeding $x$. As $E_n^{(1)}=E_n$ is the Euler number, $E_n^{(a)}$ can be viewed as a generalization of Euler numbers. Let $k$ and $m$ be positive integers, and let $b$ be a nonnegative integer. In this paper, we determine $E_{2^mk+b}^{(a)}$ modulo $ 2^{m+10}$ for $m\ge 5$. For $m\ge 5$ we also establish congruences for $U_{kφ{(5^m)}+b},\; E_{kφ{(5^m)}+b},\; S_{kφ{(5^m)}+b}\pmod{5^{m+5}}$ and $S_{kφ{(3^m)}+b}\pmod{3^{m+5}}…
Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}^{[p/3]}\binom{3k}ka^k\pmod p$, and real the connection between cubic congruences and the sum $\sum_{k=1}^{[p/3]}\binom{3k}ka^k$, where $[x]$ is the greatest integer not exceeding $x$. Suppose that $a_1,a_2,a_3$ are rational p-adic integers, $P=-2a_1^3+9a_1a_2-27a_3$, $Q=(a_1^2-3a_2)^3$ and $PQ(P^2-Q)(P^2-3Q)(P^2-4Q)\not\equiv 0\pmod p$. In this paper we show that the number of solutions of the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$ depends only on $\sum_{k=1}^{[p…
The Apéry polynomials are given by $$A_n(x)=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2x^k\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Apéry numbers.) Let $p$ be an odd prime. We show that $$\sum_{k=0}^{p-1}(-1)^kA_k(x)\equiv\sum_{k=0}^{p-1}\frac{\binom{2k}k^3}{16^k}x^k\pmod{p^2},$$ and that $$\sum_{k=0}^{p-1}A_k(x)\equiv\left(\frac xp\right)\sum_{k=0}^{p-1}\frac{\binom{4k}{k,k,k,k}}{(256x)^k}\pmod{p}$$ for any $p$-adic integer $x\not\equiv 0\pmod p$. This enables us to determine explicitly $\sum_{k=0}^{p-1}(\pm1)^kA_k$ mod $p$, and $\sum_{k=0}^{p-1}(-1)^kA_k$ mod $p^2$ in the case $p\equiv 2\pmo…
