Appending digits to generate an infinite sequence of composite numbers.
For k = 1,2,... let denote the harmonic number . In this paper we establish some new congruences involving harmonic numbers. For example, we show that for any prime p > 3 we have , , and for any positive integer n < (p-1)/6, where B₀,B₁,B₂,... are Bernoulli numbers, and .
Let Γ ⊂ ℚ * be a finitely generated subgroup and let p be a prime such that the reduction group Γₚ is a well defined subgroup of the multiplicative group ₚ*. We prove an asymptotic formula for the average of the number of primes p ≤ x for which [ₚ*:Γₚ] = m. The average is taken over all finitely generated subgroups , with and , with a range of uniformity for every i = 1,...,r. We also prove an asymptotic formula for the mean square of the error terms in the asymptotic formula with a similar...
In this paper we defined the reduced residue system and proved its fundamental properties. Then we proved the basic properties of the order function. Finally, we defined the primitive root and proved its fundamental properties. Our work is based on [12], [8], and [11].
In this paper, we apply character sum estimates to study products of factorials modulo .
A power digraph modulo , denoted by , is a directed graph with as the set of vertices and as the edge set, where and are any positive integers. In this paper we find necessary and sufficient conditions on and such that the digraph has at least one isolated fixed point. We also establish necessary and sufficient conditions on and such that the digraph contains exactly two components. The primality of Fermat number is also discussed.