Show that if a ≥ 3, then an− 1 has at least 2v(n) divisors. (where v(n) is the number of divisors of n)
Follow Math Help Forum on Facebook and Google+
Originally Posted by mndi1105
Show that if then has at least divisors. (where is the number of divisors of n) Let define clearly is a subset of set of divisors of we need a trivial lemma: Lemma: if and then: Proof: suppose then we'll get:
so, since we've assumed that the above lemma tells us that for any we have and if then
Last edited by NonCommAlg; October 27th 2008 at 09:32 PM.
View Tag Cloud