Some unexpected connections between analysis and combinatorics

Abstract

We go through a series of results related to the k-signum equation. We are investigating the number Sk (n) of possible writings and the asymptotic behavior of these numbers, as k is fixed and. The results are presented in connections with the Erdös-Surányi sequences. Analytic methods and algebraic ones are employed in order to predict the asymptotic behavior in general and to study in detail various situations for small values of k. Some simplifications and further ramifications are discussed in the end about the recent proof of Andrica-Tomescu conjecture.