The Arm Prime Factors Decomposition
Texte intégral
Documents relatifs
Here we collect a few results that lie in the realm of complex dynamics on P 1 ðCÞ viewed as a Riemann surface. Note that by definition this does not a¤ect the fixed point
Alladi (Alladi, 1987) proved an Erd˝os–Kac theorem for integers without large prime factors... We follow closely the proofs of Propositions 2 and 3, making appropri-
— In a series of papers, we constructed large families of normal numbers using the concatenation of the values of the largest prime factor P (n), as n runs through particular
The number of words to be eliminated being equal to 3 i−1 is, as in previous section, very lesser that the total number of words and we are so ensured to find between to
On combining the prime number theorem with Theorem 1 we obtain the following result.. ak and b be
The proof of Theorem 2 depends on an inequality on linear forms in the logarithms of algebraic numbers... We have assumed that
much to get as good results as possible, but it should be noted that it is possible to improve upon our results by using not yet published results.. of Stark and
POMERANCE, Estimates for certain sums involving the largest prime factor of an integer. KRAUSE, Abschätzungen für die Funktion 03A8 K (x, y) in algebraischen