An efficient algorithm to estimate the density of primes with at least one bad primitive root
Implementing Organization
Central University of Tamil Nadu
Principal Investigator
Dr. Ramesh Venkadachalam
Central University of Tamil Nadu
About
This project aims to study the size of the set of all primes with a bad primitive root and develop faster algorithms for searching for such roots. The objectives include assuming Artin's conjecture, heuristically finding the asymptotic growth rate of P_a, studying the infinitude and density of primes with at least one bad primitive root, constructing faster algorithms to list such primes, studying the relationship between Wieferich primes and primes with bad primitive roots, and studying the properties of bad primitive roots to develop a cryptographic system based on primitive roots.
Source
Source
Anusandhan National Research Foundation/Science and Engineering Research Board (SERB), DST 2023-24
Science and Engineering Research Board (SERB), New Delhi
Anusandhan National Research Foundation (ANRF)
Quick Information
Area of Research
Mathematical Sciences
Focus Area
Prime Number Theory and Computational Algorithms
Start Year
2024
End Year
2027
Sanction Amount
₹ 6.60 L
Status
Ongoing
Contact
rameshmat@cutn.ac.in
Output
No. of Research Paper
00
Technologies (If Any)
00
No. of PhD Produced
00
No. of Patents
Filed :00
Grant :00
Disclaimer:
Information available on this portal is sourced from various organizations and is provided for informational purposes only. Users are advised to verify details from the respective official sources.
Please enter your details
Please provide your name and email to continue. Your details are saved in this browser for future use.
Latest Updates
Loading…
⚠️
You are leaving this website
You are about to be redirected to an external website that is not operated by
India Science, Technology & Innovation (ISTI) Portal.
Central University of Tamil Nadu
Acces sibility Controls