On the tower factorization of integers

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower factorization of $n$. Here, given an integer $n>1$, we study its height $h(n)$, that is, the number of "floors" in its tower factorization. In particular, given a fixed integer $k\geq 1$, we provide a formula for the density of the set of integers $n$ with $h(n)=k$. This allows us to estimate the number of floors that a positive integer will have on average. We also show that there exist arbitrarily long sequences of consecutive integers with arbitrarily large heights.Comment: 8 pages. Accepted for publication in the Amer. Math. Monthl

On a property of non liouville numbers

Let α be a non Liouville number and let f(x) = αxr + ar−1xr−1 + ··· + a1x+a0 ϵ R[x] be a polynomial of positive degree r. We consider the sequence (yn)n≥1 defined by yn = f(h(n)), where h belongs to a certain family of arithmetic functions and show that (yn)n≥1 is uniformly distributed modulo 1

On integers for which the sum of divisors is the square of the squarefree core

We study integers n > 1 satisfying the relation σ(n) = γ(n) ² , where σ(n) and γ(n) are the sum of divisors and the product of distinct primes dividing n, respectively. We show that the only solution n with at most four distinct prime factors is n = 1782. We show that there is no solution which is fourth power free. We also show that the number of solutions up to x > 1 is at most x ⅟⁴⁺ᵉ for any ε > 0 and all x > xε. Further, call n primitive if no proper unitary divisor d of n satisfies σ(d) | γ(d) ² . We show that the number of primitive solutions to the equation up to x is less than xᵉ for x > xₑ

Bounds for the counting function of the Jordan-Pólya numbers

summary:A positive integer $n$ is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number $x$

Those fascinating numbers

Who would have thought that listing the positive integers along with their most remarkable properties could end up being such an engaging and stimulating adventure? The author uses this approach to explore elementary and advanced topics in classical number theory. A large variety of numbers are contemplated: Fermat numbers, Mersenne primes, powerful numbers, sublime numbers, Wieferich primes, insolite numbers, Sastry numbers, voracious numbers, to name only a few. The author also presents short proofs of miscellaneous results and constantly challenges the reader with a variety of old and new