olymmath

USAJMO 2017 Problem 4

  • Day 2

Are there any triples (a,b,c)(a,b,c) of positive integers such that (a−2)(b−2)(c−2)+12(a-2)(b-2)(c-2)+12 is a prime number that properly divides the positive number a2+b2+c2+abc−2017a^2+b^2+c^2+abc-2017 ?

Dataset text AI-MO AoPS. Quoted with source.

Solutions

Human solution Solution 1 by nonuser

If we continue from here:       xyz+12∣x+y+z−41      \;\;\;xyz+12 \mid x+y+z-41\;\;\; or       xyz+12∣x+y+z+49\;\;\;xyz+12|x+y+z+49.

We can assume x≤y≤zx\leq y\leq z. We see that x,y,z∉{0,2,3,4,6,8,9}x,y,z\notin \{0,2,3,4,6,8,9\} since xyz+12xyz+12 is prime.

  • If x>1x>1 then x,y≥5x,y\geq 5 and so xyz+12≥25z+12xyz+12\geq 25z+12 so in

    • first case: 25z+1≤∣x+y+z−41∣≤3z+41  ⟹  z≤125z+1\leq |x+y+z-41|\leq 3z+41\implies z\le 1 and thus no solution.

    • second case: 25z+1≤x+y+z+49≤3z+49  ⟹  z≤225z+1\leq x+y+z+49\leq 3z+49\implies z\leq 2 so no solution again.

  • If x=1x=1 then       yz+12∣y+z−40      \;\;\;yz+12 \mid y+z-40\;\;\; or       yz+12∣y+z+50\;\;\;yz+12|y+z+50.

    • If y≠1y\neq 1 then y≥5y\geq 5. In first case we have 5z+12≤2z+40  ⟹  z≤95z+12\leq 2z+40\implies z\leq 9 so z=7z=7 (and y=5y=5 or y=7y=7) or z=5z=5 (and y=5y=5). None works. In second case we have 5z+12≤2z+50  ⟹  z≤125z+12\leq 2z+50\implies z\leq 12. So z∈{11,7,5}z\in\{11,7,5\} but none works.
    • If y=1y=1 then       z+12∣z−39      \;\;\;z+12 \mid z-39\;\;\; then z+12∣51  ⟹  z=5z+12\mid 51 \implies z=5 or       z+12∣z+51\;\;\;z+12|z+51, then z+12∣39z+12\mid 39 so z=1z=1.
  • If x=−1x=-1 then we proccede similary like in a previous case...

Mathematics Stack Exchange. Open licence.

Locator usajmo/2017/p4 · Tag X47A393YVZ · Edit this page on GitHub · Keys: j next, k previous