Hi Guys, this is a part of the Number Theory Course and in this video, I discuss about finding all divisor of a natural number in sqrt(n) time complexity. Currently, I have just made 1 video so I am publishing this and as soon as I make more I will upload and share here.

L01: Divisibility Test

E001: Treasure Hunt ( Codechef )

L03: Printing all Divisor of X in sort(n) in increasing order

Your suggestion/ support is needed to grow this channel ( #codeforcode ) and help us all together.

**Problem Discussion**

Thank You for your valuable time.

CODELABS3277 ( https://www.codelabs3277.org )