Solution 1
m(m−1) is the product of two consecutive integers, so it is always even. Thus m(m−1)+11 is odd and never divisible by 2. Thus any prime p that divides m2−m+11 must divide 4m2−4m+44=(2m−1)2+43. We see that (2m−1)2≡−43(modp). We can verify that −43 is not a perfect square mod p for each of p=3,5,7. Therefore, all prime factors of m2−m+11 are ≥11.
Let m2−m+11=pqrs for primes 11≤p≤q≤r≤s. From here, we could go a few different ways:
Solution 1a
Suppose p=11; then m2−m+11=11qrs. Reducing modulo 11, we get m≡1,0(mod11) so k(11k±1)+1=qrs.
Suppose q=11. Then we must have 11k2±k+1=11rs, which leads to k≡±1(mod11), i.e., k∈{1,10,12,21,23,…}.
k=1 leads to rs=1 (impossible)! Then k=10 leads to rs=101, a prime (impossible). Finally, for k=12 we get rs=143=11⋅13.
Thus our answer is m=11k=132.
Solution 1b
Let m2−m+11=pqrs for primes p,q,r,s≥11. If p,q,r,s=11, then m2−m+11=114. We can multiply this by 4 and complete the square to find (2m−1)2=4⋅114−43. But
(2⋅112−1)2=4⋅114−4⋅112+1<4⋅114−43<(2⋅112)2,
hence we have pinned a perfect square (2m−1)2=4⋅114−43 strictly between two consecutive perfect squares, a contradiction. Hence pqrs≥113⋅13. Thus m2−m+11≥113⋅13, or (m−132)(m+131)≥0. From the inequality, we see that m≥132. 1322−132+11=113⋅13, so m=132 and we are done.
Solution 2
First, we can show that 2,3,5,7 ∣ m2−m+11. This can be done by just testing all residue classes.
For example, we can test m≡0mod2 or m≡1mod2 to show that m2−m+11 is not divisible by 2.
Case 1: m = 2k
$m^2 - m + 11 \equiv 2(2 \cdot k^2 - k + 5) +1 \equiv 1 \mod 2$
Case 2: m = 2k+1
$m^2 - m + 11 \equiv 2(2 \cdot k^2 + k + 5) +1 \equiv 1 \mod 2$
Now, we can test m2−m+11=114, which fails, so we test m2−m+11=113⋅13, and we get m = 132.
-AlexLikeMath
Video Solution
https://youtu.be/KRleD8iDRhI
~MathProblemSolvingSkills.com