返回题库

AIME 2016 I · 第 12 题

AIME 2016 I — Problem 12

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Find the least positive integer mm such that m2m+11m^2 - m + 11 is a product of at least four not necessarily distinct primes.

解析

Solution 1

m(m1)m(m-1) is the product of two consecutive integers, so it is always even. Thus m(m1)+11m(m-1)+11 is odd and never divisible by 22. Thus any prime pp that divides m2m+11m^2-m+11 must divide 4m24m+44=(2m1)2+434m^2-4m+44=(2m-1)^2+43. We see that (2m1)243(modp)(2m-1)^2\equiv -43\pmod{p}. We can verify that 43-43 is not a perfect square mod pp for each of p=3,5,7p=3,5,7. Therefore, all prime factors of m2m+11m^2-m+11 are 11\ge 11.

Let m2m+11=pqrsm^2 - m + 11 = pqrs for primes 11pqrs11\le p \le q \le r \le s. From here, we could go a few different ways:

Solution 1a

Suppose p=11p=11; then m2m+11=11qrsm^2-m+11=11qrs. Reducing modulo 11, we get m1,0(mod11)m\equiv 1,0 \pmod{11} so k(11k±1)+1=qrsk(11k\pm 1)+1 = qrs.

Suppose q=11q=11. Then we must have 11k2±k+1=11rs11k^2\pm k + 1 = 11rs, which leads to k±1(mod11)k\equiv \pm 1 \pmod{11}, i.e., k{1,10,12,21,23,}k\in \{1,10,12,21,23,\ldots\}.

k=1k=1 leads to rs=1rs=1 (impossible)! Then k=10k=10 leads to rs=101rs=101, a prime (impossible). Finally, for k=12k=12 we get rs=143=1113rs=143=11\cdot 13.

Thus our answer is m=11k=132m=11k= \boxed{132}.

Solution 1b

Let m2m+11=pqrsm^2 - m + 11 = pqrs for primes p,q,r,s11p, q, r, s\ge11. If p,q,r,s=11p, q, r, s = 11, then m2m+11=114m^2-m+11=11^4. We can multiply this by 44 and complete the square to find (2m1)2=411443(2m-1)^2=4\cdot 11^4-43. But

(21121)2=41144112+1<411443<(2112)2,(2\cdot 11^2-1)^2=4\cdot 11^4-4\cdot 11^2+1 <4\cdot 11^4-43<(2\cdot 11^2)^2, hence we have pinned a perfect square (2m1)2=411443(2m-1)^2=4\cdot 11^4-43 strictly between two consecutive perfect squares, a contradiction. Hence pqrs11313pqrs \ge 11^3 \cdot 13. Thus m2m+1111313m^2-m+11\ge 11^3\cdot 13, or (m132)(m+131)0(m-132)(m+131)\ge0. From the inequality, we see that m132m \ge 132. 1322132+11=11313132^2 - 132 + 11 = 11^3 \cdot 13, so m=132m = \boxed{132} and we are done.

Solution 2

First, we can show that 2,3,5,72,3,5,7 ∤\not | m2m+11m^2 - m + 11. This can be done by just testing all residue classes.

For example, we can test m0mod2m \equiv 0 \mod 2 or m1mod2m \equiv 1 \mod 2 to show that m2m+11m^2 - 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 m2m+11=114m^2 - m + 11 = 11^4, which fails, so we test m2m+11=11313m^2 - m + 11 = 11^3 \cdot 13, and we get m = 132132.

-AlexLikeMath

Video Solution

https://youtu.be/KRleD8iDRhI

~MathProblemSolvingSkills.com