Algorithms 401: an improved algorithm to produce complex primes
References
Recommendations
On sophie germain primes
MATH'08: Proceedings of the 13th WSEAS international conference on Applied mathematicsThis article proves: the (Sophie Germain prime numbers are numbers of the type Nβ = 6a + 5 with a ∈ N, a ≥ 0 ; b) there are infinites germain prime numbers. This article interests potentially for all those that are researching new and every larger Sophie ...
Combinatorially fruitful properties of 3·2-1 and 3·2-2 modulo p
Write a=3@?2^-^1 and b=3@?2^-^2(modp) where p is an odd prime. Let c be a value that is congruent (modp) to either a or b. For any x from Z"p@?{0}, evaluate each of x and cx(modp) within the interval (0,p). Then consider the quantity @m"c^*(x)=min(cx-x,...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 303Total Downloads
- Downloads (Last 12 months)55
- Downloads (Last 6 weeks)8
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in