The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 1961 –
1970 of
1970
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...
We study values of the Euler function φ(n) taken on binary palindromes of even length. In particular, if denotes the set of binary palindromes with precisely 2ℓ binary digits, we derive an asymptotic formula for the average value of the Euler function on .
Currently displaying 1961 –
1970 of
1970