Hello all. I know there is a stupidly easy algorithm to find the prime decompision of a number (i.e. 2*2*2*3*5 is the p.d. of 120) but I can't for the life of me remember it. I need to do this operation on incredibly large numbers (~500 digits) so the naieve way of just starting at 2 and proceding through the primes *PROBABLY* doesn't work (if it does -- please tell me!) but I know there is a less naieve but still simplistic algorithm. Anyone out there know it?(adsbygoogle = window.adsbygoogle || []).push({});

-Chu

**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!

# An Algorithm to find a Prime Decompisition

Loading...

Similar Threads - Algorithm find Prime | Date |
---|---|

Algorithm to find square root of a quadratic residue mod p | Feb 14, 2015 |

Quantum algorithm for order finding | Nov 12, 2012 |

How to write the algorithm? I have figured out a method to find the inverse. | Sep 28, 2012 |

Algorithm for finding best (or combinations of) non-overlapping matrix elements. | May 4, 2012 |

Need general algorithm for finding dual bases | Jan 3, 2010 |

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