2 papers
math.NT2018
On path partitions of the divisor graph
Paul Melotti, Eric Saias
It is known that the longest simple path in the divisor graph that uses integers is of length . We study the partitions of into a minim…
math.NT2016
On Euler's example of a completely multiplicative function with sum 0
Jean-Pierre Kahane, Eric Saïas
Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1…