Find the maximum possible value of H⋅M⋅M⋅T over all ordered triples (H,M,T) of integers such that H⋅M⋅M⋅T=H+M+M+T.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
If any of H,M,T are zero, the product is 0. We can do better (examples below), so we may now restrict attention to the case when H,M,T=0. When M∈{−2,−1,1,2}, a little casework gives all the possible (H,M,T)=(2,1,4),(4,1,2),(−1,−2,1),(1,−2,−1). If M=−2, i.e. H−4+T=4HT, then −15=(4H−1)(4T−1), so 4H−1∈{±1,±3,±5,±15} (only −1,+3,−5,+15 are possible) corresponding to 4T−1∈{∓15,∓5,∓3,∓1} (only +15,−5,+3,−1 are possible). But H,T are nonzero, we can only have 4H−1∈{+3,−5}, yielding (−1,−2,1) and (1,−2,−1). If M=+2, i.e. H+4+T=4HT, then 17=(4H−1)(4T−1), so 4H−1∈{±1,±17} (only −1,−17 are possible) corresponding to 4T−1∈{±17,±1} (only −17,−1 are possible). But H,T are nonzero, so there are no possibilities here. If M=−1, i.e. H−2+T=HT, then −1=(H−1)(T−1), so we have H−1∈{±1} and T−1∈{∓1}, neither of which is possible (as H,T=0). If M=+1, i.e. H+2+T=HT, then 3=(H−1)(T−1), so we have H−1∈{±1,±3}. Since H,T=0,H−1∈{+1,+3}, yielding (2,1,4) and (4,1,2). Now suppose there is such a triple (H,M,T) for ∣M∣≥3. The equation in the problem gives (M2H− 1) (M2T−1)=2M3+1. Note that since H,T=0,2M3+1=M2H−1⋅M2T−1≥min(M2−1,M2+1)2=M4−2M2+1>2∣M∣3+1 gives a contradiction.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.