¡@

Home 

c# Programming Glossary: primes.elementat

Efficiently finding all divisors of a number

http://stackoverflow.com/questions/5793009/efficiently-finding-all-divisors-of-a-number

new List int toreturn.Add 1 int i 0 int j 1 int z 0 while primes.ElementAt i Math.Sqrt x if x primes.ElementAt i 0 toreturn.Add primes.ElementAt.. int j 1 int z 0 while primes.ElementAt i Math.Sqrt x if x primes.ElementAt i 0 toreturn.Add primes.ElementAt i toreturn.Add x primes.ElementAt.. i Math.Sqrt x if x primes.ElementAt i 0 toreturn.Add primes.ElementAt i toreturn.Add x primes.ElementAt i j 2 z int Math.Pow primes.ElementAt..