Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[NUMBERS-133] Use iteration algorithm from bounded trial division in Primes.nextPrime(int) #68

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

[NUMBERS-133] Use iteration algorithm from bounded trial division in Primes.nextPrime(int) #68

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
cd3d54a
NUMBERS-133: Implement iterator for potential prime numbers
Jul 24, 2019
5301023
NUMBERS-133: Use the iterator where appropriate
Jul 24, 2019
ddfd3a0
NUMBERS-133: Simplify method Javadoc, rename private fields of the an…
Jul 25, 2019
a2e75b7
NUMBERS-133: Rename method potentialPrimes(int) to potentialPrimesGTE…
Jul 25, 2019
c42eb1a
NUMBERS-133: Use MathJax in Javadoc
Aug 10, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
NUMBERS-133: Use MathJax in Javadoc
  • Loading branch information
Schamschi committed Aug 10, 2019
commit c42eb1abf2e351edfead781f7b7436581cee548a
7 changes: 4 additions & 3 deletions commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -84,10 +84,11 @@ class SmallPrimes {
* value of this {@code Entry} modulo the least common multiple of the prime
* numbers in the set.</p>
*
* <p>Note that, if {@code product} is the product of the prime numbers,
* <p>Note that, if \(\mathit{product}\) is the product of the prime numbers,
* the last number in the array of coprime integers is necessarily
* {@code product - 1}, because if {@code product ≡ 0 mod p}, then
* {@code product - 1 ≡ -1 mod p}, and {@code 0 ≢ -1 mod p} for any prime number p.</p>
* \(\mathit{product} - 1\), because if \(\mathit{product} \equiv 0 \pmod{p}\),
* then \(\mathit{product} - 1 \equiv -1 \pmod{p}\), and
* \(0 \not\equiv -1 \pmod{p}\) for any prime number \(p\).</p>
*
* @see #potentialPrimesGTE(int)
*/
Expand Down