Let ℤ be the set of integers, and let (m,n) be the greatest common divisor of integers m and n. Let p be a prime of the form 4k+1 and p = c²+d² with c,d ∈ ℤ, $d=2^{r}d₀$ and c ≡ d₀ ≡ 1 (mod 4). In the paper we determine ${(b+\surd (b²+4^{\alpha })/2)}^{(p-1)/4)}\left(modp\right)$ for p = x²+(b²+4α)y² (b,x,y ∈ ℤ, 2∤b), and ${(2a+\surd 4a²+1)}^{(p-1)/4}\left(modp\right)$ for p = x²+(4a²+1)y² (a,x,y∈ℤ) on the condition that (c,x+d) = 1 or (d₀,x+c) = 1. As applications we obtain the congruence for $U_{(p-1)/4}\left(modp\right)$ and the criterion for $p|U_{(p-1)/8}$ (if p ≡ 1 (mod 8)), where Uₙ is the Lucas sequence given by U₀ = 0, U₁ = 1 and...

Let $K=\mathbb{Q}\left(\alpha \right)$ be a number field generated by a complex root $\alpha$ of a monic irreducible polynomial $f\left(x\right)=x^{18}-m$, $m\ne \mp 1$, is a square free rational integer. We prove that if $m\equiv 2$ or $3(\mathrm{mod}4)$ and $m\neg \equiv \mp 1(\mathrm{mod}9)$, then the number field $K$ is monogenic. If $m\equiv 1(\mathrm{mod}4)$ or $m\equiv 1(\mathrm{mod}9)$, then the number field $K$ is not monogenic.

Let p be an odd prime and let a be a positive integer. In this paper we investigate the sum $\genfrac{}{}{0pt}{}{{\sum }_{k=0}^{p^a-1}(h{p}^a-1}{\genfrac{}{}{0pt}{}{k\left)\right(2k}{k)/m^k\left(modp²\right)}}$, where h and m are p-adic integers with m ≢ 0 (mod p). For example, we show that if h ≢ 0 (mod p) and $p^a>3$, then $\genfrac{}{}{0pt}{}{{\sum }_{k=0}^{p^a-1}(h{p}^a-1}{\genfrac{}{}{0pt}{}{k\left)\right(2k}{{k)(-h/2)}^k\equiv ((1-2h)/\left(p^a\right))(1+h({(4-2/h)}^{p-1}-1))\left(modp²\right)}}$, where (·/·) denotes the Jacobi symbol. Here is another remarkable congruence: If $p^a>3$ then $\genfrac{}{}{0pt}{}{{\sum }_{k=0}^{p^a-1}(p^a-1}{\genfrac{}{}{0pt}{}{k\left)\right(2k}{{k)(-1)}^k\equiv 3^{p-1}(p^a/3)\left(modp²\right)}}$.

For p ≡ 1 (mod 4), we prove the formula (conjectured by R. Chapman) for the determinant of the (p+1)/2 × (p+1)/2 matrix $C=\left(C_{ij}\right)$ with $C_{ij}=((j-i)/p)$.

Let P and Q be nonzero integers. The sequences of generalized Fibonacci and Lucas numbers are defined by U₀ = 0, U₁ = 1 and $U_{n+1}=PUₙ-Q{U}_{n-1}$ for n ≥ 1, and V₀ = 2, V₁ = P and $V_{n+1}=PVₙ-Q{V}_{n-1}$ for n ≥ 1, respectively. In this paper, we assume that P ≥ 1, Q is odd, (P,Q) = 1, Vₘ ≠ 1, and $V_r\ne 1$. We show that there is no integer x such that $Vₙ=V_{r}Vₘx²$ when m ≥ 1 and r is an even integer. Also we completely solve the equation $Vₙ=VₘV_{r}x²$ for m ≥ 1 and r ≥ 1 when Q ≡ 7 (mod 8) and x is an even integer. Then we show that when P ≡ 3 (mod 4) and...

For any odd prime p we obtain q-analogues of van Hamme’s and Rodriguez-Villegas’ supercongruences involving products of three binomial coefficients such as ${\sum }_{k=0}^{(p-1)/2}{\left[\genfrac{}{}{0pt}{}{2k}{k}\right]}_{q²}^3\left(q^{2k}\right)/\left((-q²;q²){²}_k(-q;q){²}_{2k}²\right)\equiv 0\left(mod\left[p\right]²\right)$ for p≡ 3 (mod 4), ${\sum }_{k=0}^{(p-1)/2}{\left[\genfrac{}{}{0pt}{}{2k}{k}\right]}_{q³}\left({(q;q³)}_k{(q²;q³)}_k{q}^{3k}\right)\left({(q⁶;q⁶)}_k²\right)\equiv 0\left(mod\left[p\right]²\right)$ for p≡ 2 (mod 3), where $\left[p\right]=1+q+\cdots +q^{p-1}$ and $(a;q)ₙ=(1-a)(1-aq)\cdots (1-a{q}^{n-1})$. We also prove q-analogues of the Sun brothers’ generalizations of the above supercongruences. Our proofs are elementary in nature and use the theory of basic hypergeometric series and combinatorial q-binomial identities including a new q-Clausen type summation formula. ...

