Description Usage Arguments Details Value Examples
Tests if a given number N is a prime power and returns either the base prime p and power q or p = 0 and q = 0.
1 | isPrimePower(N)
|
N |
the number to be tested for primality |
Finds the smallest integral solution for s = N**(1/i), which gives the smallest s such that s**i = N. Then, if s is a prime, the number N is a prime power with p = s and q = i.
Returns the base prime p and the power q if N is a prime power; otherwise returns p = 0 and q = 0.
1 2 3 4 | isPrimePower(N=13**5)
isPrimePower(N=25**5) ## 25 is prime-power
isPrimePower(N=20**5) ## 20 is not prime-power
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.