Primes for Android
Sexy prime list. Goldbach and weak goldbach solver. Equation based prime checker (e.g. n^2+n+41 for n<100 and n>10). Primes into a+xb^2 where b is odd (legendre's 4n+1=a^2+b^2 8n+3=a^2+2b^2 6n+1=a^2+3b^2) and numbers into <4 squares. Primes near x finder. Prime test and categories diffence illustrator. σ(n), φ(n), μ(n) and π(n) calculator. Perfect power checker and number factorizer. Modular calculator (LCM, HCF, mx-ny=1, direct/inverse ax=1 mod y, a^x and x^a mod r). Prime list in n columns.
Sexy prime list. Goldbach and weak goldbach solver. Equation based prime checker (e.g. n^2+n+41 for n<100 and n>10). Primes into a+xb^2 where b is odd (legendre's 4n+1=a^2+b^2 8n+3=a^2+2b^2 6n+1=a^2+3b^2) and numbers into <4 squares. Primes near x finder. Prime test and categories diffence illustrator. σ(n), φ(n), μ(n) and π(n) calculator. Perfect power checker and number factorizer. Modular calculator (LCM, HCF, mx-ny=1, direct/inverse ax=1 mod y, a^x and x^a mod r). Prime list in n columns.
Sexy prime list. Goldbach and weak goldbach solver. Equation based prime checker (e.g. n^2+n+41 for n<100 and n>10). Primes into a+xb^2 where b is odd (legendre's 4n+1=a^2+b^2 8n+3=a^2+2b^2 6n+1=a^2+3b^2) and numbers into <4 squares. Primes near x finder. Prime test and categories diffence illustrator. σ(n), φ(n), μ(n) and π(n) calculator. Perfect power checker and number factorizer. Modular calculator (LCM, HCF, mx-ny=1, direct/inverse ax=1 mod y, a^x and x^a mod r). Prime list in n columns.
by P####:
Sexy prime list. Goldbach and weak goldbach solver. Equation based prime checker (e.g. n^2+n+41 for n<100 and n>10). Primes into a+xb^2 where b is odd (legendre's 4n+1=a^2+b^2 8n+3=a^2+2b^2 6n+1=a^2+3b^2) and numbers into <4 squares. Primes near x finder. Prime test and categories diffence illustrator. σ(n), φ(n), μ(n) and π(n) calculator. Perfect power checker and number factorizer. Modular calculator (LCM, HCF, mx-ny=1, direct/inverse ax=1 mod y, a^x and x^a mod r). Prime list in n columns.