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.

Difference between revisions of "2010 IMO Problems/Problem 3"

m (→‎Solution)
m (→‎Solution)
Line 23: Line 23:
 
Lemma 2) <math>|g(m)-g(m+1)| = 1</math> (we have show that it can't be 0)
 
Lemma 2) <math>|g(m)-g(m+1)| = 1</math> (we have show that it can't be 0)
  
−
  Assume for contradiction, that <math>|g(m)-g(m+1)| > 1</math>. Then there must exist a prime number <math>p</math> such that <math>g(m)</math> and <math>g(m+1)</math> are in the same residue class modulo <math>p</math>.  
+
  Assume for contradiction, that <math>|g(m)-g(m+1)| > 1</math>.  
 +
 
 +
Then there must exist a prime number <math>p</math> such that <math>g(m)</math> and <math>g(m+1)</math> are in the same residue class modulo <math>p</math>.  
  
 
If <math>|g(m)-g(m+1)| = p^aq</math> where <math>q</math> is not divisible by <math>p</math>.  
 
If <math>|g(m)-g(m+1)| = p^aq</math> where <math>q</math> is not divisible by <math>p</math>.  

Revision as of 22:40, 23 October 2010

Problem

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that $\left(g(m)+n\right)\left(g(n)+m\right)$ is a perfect square for all $m,n\in\mathbb{N}.$

Author: Gabriel Carroll, USA

Solution

Suppose such function $g$ exist then:

Lemma 1) $g(m) \ne g(m+1)$ 

Assume for contradiction that  $g(m) = g(m+1)$

$\left(g(m+1)+m\right)\left(g(m)+m+1\right)$ has to be a perfect square

but $\left(g(m)+m\right)^2<\left(g(m+1)+m\right)\left(g(m)+m+1\right)<\left(g(m)+m+1\right)^2$. 

A square cannot be between 2 consecutive squares. Contradiction. Thus,  $g(m) \ne g(m+1)$



Lemma 2) $|g(m)-g(m+1)| = 1$ (we have show that it can't be 0) 

Assume for contradiction, that $|g(m)-g(m+1)| > 1$.

Then there must exist a prime number $p$ such that $g(m)$ and $g(m+1)$ are in the same residue class modulo $p$.

If $|g(m)-g(m+1)| = p^aq$ where $q$ is not divisible by $p$. 


If $a=1$.

Consider an $n$ such that $g(m)+n =p^3$

$g(m+1)+n = p^3 \pm pq =p (r)$ , where $r$ is not divisible by $p$




If $a>1$.

Consider an $n$ such that $g(m)+n =p$

$g(m+1)+n = p \pm p^aq =p (r)$ , where $r$ is not divisible by $p$




At least one of $g(n)+m$ , $g(n)+m+1$ is not divisible by $p$. Hence,

At least one of $(g(m+1)+n )(g(n)+m +1)$,  $(g(m)+n )(g(n)+m)$ is divisible by an odd amount of $p$.

Hence, that number is not a perfect square. 



Thus, $g(x)=x+k$, $k\in\mathbb{N}$
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2010_IMO_Problems/Problem_3&oldid=35944"