Least But First!

Find the least positive integer a a , such that a 2 + 11 a^2 + 11 is a prime number.


The answer is 6.

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.

4 solutions

1 2 + 11 = 12 1^2 + 11 = 12 not prime

2 2 + 11 = 15 2^2 + 11 = 15 not prime

3 2 + 11 = 20 3^2 + 11 = 20 not prime

4 2 + 11 = 27 4^2 + 11 = 27 not prime

5 2 + 11 = 36 5^2 + 11 = 36 not prime

6 2 + 11 = 47 \boxed{\large\color{#D61F06}6^2 + 11 = 47} prime number

The answer is 6 \large\boxed{\color{#20A900}\large6} .

But how do you prove that 47 is prime without using prime factorization?

. . - 2 months, 2 weeks ago
. .
Mar 28, 2021

1 2 + 11 = 12 = 2 2 × 3 1 ^ { 2 } + 11 = 12 = 2 ^ { 2 } \times 3 , so not prime.

2 2 + 11 = 15 = 3 × 5 2 ^ { 2 } + 11 = 15 = 3 \times 5 , so not prime.

3 2 + 11 = 20 = 2 2 × 5 3 ^ { 2 } + 11 = 20 = 2 ^ { 2 } \times 5 , so not prime.

4 2 + 11 = 27 = 3 3 4 ^ { 2 } + 11 = 27 = 3 ^ { 3 } , so not prime.

5 2 + 11 = 36 = 6 2 5 ^ { 2 } + 11 = 36 = 6 ^ { 2 } , so not prime.

6 2 + 11 = 47 6 ^ { 2 } + 11 = 47 , so prime.

Proof: 6 < 47 < 7 \displaystyle 6 < \sqrt { 47 } < 7 , so 47 47 must be divisible by the prime numbers less than 6 6 .

Then, 2 , 3 , 5 2, 3, 5 can be.

So, 47 1 ( m o d 2 ) 47 \equiv 1 ( \mod 2 ) .

47 2 ( m o d 3 ) 47 \equiv 2 ( \mod 3 ) .

47 2 ( m o d 5 ) 47 \equiv 2 ( \mod 5 ) .

Hence, 47 47 is prime.

And, this way is called prime theorem .

Nishita Kumari
Oct 25, 2015

(6)^2 +11=47 which is a prime no.

But how do you prove that 47 is prime without using prime factorization?

. . - 2 months, 2 weeks ago

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?

. . - 2 months, 2 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...