We can write n in its prime factor form , similarly we can right \(\tau(n)\) as (1+k1)... (1+kr) where k1 ...kr are powers of the prime factors,and then i just tried by establishing simple congruences and relate prime factor and its power but somehow i could not manage that

## Comments

Sort by:

TopNewest@Chinmay Sangawadekar- you see divisors come in pairs

if \(d\) divides \(n \) then \(\dfrac{n}{d}\) also divides n

thus you can generate pairs like \((1,n),(2,\dfrac{n}{2}),(3,\dfrac{n}{3})..............(\sqrt{n},\dfrac{n}{\sqrt{n}})\)

thus n can have atmost \(\sqrt n\) pairs or

\(2\sqrt n\) divisors

Log in to reply

I had an idea about the proof somehow using modular arithmetic, lets see if we can come up with fruitful outcomes.

Log in to reply

How to use modular arithmetic here?

Log in to reply

We can write n in its prime factor form , similarly we can right \(\tau(n)\) as (1+k1)... (1+kr) where k1 ...kr are powers of the prime factors,and then i just tried by establishing simple congruences and relate prime factor and its power but somehow i could not manage that

Log in to reply

@Akshat Sharda @Harsh Shrivastava

Log in to reply