(p,r)=getPrimeWithRootOfUnity(n,r1)
We compute the prime p as a larger prime factor of $r1^n-1$. If the largest p in the desired range does not work, we pass to $r1+1$ and repeat.
|
|
|
|
|
|
|
The object getPrimeWithRootOfUnity is a method function with options.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/Macaulay2Doc/functions/nextPrime-doc.m2:62:0.