A positive integer $n$ is called a square-free number if it is not divisible by a perfect square except $1$. Let $p$ be an odd prime. For $n$ with $(n,p)=1$, the smallest positive integer $f$ such that $n^f\equiv 1(modp)$ is called the exponent of $n$ modulo $p$. If the exponent of $n$ modulo $p$ is $p-1$, then $n$ is called a primitive root mod $p$. Let $A\left(n\right)$ be the characteristic function of the square-free primitive roots modulo $p$. In this paper we study the distribution $$\sum _{n\le x}A\left(n\right)A(n+1),$$ and give an asymptotic formula by using properties of character...

About Lehmer’s number, many people have studied its various properties, and obtained a series of interesting results. In this paper, we consider a generalized Lehmer problem: Let $p$ be a prime, and let $N(k;p)$ denote the number of all $1\le a_i\le p-1$ such that $a_1{a}_2\cdots a_k\equiv 1modp$ and $2\mid a_i+{\overline{a}}_i+1,$ $i=1,2,\cdots ,k$. The main purpose of this paper is using the analytic method, the estimate for character sums and trigonometric sums to study the asymptotic properties of the counting function $N(k;p),$ and give an interesting asymptotic formula...

Let a,b and c be relatively prime positive integers such that a²+b² = c². We prove that if $b\equiv 0\left(mod{2}^r\right)$ and $b\equiv \pm 2^r\left(moda\right)$ for some non-negative integer r, then the Diophantine equation $a^x+b^y=c^z$ has only the positive solution (x,y,z) = (2,2,2). We also show that the same holds if c ≡ -1 (mod a).

For k = 1,2,... 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 ${\sum }_{k=1}^{p-1}\left(H_k\right)/\left(k{2}^k\right)\equiv 7/24p{B}_{p-3}\left(modp²\right)$, ${\sum }_{k=1}^{p-1}\left(H_{k,2}\right)/\left(k{2}^k\right)\equiv -3/8B_{p-3}\left(modp\right)$, and ${\sum }_{k=1}^{p-1}\left(H{²}_{k,2n}\right)/\left(k^{2n}\right)\equiv (\left(\genfrac{}{}{0pt}{}{6n+1}{2n-1}\right)+n)/(6n+1)p{B}_{p-1-6n}\left(modp²\right)$ for any positive integer n < (p-1)/6, where B₀,B₁,B₂,... are Bernoulli numbers, and $H_{k,m}:={\sum }_{j=1}^{k}1/\left(j^m\right)$.

The 3x+k function $T_k\left(n\right)$ sends n to (3n+k)/2, resp. n/2, according as n is odd, resp. even, where k ≡ ±1 (mod 6). The map $T_k\left(·\right)$ sends integers to integers; for m ≥1 let n → m mean that m is in the forward orbit of n under iteration of $T_k\left(·\right)$. We consider the generating functions $f_{k,m}\left(z\right)={\sum }_{n>0,n\to m}{z}^n$, which are holomorphic in the unit disk. We give sufficient conditions on (k,m) for the functions $f_{k,m}\left(z\right)$ to have the unit circle |z|=1 as a natural boundary to analytic continuation. For the 3x+1 function these conditions hold...

We show that the discriminant of the generalized Laguerre polynomial $L_n^{\left(\alpha \right)}\left(x\right)$ is a non-zero square for some integer pair $(n,\alpha )$, with $n\ge 1$, if and only if $(n,\alpha )$ belongs to one of $30$ explicitly given infinite sets of pairs or to an additional finite set of pairs. As a consequence, we obtain new information on when the Galois group of $L_n^{\left(\alpha \right)}\left(x\right)$ over $\mathbb{Q}$ is the alternating group $A_n$. For example, we establish that for all but finitely many positive integers $n\equiv 2(mod4)$, the only $\alpha$ for which the Galois group of $L_n^{\left(\alpha \right)}\left(x\right)$ over $\mathbb{Q}$ is $A_n$ is...

Let $E$ and $f$ be an Eisenstein series and a cusp form, respectively, of the same weight $k\ge 2$ and of the same level $N$, both eigenfunctions of the Hecke operators, and both normalized so that $a_1\left(f\right)=a_1\left(E\right)=1$. The main result we prove is that when $E$ and $f$ are congruent mod a prime $𝔭$ (which we take in this paper to be a prime of $\overline{\mathbb{Q}}$ lying over a rational prime $p\&gt;2$), the algebraic parts of the special values $L(E,\chi ,j)$ and $L(f,\chi ,j)$ satisfy congruences mod the same prime. More explicitly, we prove that, under certain conditions, ...

The structure of the group ${(\mathbb{Z}/n\mathbb{Z})}^{☆}$ and Fermat’s little theorem are the basis for some of the best-known primality testing algorithms. Many related concepts arise: Euler’s totient function and Carmichael’s lambda function, Fermat pseudoprimes, Carmichael and cyclic numbers, Lehmer’s totient problem, Giuga’s conjecture, etc. In this paper, we present and study analogues to some of the previous concepts arising when we consider the underlying group ${𝒢}_n:=\{a+b\mathrm{i}\in \mathbb{Z}\left[\mathrm{i}\right]/n\mathbb{Z}\left[\mathrm{i}\right]:a^2+b^2\equiv 1(modn)\}$. In particular, we characterize Gaussian Carmichael...