4,008,004 - 4,004,001 = 4003
Chat with our AI personalities
It is Fermat's theorem on the sum of two squares. An odd prime p can be expressed as a sum of two different squares if and only if p = 1 mod(4)
31 is a prime number. Please note that all perfect squares are composite, except 0 and 1.
No there isn't. every perfect square number can be factored into prime number. At their factoration you'll always have multiples of two on the primes exponent. Therefore you'll multiply a prime raised to a 2-multiple number with another prime raised to a 2-multiple number wich gives you also a number that factored gives you a product of prime numbers raised to a 2-multiple number and so, a perfect square.
A perfect number cannot be a prime.
Any prime number - by definition such numbers are divisible by 1 and the number itself. As a matter of fact, only perfect squares can have an odd number of factors.