Primality Testing for Beginners

By:

Material type: Text

TextPublication details: Hyderabad; American Mathematical Society; 2017Edition: 1st edDescription: xii, 244pISBN:

9781470438425

Subject(s):

Number Theory

DDC classification:

512.7 GIL

Summary: How can you tell whether a number is prime? What if the number has hundreds or thousands of digits? This question may seem abstract or irrelevant, but in fact, primality tests are performed every time we make a secure online transaction. In 2002, Agrawal, Kayal, and Saxena answered a long-standing open question in this context by presenting a deterministic test (the AKS algorithm) with polynomial running time that checks whether a number is prime or not. What is more, their methods are essentially elementary, providing us with a unique opportunity to give a complete explanation of a current mathematical breakthrough to a wide audience.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Call number	Status	Date due	Barcode
Text Book	Chanakya University Knowledge Centre	Chanakya University Knowledge Centre	512.7 GIL (Browse shelf(Opens below))	Available		CU10510

Browsing Chanakya University Knowledge Centre shelves Close shelf browser (Hides shelf browser)

Previous			No cover image available					Next
Previous	512.7 AND Number Theory	512.7 BAM Number Theory	512.7 BUR Making Transcendence Transparent:An Intuitive Approach to Classical Transcendental Number Theory	512.7 GIL Primality Testing for Beginners	512.7 HAF Basic Concept in Modern Mathematics	512.7 KAT Number Theory 2 Introduction to Class Field Theory	512.7 KUR Number Theory 3 Iwasawa Theory and Modular Forms	Next

How can you tell whether a number is prime? What if the number has hundreds or thousands of digits? This question may seem abstract or irrelevant, but in fact, primality tests are performed every time we make a secure online transaction. In 2002, Agrawal, Kayal, and Saxena answered a long-standing open question in this context by presenting a deterministic test (the AKS algorithm) with polynomial running time that checks whether a number is prime or not. What is more, their methods are essentially elementary, providing us with a unique opportunity to give a complete explanation of a current mathematical breakthrough to a wide audience.

English

There are no comments on this title.

to post a comment.

Back to results

81 Encyclopedia of Indian Philosophies
82 Encyclopedia of Indian Philosophies
83 Encyclopedia of Indian Philosophies
84 Treasures of the Albert Hall Museum Jaipur
85 Gandhi and Bhagat Singh
by V. N. Datta
86 Megaliving From the Monk Who Sold His Ferreri
by Robin Sharma
87 Rivals
by Bill Emmoti
88 ಸೋಮನಾಥ
by K. M. Munshi
89 Nimma Buddivanthike, Nenapinashakti Hechchli
by C.R. Chandrashekhar
90 Environmental Psychology
by Swaha Bhattacharya
91 The High Performance Entrepreneur
by Subroto Bagchi
92 ದಿಗಂಬರ ಜೈನ ಬಾಲಬೋಧ Part. 1, 2, 3, 4
93 ಸಂಸ್ಕೃತ ಹಸ್ತಪ್ರತಿಗಳ ವರ್ಣನಾತ್ಮಕ ಸೂಚಿ Vol. 7
94 ಧವಲಾ-ಟೀಕಾ ಸಮನ್ವಿತಾ: ಷಟ್ಖಂಡಾಗಮ Vol. 12, Part. 7
by Veerasenacharya
95 ಧವಲಾ-ಟೀಕಾ ಸಮನ್ವಿತಾ: ಷಟ್ಖಂಡಾಗಮ Vol. 11, Part. 5, 6
by Veerasenacharya
96 ಜಯಧವಲಾ: ಆಚಾರ್ಯ ಶ್ರೀ ಗುಣಧರ ಭಟ್ಟಾರಕ ಪ್ರಣೀತಾ ಕಸಾಯ ಪಾಹುಡ Vol. 21, Part. 5
by Veerasenacharya
97 ಮಂಗಲಮಂತ್ರ ಣಮೋಕಾರ: ಒಂದು ಅನುಚಿಂತನ
by Jyotishachandra | Nemichandra Shastri
98 ಬೆಳಗೊಳದ ಶಾಸ್ತ್ರಿ ಪರಂಪರೆ
by Gudibande Poornima
99 India Since Independance
by Aditya Mukharjee | Bipan Chandra | Mridula Mukharjee
100 Fasting Feasting
by Anita Desai