Find the least positive integer a , such that a 2 + 1 1 is a prime number.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
But how do you prove that 47 is prime without using prime factorization?
1 2 + 1 1 = 1 2 = 2 2 × 3 , so not prime.
2 2 + 1 1 = 1 5 = 3 × 5 , so not prime.
3 2 + 1 1 = 2 0 = 2 2 × 5 , so not prime.
4 2 + 1 1 = 2 7 = 3 3 , so not prime.
5 2 + 1 1 = 3 6 = 6 2 , so not prime.
6 2 + 1 1 = 4 7 , so prime.
Proof: 6 < 4 7 < 7 , so 4 7 must be divisible by the prime numbers less than 6 .
Then, 2 , 3 , 5 can be.
So, 4 7 ≡ 1 ( m o d 2 ) .
4 7 ≡ 2 ( m o d 3 ) .
4 7 ≡ 2 ( m o d 5 ) .
Hence, 4 7 is prime.
And, this way is called prime theorem .
(6)^2 +11=47 which is a prime no.
But how do you prove that 47 is prime without using prime factorization?
The simple solution is 6²+11 = 47. As 47 is prime, the value of a is 6.
But how do you prove that 47 is prime without using prime factorization?
Problem Loading...
Note Loading...
Set Loading...
1 2 + 1 1 = 1 2 not prime
2 2 + 1 1 = 1 5 not prime
3 2 + 1 1 = 2 0 not prime
4 2 + 1 1 = 2 7 not prime
5 2 + 1 1 = 3 6 not prime
6 2 + 1 1 = 4 7 prime number
The answer is 6 .