A question:(adsbygoogle = window.adsbygoogle || []).push({});

If I want to find all divisors of for example 29601 and in general all divisors of any (large) number, do I have to do it "on foot" i.e. with help of the division rules or checking each number looking if it divides the given number?...As far as I know there is no unified algorithm for computing the divisors of any number...or am I wrong? Does there exist such an algorithm?Computing divisors of small numbers is clearly a cheap task but I find it extremely tedious for large numbers.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Find all divisors of for example 29601

Loading...

Similar Threads - Find divisors example | Date |
---|---|

I How to find admissible functions for a domain? | Jan 31, 2018 |

I How to find the matrix of the derivative endomorphism? | Oct 22, 2017 |

I Finding the Kernel of a Matrix Map | Sep 15, 2017 |

Find a prime divisor of 1111 (13 1's) | Oct 30, 2011 |

Finding Primes: A Divisor summatory function | Jul 18, 2011 |

**Physics Forums - The Fusion of Science and Community**