so that 1n = n, and 1n! = n!, where qn! = qnqn−1…q1.
Some congruence properties and relationships with Bernoulli and Fibonacci numbers are explored. Some aspects of the notation and meaning of the Fermatian numbers are also outlined.
Some representations concerning the product of divisors of n
Original research paper. Pages 54—56
Full paper (896 Kb) | Abstract
and of course, we have
But (1) is not a good formula for Pd(n), because it depends on function τ and to express τ(n) we need the prime number factorization of n.
Below, we give other representations of Pd(n) and pd(n), which do not use the prime number factorization of n.