1.2.8 Factoring and Primality Testing

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: An integer n .

Problem: Is n a prime number, and if not what are the factors of n ?

Implementations

  • PARI - Package for Number Theory (C) (rating 9)

    Related Problems

  • Cryptography
  • Arbitrary Precision Arithmetic

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .