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.

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. ...

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...

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\>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, ...

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...

A prime $p$ is said to be a Wolstenholme prime if it satisfies the congruence $\left(\genfrac{}{}{0pt}{}{2p-1}{p-1}\right)\equiv 1(mod{p}^4)$. For such a prime $p$, we establish an expression for $\left(\genfrac{}{}{0pt}{}{2p-1}{p-1}\right)(mod{p}^8)$ given in terms of the sums $R_i:={\sum }_{k=1}^{p-1}1/k^i$ ($i=1,2,3,4,5,6)$. Further, the expression in this congruence is reduced in terms of the sums $R_i$ ($i=1,3,4,5$). Using this congruence, we prove that for any Wolstenholme prime $p$ we have $$\left(\genfrac{}{}{0pt}{}{2p-1}{p-1}\right)\equiv 1-2p\sum _{k=1}^{p-1}\frac{1}{k}-2p^2\sum _{k=1}^{p-1}\frac{1}{k^2}(mod{p}^7).$$ Moreover, using a recent result of the author, we prove that a prime $p$ satisfying the above congruence must necessarily be a Wolstenholme prime. Furthermore, applying...

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...

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)$.

Let E be an interval in the unit interval [0,1). For each x ∈ [0,1) define dₙ(x) ∈ 0,1 by $dₙ\left(x\right):={\sum }_{i=1}^n{1}_E\left(2^{i-1}x\right)\left(mod2\right)$, where t is the fractional part of t. Then x is called a normal number mod 2 with respect to E if $N^{-1}{\sum }_{n=1}^{N}dₙ\left(x\right)$ converges to 1/2. It is shown that for any interval E ≠(1/6, 5/6) a.e. x is a normal number mod 2 with respect to E. For E = (1/6, 5/6) it is proved that $N^{-1}{\sum }_{n=1}^{N}dₙ\left(x\right)$ converges a.e. and the limit equals 1/3 or 2/3 depending on x.

What should be assumed about the integral polynomials $f₁\left(x\right),...,f_k\left(x\right)$ in order that the solvability of the congruence $f₁\left(x\right)f₂\left(x\right)\cdots f_k\left(x\right)\equiv 0\left(modp\right)$ for sufficiently large primes p implies the solvability of the equation $f₁\left(x\right)f₂\left(x\right)\cdots f_k\left(x\right)=0$ in integers x? We provide some explicit characterizations for the cases when $f_j\left(x\right)$ are binomials or have cyclic splitting fields.

We consider Weil sums of binomials of the form $W_{F,d}\left(a\right)={\sum }_{x\in F}\psi (x^d-ax)$, where F is a finite field, ψ: F → ℂ is the canonical additive character, $gcd(d,|F^{\times }\left|\right)=1$, and $a\in F^{\times }$. If we fix F and d, and examine the values of $W_{F,d}\left(a\right)$ as a runs through $F^{\times }$, we always obtain at least three distinct values unless d is degenerate (a power of the characteristic of F modulo $|F^{\times }|$). Choices of F and d for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if F is a field of order 3ⁿ with n...

Given an integer $n\ge 3$, let $u_1,...,u_n$ be pairwise coprime integers $\ge 2$, $𝒟$ a family of nonempty proper subsets of $\{1,...,n\}$ with “enough” elements, and $\epsilon$ a function $𝒟\to \{\pm 1\}$. Does there exist at least one prime $q$ such that $q$ divides ${\prod }_{i\in I}{u}_i-\epsilon \left(I\right)$ for some $I\in 𝒟$, but it does not divide $u_1\cdots u_n$? We answer this question in the positive when the $u_i$ are prime powers and $\epsilon$ and $𝒟$ are subjected to certain restrictions. We use the result to prove that, if ${\epsilon }_0\in \{\pm 1\}$ and $A$ is a set of three or more primes that contains all prime divisors of any...