Application of Prime Numbers in Computer Science and the Algorithms Used To Test the Primality of a Number
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 157 | Views: 440 | Weekly Hits: ⮙2 | Monthly Hits: ⮙2

Review Papers | Computer Science & Engineering | India | Volume 4 Issue 9, September 2015 | Popularity: 6.4 / 10


     

Application of Prime Numbers in Computer Science and the Algorithms Used To Test the Primality of a Number

Tejash Desai


Abstract: This paper throws light on some of the important properties exhibited by a prime number. It also attempts to list down the fields in which prime numbers are especially important and the reasons behind their importance. Additionally, it gives a detailed explanation of some of the algorithms used to check if a given number is prime and/or to list the prime numbers between two given numbers.


Keywords: prime numbers, algorithms, mathematics, number theory


Edition: Volume 4 Issue 9, September 2015


Pages: 132 - 135



Please Disable the Pop-Up Blocker of Web Browser

Verification Code will appear in 2 Seconds ... Wait



Text copied to Clipboard!
Tejash Desai, "Application of Prime Numbers in Computer Science and the Algorithms Used To Test the Primality of a Number", International Journal of Science and Research (IJSR), Volume 4 Issue 9, September 2015, pp. 132-135, https://www.ijsr.net/getabstract.php?paperid=SUB157937, DOI: https://www.doi.org/10.21275/SUB157937

Top