Maths Olympiad Prep

Library / /1 of 34

Number theory Difficulty 4.7 AIME Find the answer

Find all positive integers n1n\geq 1 such that n2+3nn^2+3^n is the square of an integer.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

After rearranging we get: (kn)(k+n)=3n(k-n)(k+n) = 3^n
Let kn=3a,k+n=3nak-n = 3^a, k+n = 3^{n-a}
we get: 2n=3a(3n2a1)2n = 3^a(3^{n-2a} - 1) or, (2n/(3a))+1=3n2a(2n/(3^a)) + 1 = 3^{n-2a}
Now, it is clear from above that 3a3^a divides nn . so, n3an \geq 3^a
If n=3a,n2a=3a2a1n = 3^a, n - 2a = 3^a - 2a \geq 1 so RHS3RHS \geq 3 But LHS=3LHS = 3
If n>3an > 3^a then RHSRHS increases exponentially compared to LHSLHS so nn cannot be >3a> 3^a .
Thus n=3an = 3^a .
Substituting value of nn above we get:
3=33a2a3 = 3^{3^a - 2a}
or 3a2a=13^a - 2a = 1 this results in only a=0a = 0 or a=1a = 1
Thus n=1n = 1 or 33 .
~Kris17

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.