Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus
During AMC testing, the AoPS Wiki is in read-only mode and no edits can be made.

2000 JBMO Problems/Problem 2

Revision as of 23:25, 3 December 2018 by KRIS17 (talk | contribs) (→‎Solution)

Problem 2

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


Solution

After rearranging we get: $(k-n)(k+n) = 3^n$

Let $k-n = 3^a, k+n = 3^{n-a}$

we get: $2n = 3^a(3^{n-2a} - 1)$ or, $(2n/(3^a)) + 1 = 3^{n-2a}$

Now, it is clear from above that $3^a$ divides $n$. so, $n \geq 3^a$


If $n = 3^a, n - 2a = 3^a - 2a \geq 1$ so $RHS \geq 3$ But $LHS = 3$

If $n > 3^a$ then $RHS$ increases exponentially compared to $LHS$ so $n$ cannot be $> 3^a$.

Thus $n = 3^a$.

Substituting value of $n$ above we get:

$3 = 3^{3^a - 2a}$

or $3^a - 2a = 1$ this results in only $a = 0$ or $a = 1$

Thus $n = 1$ or $3$.


$Kris17$

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2000_JBMO_Problems/Problem_2&oldid=99251"