On the powerful part of
Jan-Christoph Puchta (2003)
Archivum Mathematicum
Similarity:
We show that is powerfull for integers at most, thus answering a question of P. Ribenboim.
Jan-Christoph Puchta (2003)
Archivum Mathematicum
Similarity:
We show that is powerfull for integers at most, thus answering a question of P. Ribenboim.
Horst Alzer (1994)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We prove: If and denote the arithmetic and geometric means of the first positive integers, then the sequence is strictly increasing and converges to , as tends to .
Florian Luca, Damon Moodley (2020)
Archivum Mathematicum
Similarity:
In this note, we show that the counting function of the number of composite positive integers such that is a prime is of order of magnitude at least and at most .
P. Erdös, J. O. Shallit (1991)
Journal de théorie des nombres de Bordeaux
Similarity:
Every real number , has an essentially unique expansion as a Pierce series : where the form a strictly increasing sequence of positive integers. The expansion terminates if and only if is rational. Similarly, every positive real number has a unique expansion as an Engel series : where the form a (not necessarily strictly) increasing sequence of positive integers. If the expansion is infinite, we require that the sequence yi...
Emmanuel Lepage (2013)
Annales de l’institut Fourier
Similarity:
The tempered fundamental group of a -adic analytic space classifies covers that are dominated by a topological cover (for the Berkovich topology) of a finite étale cover of the space. Here we construct cospecialization homomorphisms between versions of the tempered fundamental groups of the fibers of a smooth family of curves with semistable reduction. To do so, we will translate our problem in terms of cospecialization morphisms of fundamental groups of the log fibers of the log...
Michel Dekking, Peter Van der Wal (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
Any sequence of distinct numbers from [0,1] generates a binary tree by storing the numbers consecutively at the nodes according to a left-right algorithm (or equivalently by sorting the numbers according to the Quicksort algorithm). Let be the height of the tree generated by Obviously If the sequences are generated by independent random variables having the uniform distribution on [0, 1], then it is well known that there exists > such that...
Angel Kumchev (1997)
Journal de théorie des nombres de Bordeaux
Similarity:
In this paper we consider the asymptotic formula for the number of the solutions of the equation where is an odd integer and the unknowns are prime numbers of the form . We use the two-dimensional van der Corput’s method to prove it under less restrictive conditions than before. In the most interesting case our theorem implies that every sufficiently large odd integer may be written as the sum of three Piatetski-Shapiro primes of type for < < . ...