On the number of prime divisors of the iterates of the Carmichael function.

Kátai, Imre

Displaying similar documents to “On the number of prime divisors of the iterates of the Carmichael function.”

The distribution of primes satisfying the condition $a^{p - 1} \equiv 1 (m o d p^{2})$

Leo Murata (1991)

Acta Arithmetica

Similarity:

On the irrationality of a divisor function series.

Friedlander, John B., Luca, Florian, Stoiciu, Mihai (2007)

Integers

Similarity:

On a problem of Sierpiński

Yong-Gao Chen (2012)

Acta Arithmetica

Similarity:

Arithmetic progressions, prime numbers, and squarefree integers

Stuart Clary, Jacek Fabrykowski (2004)

Czechoslovak Mathematical Journal

Similarity:

In this paper we establish the distribution of prime numbers in a given arithmetic progression $p \equiv l (m o d k)$ for which $a p + b$ is squarefree.

A note on large gaps between consecutive prime numbers

Cameron L. Stewart (1984-1985)

Groupe d'étude en théorie analytique des nombres

Similarity:

On the unimodal character of the frequency function of the largest prime factor

Jean-Marie De Koninck, Jason Pierre Sweeney (2001)

Colloquium Mathematicae

Similarity:

The main objective of this paper is to analyze the unimodal character of the frequency function of the largest prime factor. To do that, let P(n) stand for the largest prime factor of n. Then define f(x,p): = #{n ≤ x | P(n) = p}. If f(x,p) is considered as a function of p, for 2 ≤ p ≤ x, the primes in the interval [2,x] belong to three intervals I₁(x) = [2,v(x)], I₂(x) = ]v(x),w(x)[ and I₃(x) = [w(x),x], with v(x) < w(x), such that f(x,p) increases for p ∈ I₁(x), reaches its maximum...