Question #76367

Prove that for all integers n with 1≤n≤10,n^2 −n+11 is prime.

Expert's answer

Answer on Question #76367 – Math – Discrete Mathematics

Question

Prove that for all integers nn with 1n101 \leq n \leq 10, n2n+11n^2 - n + 11 is prime.

Solution

Define f(n)=n2n+11f(n) = n^2 - n + 11.

f(1)=121+11=11f(1) = 1^2 - 1 + 11 = 11 is prime.

f(2)=222+11=13f(2) = 2^2 - 2 + 11 = 13 is prime.

f(3)=323+11=17f(3) = 3^2 - 3 + 11 = 17 is prime.

f(4)=424+11=23f(4) = 4^2 - 4 + 11 = 23 is prime.

f(5)=525+11=31f(5) = 5^2 - 5 + 11 = 31 is prime.

f(6)=626+11=41f(6) = 6^2 - 6 + 11 = 41 is prime.

f(7)=727+11=53f(7) = 7^2 - 7 + 11 = 53 is prime.

f(8)=828+11=67f(8) = 8^2 - 8 + 11 = 67 is prime.

f(9)=929+11=83f(9) = 9^2 - 9 + 11 = 83 is prime.

f(10)=10210+11=101f(10) = 10^2 - 10 + 11 = 101 is prime, QED.

Answer provided by https://www.AssignmentExpert.com

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS