In this paper, we provide a complete classification of the $2$-$(v,3,λ)$ designs with $v\equiv 1,3\pmod{6}$ and $% v \equiv 6 \pmodλ$ admitting a flag-transitive automorphism group non-isomorphic to a subgroup of $AΓL_{1}(v)$.
We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $Γ$ is 2-arc transitive or the valency $p$ satisfies $p\equiv 1\pmod 4$, and for each such prime there is a unique graph with this property: it is a non-bipartite antipodal double cover of the complete graph $K_{p+1}$ with automorphism group $PSL(2,p)\times Z_2$ and diameter 3.
Several years ago, Long and Ramakrishna [Adv. Math. 290 (2016), 773--808] extended Van Hamme's (H.2) supercongruence to the modulus $p^3$ case. Recently, Guo [Int. J. Number Theory, to appear] found a $q$-analogue of the Long--Ramakrishna formula for $p\equiv 3\pmod 4$. In this note, a $q$-analogue of the Long--Ramakrishna formula for $p\equiv 1\pmod 4$ is derived through the $q$-Whipple formulas and the Chinese remainder theorem for coprime polynomials.
We show that the Smith normal form of a skew-symmetric D-optimal design of order $n\equiv 2\pmod{4}$ is determined by its order. Furthermore, we show that the Smith normal form of such a design can be written explicitly in terms of the order $n$, thereby proving a recent conjecture of Armario. We apply our result to show that certain D-optimal designs of order $n\equiv 2\pmod{4}$ are not equivalent to any skew-symmetric D-optimal design. We also provide a correction to a result in the literature on the Smith normal form of D-optimal designs.
We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form $C_n\square P_m$, that is, the Cartesian product of a path and a cycle, when $n\equiv 2\pmod{5}$, and we establish a new upper bound equal to the lower bound, thus computing the exact domination number for these graphs.
In this paper, we show that if $k\geq 6$ and $k \equiv 2 \pmod 4$, then there exists an almost resolvable $k$-cycle system of order $2kt+1$ for all $t\ge 1$ except possibly for $t=2$ and $k\geq 14$. Thus we give a partial solution to an open problem posed by Lindner, Meszka, and Rosa (J. Combin. Des., vol. 17, pp.404-410, 2009).
Let $m,n,s,k$ be four integers such that $3\leq s \leq n$, $3\leq k\leq m$ and $ms=nk$. Set $d=\gcd(s,k)$. In this paper we show how one can construct a Heffter array $H(m,n;s,k)$ starting from a square Heffter array $H(nk/d;d)$ whose elements belong to $d$ consecutive diagonals. As an example of application of this method, we prove that there exists an integer $H(m,n;s,k)$ in each of the following cases: $(i)$ $d\equiv 0 \pmod 4$; $(ii)$ $5\leq d\equiv 1 \pmod 4$ and $n k\equiv 3\pmod 4$; $(iii)$ $d\equiv 2 \pmod 4$ and $nk\equiv 0 \pmod 4$; $(iv)$ $d\equiv 3 \pmod 4$ and $n k\equiv 0,3\pmod …
We construct several cyclic $(v;k_1,k_2,k_3;λ)$ difference families with $v\equiv3 \pmod{4}$ a prime and $λ=k_1+k_2+k_3-(3v-1)/4$. Such families can be used in conjunction with the well-known Paley-Todd difference sets to construct skew-Hadamard matrices of order $4v$. Our main result is that we have constructed for the first time the example of skew-Hadamard matrices of orders $4\cdot239=956$ and $4\cdot331=1324$.
This paper focuses on constructions for optimal $2$-D $(n\times m,3,2,1)$-optical orthogonal codes with $m\equiv 0\ ({\rm mod}\ 4)$. An upper bound on the size of such codes is established. It relies heavily on the size of optimal equi-difference $1$-D $(m,3,2,1)$-optical orthogonal codes, which is closely related to optimal equi-difference conflict avoiding codes with weight $3$. The exact number of codewords of an optimal $2$-D $(n\times m,3,2,1)$-optical orthogonal code is determined for $n=1,2$, $m\equiv 0 \pmod{4}$, and $n\equiv 0 \pmod{3}$, $m\equiv 8 \pmod{16}$ or $m\equiv 32 \pmod{64}$…
Let $m,n,s,k$ be integers such that $4\leq s\leq n$, $4\leq k \leq m$ and $ms=nk$. Let $λ$ be a divisor of $2ms$ and let $t$ be a divisor of $\frac{2ms}λ$. In this paper we construct magic rectangles $MR(m,n;s,k)$, signed magic arrays $SMA(m,n;s,k)$ and integer $λ$-fold relative Heffter arrays ${}^λH_t(m,n;s,k)$ where $s,k$ are even integers. In particular, we prove that there exists an $SMA(m,n;s,k)$ for all $m,n,s,k$ satisfying the previous hypotheses. Furthermore, we prove that there exist an $MR(m,n;s,k)$ and an integer ${}^λH_t(m,n;s,k)$ in each of the following cases: $(i)$ $s,k \equiv 0…
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…
A ${\rm{TS}}(v,λ)$ is a pair $(V,\mathcal{B})$ where $V$ contains $v$ points and $\mathcal{B}$ contains $3$-element subsets of $V$ so that each pair in $V$ appears in exactly $λ$ blocks. A $2$-block intersection graph ($2$-BIG) of a ${\rm{TS}}(v,λ)$ is a graph where each vertex is represented by a block from the ${\rm{TS}}(v,λ)$ and each pair of blocks $B_i,B_j\in \mathcal{B}$ are joined by an edge if $|B_i\cap B_j|=2$. Using constructions for ${\rm{TS}}(v,λ)$ given by Schreiber, we show that there exists a ${\rm{TS}}(v,λ)$ for $v\equiv 0$ or $4\pmod{12}$ whose $2$-BIG is Hamiltonian.
Let $p\equiv 1 \pmod{4}$ be a prime. Write $t = \prod_{x=1}^{(p-1)/2}x$. Since $t ^2\equiv -1 \pmod{p}$ , we can divide $\{1,2,\ldots,(p-1)/2\}$ into $(p-1)/4$ ordered pairs so that each pair, say $<a,\tilde{a}>$ , satisfies that $t a \equiv \pm \tilde{a} \pmod{p}.$ For any two such pairs, assume $a<\tilde{a}, b<\tilde{b}, a<b $, then there are three possibilities for their relative order : $a<\tilde{a} < b< \tilde{b}$ , $a< b < \tilde{a} < \tilde{b}$ , $a< b < \tilde{b}< \tilde{a}$. We show this paring is balanced in the sense that the three cases occur with equal frequencies. Utilizing prope…
Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary periodical sequences with a 2-level autocorrelation values. For $n \equiv 1\pmod 4$, we prove some cases of Schmidt's Conjecture for perfect binary sequences. (Des. Codes Cryptogr. 78 (2016), 237-267.) For $n \equiv 2\pmod 4$, Jungnickel and Pott (Discrete Appl. Math. 95 (1999) 331-359.) left four perfect binary sequences as open problem and we solve three of its. For $n \equiv 3\pmod 4$, we present some nonexistence of …
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…
It is conjectured that every Steiner triple system of order $v \neq 7$ has chromatic index at most $(v+3)/2$ when $v \equiv 3 \pmod{6}$ and at most $(v+5)/2$ when $v \equiv 1 \pmod{6}$. Herein, we construct a Steiner triple system of order $v$ with chromatic index at least $(v+3)/2$ for each integer $v \equiv 3 \pmod{6}$ such that $v \geq 15$, with four possible exceptions. We further show that the maximum number of disjoint parallel classes in the systems constructed is sublinear in $v$. Finally, we establish for each order $v \equiv 15 \pmod{18}$ that there are at least $v^{v^2(1/6+o(1))}$ n…
Let $v=2ms+t$ be a positive integer, where $t$ divides $2ms$, and let $J$ be the subgroup of order $t$ of the cyclic group $\mathbb{Z}_v$. An integer Heffter array $H_t(m,n;s,k)$ over $\mathbb{Z}_v$ relative to $J$ is an $m\times n$ partially filled array with elements in $\mathbb{Z}_v$ such that: (a) each row contains $s$ filled cells and each column contains $k$ filled cells; (b) for every $x\in \mathbb{Z}_v \setminus J$, either $x$ or $-x$ appears in the array; (c) the elements in every row and column, viewed as integers in $\pm\left\{ 1, \ldots, \left\lfloor \frac{v}{2}\right\rfloor \right…
In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2\binom{2k}{k+d}}{64^k}\equiv 0\pmod{p^2}$$ for all $d\in\{0,\ldots,p-1\}$ with $d\equiv (p+1)/2\pmod2$. If $p\equiv 1\pmod4$ and $p=x^2+y^2$ with $x\equiv 1\pmod4$ and $y\equiv 0\pmod2$, then we show $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2\binom{2k}{k+1}}{(-8)^k}\equiv 2p-2x^2\pmod{p^2}\ \ \mbox{and}\ \ \sum_{k=0}^{p-1}\frac{\binom{2k}k\binom{2k}{k+1}^2}{(-8)^k}\equiv-2p\pmod{p^2}…
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…
A partial $(k-1)$-spread in $\operatorname{PG}(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in $\operatorname{PG}(n-1,q)$ was known for the cases $n\equiv 0\pmod k$, $n\equiv 1\pmod k$ and $n\equiv 2\pmod k$ with the additional requirements $q=2$ and $k=3$. We completely resolve the case $n\equiv 2\pmod k$ for the binary case $q=2$.
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}.$
Given a $2$-$(v,k,λ)$ design, $\cal{S}=(X,\cal{B})$, a {\it zero-sum $n$-flow} of $\cal{S}$ is a map $f: \cal{B} \longrightarrow \{\pm 1, \ldots ,\pm (n-1)\}$ such that for any point $x\in X$, the sum of $f$ around all the blocks incident with $x$ is zero. It has been conjectured that every Steiner triple system, STS$(v)$, on $v$ points $(v>7)$ admits a zero-sum $3$-flow. We show that for every pair $(v,λ)$, for which a triple system, TS$(v,λ)$ exists, there exists one which has a zero-sum $3$-flow, except when $(v,λ)\in\{(3,1), (4,2), (6,2), (7,1)\}$ and except possibly when $v \equiv 10\pmod…
For any odd prime p we obtain q-analogues of Van Hamme's supercongruence: $$ \sum_{k=0}^{\frac{p-1}{2}}{2k\choose k}^3\frac{1}{64^k} \equiv 0 \pmod{p^2} \quad\text{for}\quad p\equiv 3\pmod 4, $$ and Rodriguez-Villegas' Beukers-like supercongruences involving products of three binomial coefficients. For example, we prove that \begin{align*} \sum_{k=0}^{\frac{p-1}{2}} {2k\brack k}_{q^2}^3 \frac{q^{2k}}{(-q^2;q^2)_k^2 (-q;q)_{2k}^2} &\equiv 0\pmod{[p]^2} \quad\text{for}\quad p\equiv 3\pmod 4, \\ \sum_{k=0}^{\frac{p-1}{2}}{2k\brack k}_{q^3}\frac{(q;q^3)_k (q^{2};q^3)_{k} q^{3k} }{ (q^{6};q^{6})_k^…
It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of type $m^{\ell}$. The authors prove the conjecture in the affirmative when $\ell \equiv 1\; \pmod{4}$ and $m \geq \ell^2 -\ell + 1$.
In this paper we provide constructive lower bounds on the sizes of the largest partial ovoids of the symplectic polar spaces ${\cal W}(3, q)$, $q$ odd square, $q \not\equiv 0 \pmod{3}$, ${\cal W}(5, q)$ and of the Hermitian polar spaces ${\cal H}(4, q^2)$, $q$ even or $q$ odd square, $q \not\equiv 0 \pmod{3}$, ${\cal H}(6, q^2)$, ${\cal H}(8, q^2)$.
Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv 1\pmod 4$; (ii) $t=-3$, $q\equiv \pm1\pmod{12}$; (iii) $t=3$, $q\equiv -1\pmod 6$. We confirm this conjecture in the present paper.
In this paper, we mainly prove the following conjectures of Z.-H. Sun \cite{SH2}: Let $p>3$ be a prime. If $p\equiv1\pmod3$ and $p=x^2+3y^2$, then we have $$ \sum_{k=0}^{p-1}\frac{D_k}{4^k}\equiv\sum_{k=0}^{p-1}\frac{D_k}{16^k}\equiv4x^2-2p-\frac{p^2}{4x^2}\pmod{p^3}, $$ and if $p\equiv2\pmod3$, then $$ \sum_{k=0}^{p-1}\frac{D_k}{4^k}\equiv-2\sum_{k=0}^{p-1}\frac{D_k}{16^k}\equiv\frac{p^2}2\binom{\frac{p-1}2}{\frac{p-5}6}^{-2} \pmod{p^3}, $$ where $D_n=\sum_{k=0}^n\binom{n}k^2\binom{2k}k\binom{2n-2k}{n-k}$ stands for the $n$th Domb number.
The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*} \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(-\frac{1}{4}\right)^2 &\equiv \begin{cases} 2(-1)^{\frac{p-1}{4}}x,&\text{if $p=x^2+y^2$ with $x\equiv 1\pmod{4}$,} 0,&\text{if $p\equiv 3\pmod{4}$,} \end{cases} [5pt] \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(-\frac{1}{6}\right)^2 &\equiv 0, \quad\text{if $p>3$,} [5pt] \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(\frac{1}{4}\r…
Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if $v\equiv 1,3\pmod{6}$ as early as 1939, the problem of determining the spectrum of cyclic (v,k,1)-designs with k>3 is far from being settled, even for k=4. This paper shows that a cyclic (v,4,1)-design exists if and only if $v\equiv 1,4\pmod{12}$ and $v\not\in\{16,25,28\}$.
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.
In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \ \sum_{k=0}^{p-1}\binom{1/(p-1)}k^{p-1}\equiv \frac{2}{3}p^4B_{p-3}\ \pmod{p^5},$$ where $B_0,B_1,B_2,\ldots$ are Bernoulli numbers. We also show that for any $a\in\mathbb Z$ with $p\nmid a$ we have $$\sum_{k=1}^{p-1}\frac1k\left(1+\frac ak\right)^k\equiv -1\pmod{p}\ \ \ \mbox{and}\ \ \ \sum_{k=1}^{p-1}\frac1{k^2}\left(1+\frac ak\right)^k\equiv 1+\frac 1{2a}\pmo…
In this paper, we obtain a number of new infinite families of Hadamard matrices. Our constructions are based on four new constructions of difference families with four or eight blocks. By applying the Wallis-Whiteman array or the Kharaghani array to the difference families constructed, we obtain new Hadamard matrices of order $4(uv+1)$ for $u=2$ and $v\in Φ_1\cup Φ_2 \cup Φ_3 \cup Φ_4$; and for $u\in \{3,5\}$ and $v\in Φ_1\cup Φ_2 \cup Φ_3$. Here, $Φ_1=\{q^2:q\equiv 1\pmod{4}\mbox{ is a prime power}\}$, $Φ_2=\{n^4\in \mathbb{N}:n\equiv 1\pmod{2}\} \cup \{9n^4\in \mathbb{N}:n\equiv 1\pmod{2}\}$…
We study $ν_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $ν_2$ and $ν_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $ν_2(An+B) \equiv 0 \pmod{4}$ for (A,B) = (36,30), (72,42), (252,114), (196,70), and likely many other progressions for which our method should easily generalize. Of some independent interest, we prove that the overpartition function $\bar{p}(n) \equiv 0 \pmod{16}$ in the first three progressions (the fourth is known), and thereby show that $ν_3(An+B) \equiv 0 \pmod{2}$ in each of these progr…
Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order
School of Mathematical Sciences and LPMC, Nankai University（南开大学数学科学学院和LPMC）；Department of Mathematical and Physical Sciences, Henan Institute of Engineering（河南工程学院数理学院）
The numbers $R_n$ and $W_n$ are defined as \begin{align*} R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\ \text{and}\ W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We prove that, for any positive integer $n$ and odd prime $p$, there hold \begin{align*} \sum_{k=0}^{n-1}(2k+1)R_k^2 &\equiv 0 \pmod{n}, \\ \sum_{k=0}^{p-1}(2k+1)R_k^2 &\equiv 4p(-1)^{\frac{p-1}{2}} -p^2 \pmod{p^3}, \\ 9\sum_{k=0}^{n-1}(2k+1)W_k^2 &\equiv 0 \pmod{n}, \\ \sum_{k=0}^{p-1}(2k+1)W_k^2 &\equiv 12p(-1)^{\frac{p-1}{2}}-17p^2 \pmod{p^3}, \quad\text{if $p>3$.} \end{align*} The firs…
Let $p$ be an odd prime. It is well known that $F_{p-(\frac p5)}\equiv 0\pmod{p}$, where $\{F_n\}_{n\ge0}$ is the Fibonacci sequence and $(-)$ is the Jacobi symbol. In this paper we show that if $p\not=5$ then we may determine $F_{p-(\frac p5)}$ mod $p^3$ in the following way: $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k}{(-16)^k}\equiv\left(\frac{p}5\right)\left(1+\frac{F_{p-(\frac {p}5)}}2\right)\pmod{p^3}.$$ We also use Lucas quotients to determine $\sum_{k=0}^{(p-1)/2}\binom{2k}k/m^k$ modulo $p^2$ for any integer $m\not\equiv0\pmod{p}$; in particular, we obtain $$\sum_{k=0}^{(p-1)/2}\frac{\bino…
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 $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv x\equiv 1\pmod 4$ then $$\sum_{k=0}^{(p-1)/2}(3[3\mid k]-1)(2k+1)\frac{\binom{2k}k^2}{(-16)^k}\equiv\left(\frac2p\right)2x\pmod{p^2}$$ where $[3\mid k]$ takes $1$ or $0$ according as $3\mid k$ or not, and that if $-p\equiv y\equiv 1\pmod4$ then $$\sum_{k=0}^{(p-1)/2}\left(\frac k3\right)\frac{k\binom{2k}k^2}{(-16)^k} \equiv(-1)^{(p+1)/4}y\equiv\sum_{k=0}^{(p-…
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.
Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equivł(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol, which confirms a conjecture of Z.-W. Sun. We also establish the following new congruences: \begin{align*}\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{3k}k}{27^k}\equiv&ł(\frac p3\r)\frac{2^p+1}3\pmod{p^2}, \\\sum_{k=0}^{(p-1)/2}\frac{\binom{6k}{3k}\binom{3k}k}{(2k+1)432^k}\equiv&ł(\frac p3\r)\frac{3^p+1}4\pmod{p^2}, \\\sum_{k=0}^{(p-1)/2}\frac{\binom{4k}{2k}\bin…
Let ${\overline{p}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as \[{\overline{p}_{3}}(16n+14)\equiv 0 \pmod{32}, \quad {\overline{p}_{3}}(8n+7)\equiv 0 \pmod{64}.\] We also find many arithmetic properties for ${\overline{p}_{3}}(n)$ modulo 7, 9 and 11, involving the following infinite families of Ramanujan-type congruences: for any integers $α\ge 1$ and $n \ge 0$, we have ${\overline{p}_{3}}\big({{3}^{2α+1}}(3n+2)\big)\equiv 0$ (mod $9\cdot 2^4$), $\overline…
Let $M_n$ and $T_n$ denote the $n$th Motzkin number and the $n$th central trinomial coefficient respectively. We prove that for any prime $p\ge 5$, \begin{align*} &\sum_{k=0}^{p-1}M_k^2\equiv \left(\frac{p}{3}\right)\left(2-6p\right)\pmod{p^2},\\ &\sum_{k=0}^{p-1}kM_k^2\equiv \left(\frac{p}{3}\right)\left(9p-1\right)\pmod{p^2},\\ &\sum_{k=0}^{p-1}T_kM_k\equiv \frac{4}{3}\left(\frac{p}{3}\right)+\frac{p}{6}\left(1-9\left(\frac{p}{3}\right)\right)\pmod{p^2}, \end{align*} where $\left(-\right)$ is the Legendre symbol. These results confirm three 12-year-old supercongruence conjectures of Z.-W. Su…
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
Let $p$ be an odd prime. In 2008 E. Mortenson proved van Hamme's following conjecture: $$\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3\equiv (-1)^{(p-1)/2}p\pmod{p^3}.$$ In this paper we show further that \begin{align*}\sum_{k=0}^{p-1}(4k+1)\binom{-1/2}k^3\equiv &\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3 \\\equiv & (-1)^{(p-1)/2}p+p^3E_{p-3} \pmod{p^4},\end{align*}where $E_0,E_1,E_2,\ldots$ are Euler numbers. We also prove that if $p>3$ then $$\sum_{k=0}^{(p-1)/2}\frac{20k+3}{(-2^{10})^k}\binom{4k}{k,k,k,k}\equiv(-1)^{(p-1)/2}p(2^{p-1}+2-(2^{p-1}-1)^2)\pmod{p^4}.$$
Let $q$ be a prime power such that $q\equiv 1\pmod{4}$. The Paley graph of order $q$ is the graph with vertex set as the finite field $\mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in $\mathbb{F}_q$. We attempt to construct a similar graph of order $n$, where $n\in\mathbb{N}$. For suitable $n$, we construct the graph where the vertex set is the finite commutative ring $\mathbb{Z}_n$ and edges defined as, $ab$ is an edge if and only if $a-b\equiv x^2\pmod{n}$ for some unit $x$ of $\mathbb{Z}_n$. We look at some properties of this graph. For primes…
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 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.
In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$ \sum_{k=0}^{\lfloor\frac34p^a\rfloor}\binom{-1/2}k\equiv\left(\frac{2}{p^a}\right)\pmod{p^2}, $$ where $(-)$ denotes the Jacobi symbol. This confirms a conjecture of the second author. We also confirm a conjecture of R. Tauraso by showing that $$\sum_{k=1}^{p-1}\frac{L_k}{k^2}\equiv0\pmod{p}\quad {\rm provided}\ \ p>5,$$ where the Lucas numbers $L_0,L_1,L_2,\ldots$ are …
The Delannoy polynomial $D_n(x)$ is defined by $$ D_n(x)=\sum_{k=0}^{n}{n\choose k}{n+k\choose k}x^k. $$ We prove that, if $x$ is an integer and $p$ is a prime not dividing $x(x+1)$, then \begin{align*} \sum_{k=0}^{p-1}(2k+1)D_k(x)^3 &\equiv p\left(\frac{-4x-3}{p}\right) \pmod{p^2}, \\ \sum_{k=0}^{p-1}(2k+1)D_k(x)^4 &\equiv p \pmod{p^2}, \\ \sum_{k=0}^{p-1}(-1)^k(2k+1)D_k(x)^3 &\equiv p\left(\frac{4x+1}{p}\right) \pmod{p^2}, \end{align*} where $\big(\frac{\cdot}{p}\big)$ denotes the Legendre symbol. The first two congruences confirm a conjecture of Z.-W. Sun [Sci. China 57 (2014), 1375--1400].…
