Type:

Description:

A professor and two graduate students at the Indian Institute of Technology in Kanpur "have discovered a polynomial time deterministic algorithm to test if an input number is prime or not." News of their work was released on August 6, 2002. Because it allows a computer to quickly assess a number's primality, this breakthrough has generated considerable interest in the mathematics and computer science communities. A preprint of the research paper that proves the algorithm is provided on this Web site, and the algorithm itself is presented in pseudo code. Links to two major news reports are also given, which describe in simple terms the significance of the achievement.

Subjects:

    Education Levels:

      Keywords:

      oai:nsdl.org:2200/20111120195704195T,NSDL_SetSpec_internetscout,NSDL

      Language:

      English

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution Non-Commercial Share Alike

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467