Happy Memorial Day! Please note that AoPS Online is closed May 24-26th.

G
Topic
First Poster
Last Poster
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Nice "if and only if" function problem
ICE_CNME_4   1
N 9 minutes ago by ICE_CNME_4
Let $f : [0, \infty) \to [0, \infty)$, $f(x) = \dfrac{ax + b}{cx + d}$, with $a, d \in (0, \infty)$, $b, c \in [0, \infty)$. Prove that there exists $n \in \mathbb{N}^*$ such that for every $x \geq 0$
\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\](For $n \in \mathbb{N}^*$ and $x \geq 0$, the notation $f_n(x)$ represents $\underbrace{(f \circ f \circ \dots \circ f)}_{n \text{ times}}(x)$. )

Please do it at 9th grade level. Thank you!
1 reply
+1 w
ICE_CNME_4
Yesterday at 7:23 PM
ICE_CNME_4
9 minutes ago
Minimum of this fuction
persamaankuadrat   1
N 42 minutes ago by alexheinis
Source: KTOM January 2020
If $x$ is a positive real number, find the minimum of the following expression

$$\lfloor x \rfloor + \frac{500}{\lceil x\rceil^{2}}$$
1 reply
persamaankuadrat
2 hours ago
alexheinis
42 minutes ago
Find the remainder
Jackson0423   0
an hour ago

Find the remainder when
\[
\frac{5^{2000} - 1}{4}
\]is divided by \(64\).
0 replies
Jackson0423
an hour ago
0 replies
A well-known circle hides in the dark
darij grinberg   15
N an hour ago by TUAN2k8
Source: All-Russian Olympiad 2006 finals, problem 11.4 (problem 4 for grade 11)
Given a triangle $ ABC$. The angle bisectors of the angles $ ABC$ and $ BCA$ intersect the sides $ CA$ and $ AB$ at the points $ B_1$ and $ C_1$, and intersect each other at the point $ I$. The line $ B_1C_1$ intersects the circumcircle of triangle $ ABC$ at the points $ M$ and $ N$. Prove that the circumradius of triangle $ MIN$ is twice as long as the circumradius of triangle $ ABC$.
15 replies
darij grinberg
May 6, 2006
TUAN2k8
an hour ago
unsolved nt
MuradSafarli   1
N an hour ago by whwlqkd
Find all prime numbers $p$ such that $p^2 - 12$ is also a prime number.
1 reply
MuradSafarli
an hour ago
whwlqkd
an hour ago
IMO Problem 4
iandrei   106
N 2 hours ago by alexanderchew
Source: IMO ShortList 2003, geometry problem 1
Let $ABCD$ be a cyclic quadrilateral. Let $P$, $Q$, $R$ be the feet of the perpendiculars from $D$ to the lines $BC$, $CA$, $AB$, respectively. Show that $PQ=QR$ if and only if the bisectors of $\angle ABC$ and $\angle ADC$ are concurrent with $AC$.
106 replies
iandrei
Jul 14, 2003
alexanderchew
2 hours ago
interesting diophantiic fe in natural numbers
skellyrah   0
2 hours ago
Find all functions \( f : \mathbb{N} \to \mathbb{N} \) such that for all \( m, n \in \mathbb{N} \),
\[
mn + f(n!) = f(f(n))! + n \cdot \gcd(f(m), m!).
\]
0 replies
skellyrah
2 hours ago
0 replies
Three numbers cannot be squares simultaneously
WakeUp   39
N 2 hours ago by MR.1
Source: APMO 2011
Let $a,b,c$ be positive integers. Prove that it is impossible to have all of the three numbers $a^2+b+c,b^2+c+a,c^2+a+b$ to be perfect squares.
39 replies
WakeUp
May 18, 2011
MR.1
2 hours ago
FE over R
IAmTheHazard   21
N 2 hours ago by benjaminchew13
Source: ELMO Shortlist 2024/A3
Find all functions $f : \mathbb{R}\to\mathbb{R}$ such that for all real numbers $x$ and $y$,
$$f(x+f(y))+xy=f(x)f(y)+f(x)+y.$$
Andrew Carratu
21 replies
IAmTheHazard
Jun 22, 2024
benjaminchew13
2 hours ago
Nice one
Blacklord   10
N 2 hours ago by Pal702004
Source: ....
Find all integers numbers (a,b,c) such that
$a/b + b/c + c/a =3$
10 replies
Blacklord
Jan 26, 2017
Pal702004
2 hours ago
Four points are concyclic
DreamTeam   9
N 2 hours ago by AylyGayypow009
Source: Moldova IMO-BMO TST 2003, day 1, problem 3
Let $ ABCD$ be a quadrilateral inscribed in a circle of center $ O$. Let M and N be the midpoints of diagonals $ AC$ and $ BD$, respectively and let $ P$ be the intersection point of the diagonals $ AC$ and $ BD$ of the given quadrilateral .It is known that the points $ O,M,Np$ are distinct. Prove that the points $ O,N,A,C$ are concyclic if and only if the points $ O,M,B,D$ are concyclic.

Proposer: Dorian Croitoru
9 replies
DreamTeam
Aug 14, 2008
AylyGayypow009
2 hours ago
cubefree divisibility
DottedCaculator   63
N 2 hours ago by Assassino9931
Source: 2021 ISL N1
Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$
63 replies
DottedCaculator
Jul 12, 2022
Assassino9931
2 hours ago
$n$ with $2000$ divisors divides $2^n+1$ (IMO 2000)
Valentin Vornicu   67
N 3 hours ago by alexanderchew
Source: IMO 2000, Problem 5, IMO Shortlist 2000, Problem N3
Does there exist a positive integer $ n$ such that $ n$ has exactly 2000 prime divisors and $ n$ divides $ 2^n + 1$?
67 replies
Valentin Vornicu
Oct 24, 2005
alexanderchew
3 hours ago
Hard Number Theory
MuradSafarli   1
N 3 hours ago by MR.1
Find all odd natural numbers \( m \) such that \( m^2 - 1 \mid 3^m + 5^m \).
1 reply
MuradSafarli
Yesterday at 7:06 PM
MR.1
3 hours ago
IMO 2011 Problem 5
orl   85
N May 11, 2025 by Markas
Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$.

Proposed by Mahyar Sefidgaran, Iran
85 replies
orl
Jul 19, 2011
Markas
May 11, 2025
IMO 2011 Problem 5
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#1 • 15 Y
Y by Davi-8191, microsoft_office_word, megarnie, son7, ChuongTk17, Adventure10, Mango247, ItsBesi, and 7 other users
Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$.

Proposed by Mahyar Sefidgaran, Iran
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
m.candales
186 posts
#2 • 19 Y
Y by lspecwave, zephyr7723, A-Thought-Of-God, Pitagar, lneis1, son7, megarnie, anar_mehdiyev, Adventure10, Mango247, Stuffybear, iamnotgentle, and 7 other users
-- $f(n)|f(0)$ for every integer $n$
$f(m)=f(m-0)|f(m)-f(0)$. Then $f(m)|f(0)$

-- $f(-n) = f(n)$ for every integer $n$
$f(-n)=f(0-n)|f(0)-f(n)$. Then $f(-n)|f(n)$ since $f(-n)|f(0)$. Similarly $f(n)|f(-n)$. Then $f(n)=f(-n)$

Suppose that $f(m) < f(n)$ and $f(m)$ doesn't divide $f(n)$.
$f(m+n)=f(m-(-n))|f(m)-f(-n)=f(m)-f(n)$. Then $f(m+n)\le f(n)-f(m) \ \ \ \ (*)$
$f(m)|f(n+m)-f(n)$. Then $f(m)$ doesn't divide $f(n+m)$. Then $|f(n+m)-fm)|$ is not $0$
$f(n)|f(n+m)-f(m)$. Then $f(n)\le f(n+m)-f(m)$ or $f(n)\le f(m)-f(n+m)$
If $f(n)\le f(n+m)-f(m)$, then $f(n)+f(m+n)\le f(m+n)+f(n)-2f(m)$ (adding with (*)), which is impossible
If $f(n)\le f(m)-f(n+m)$, then $f(n)+f(n+m)\le f(n)-f(n+m)$ (adding with (*)), which is impossible

Therefore if $f(m)\le f(n)$, we must have that $f(m) |f(n)$
This post has been edited 1 time. Last edited by m.candales, Jul 19, 2011, 1:37 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
howsiyu
1 post
#3 • 5 Y
Y by son7, Adventure10, Mango247, and 2 other users
here is the sketch.
1. f(x) l f(0)
2. f(x) l f(-x), f(-x) l f(x)
3. f(x)=f(-x)
4.f(x+y) l f(x)+f(y), f(x) l f(x+y)-f(y), f(y) l f(x+y)-f(x)
5. two of .f(x+y), f(x), f(y) are the same.
6. f(a) l f(b) or f(b) l f(a) if a,b are x, y or x+y
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hungnguyenvn
50 posts
#4 • 2 Y
Y by Adventure10, Mango247
Sorry but,is it true? f(m)|f(m n)-f(n),then f(m)|f(2m).,and f(2m)=f(m m)|f(m)-f(-m),so f(m)|f(-m) for all integer m so f(m)= f(-m) for all m. We have f(m n)|f(m)-f(-n)=f(m)-f(n) for all m,n >0. Then |f(m)-f(n)|>=f(m n) (1). IF f(m n)>f(n) for m,n>0 then sine f(m)|f(m n)-f(n) we have f(m n)-f(n)>=f(m) (2) Sine (1) and (2) :f(m) f(n)<=|f(m)-f(n)|Contracdiction!So f(m)>=f(n) for all m<=n. Pleas
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Learner94
634 posts
#5 • 6 Y
Y by dizzy, son7, Adventure10, and 3 other users
Solution:

We have $f(m-n)|f(m)-f(n)$ setting $n=0$ gives $f(m)|f(0)$, setting $m=0$ we get $f(-n)|f(n)$ implying $f(n)|f(-n)$ hence $f(-n)= f(n)$ .This gives $f(m+n)|f(m)-f(n)$ , If $f(n)\geq f(m)$ we have $f(m+n)\leq f(n)-f(m)$.Further $f(n)|f(m+n)-f(m)$.This implies we may have $(i)  f(n)\leq f(m+n)-f(m)$ but from the previous inequality $f(m+n)+f(m)\leq f(n)\leq f(m+n)-f(m)$ which means $2f(m)\leq 0$ clearly impossible.We consider case $(ii) f(n)\leq f(m)-f(m+n)$, but this ,with $f(n)\geq f(m)$, gives $f(m)+f(m+n)\leq f(n)+f(m+n)\leq f(m)$,giving $f(m+n)\leq 0$, again not possible.The last case $(iii)$ and the only possibility is $f(m+n)= f(m)$.But we have $f(m)|f(m+n)-f(n)$implying $f(m)|f(m)-f(n)$. Hence we must have $f(m)|f(n)$, and we are done!
This post has been edited 1 time. Last edited by Learner94, Jul 19, 2011, 6:35 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
TheStrayCat
161 posts
#6 • 5 Y
Y by donot, Adventure10, Mango247, and 2 other users
Here's my convoluted solution I'm not totally sure about. If anyone takes the time and checks this stream of consciousness, I'll be happy.

First, $n=0$ -> $f(m)|f(0)$ for every integer $m$.
Then, since we have $f(1)|f(1), f(1)|f(2)-f(1), f(1)|f(3)-f(2), ... $ for both positive and negative integers, for every integer $m$ we have $f(1)|f(m)$. Therefore we can replace our function with $f_1(x)=f(x)/f(1)$, making sure this affects neither the conditions nor the required result.

Similarly, we get $f(-1)=1$. Next, using the basic statement we have that for all integral variables $f(m)|f(km)$. Since the function is positive, employing $k=-1$ we obtain it's even.

Now suppose there's number $m$ for which $f(m)>1$ and $f(m-1)>1$. Substituting $1$ in the place of $n$, we have that $f(m-1)|f(m)-1$, and doing the same with $m-1$ and $-1$, $f(m)|f(m-1)-1$. Hence, at least one value, $f(m-1), f(m)$ must equal 1 and we have a contradiction.

Denote the set of all integers $m$ for which $f(m)>1$ as $P$. As shown above, $m \in P$ entails $km \in P$. Now we'll show that $m \in P$ and $n \in P$ entail $(m+n) \in P$. Really, if $f(m+n)=1$, then according to the statement $f(n)|f(m)-1$ and $f(m)|f(n)-1$, hence, either of these values is equal to one, which is against our assumption. So, if $f(m)>1, f(n)>1, f(p)>1$, for any integer multipliers $f(am+bn+cp)>1$ (*).

On the other hand, no pair of coprime numbers can be contained in $P$ - otherwise we can find two neighbouring numbers each of them dividing one of the taken. Given all this, we conclude that all numbers of $P$ share a divisor $s$ greater than $1$. [If a set of numbers has no common divisor, there exists a number that is coprime with all of them and can be expressed as their combination like (*)]. In this case, we introduce a new function $f_2(x)=f(x/s)$ and continue the same steps for it. Numbers which are not divisible by $s$ can be disregarded, because they satisfy the needed condition anyway. Step by step, every number will be reached in this way at some point and our construction proves what is necessary.
This post has been edited 1 time. Last edited by TheStrayCat, Jul 22, 2011, 9:03 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mszew
1046 posts
#7 • 3 Y
Y by Adventure10, Mango247, and 1 other user
Is it possible to find all f?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mavropnevma
15142 posts
#8 • 5 Y
Y by Adventure10, Mango247, and 3 other users
Surely your example is not good, since $f$ takes positive values. However, the post above you opens some hope on such a question.

Definitely $f$ is even, the fibres of $f$ are finitely many, and $\textrm{Im} f$ is a finite chain $C$ in $(\mathbb{Z}_+^*, \mid)$, with $\min C = f(\pm 1)$ and $\max C = f(0)$. How much definition can we bring as to the structure of $f$?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Zhero
2043 posts
#9 • 6 Y
Y by Adventure10, Mango247, navi_09220114, and 3 other users
I believe the functions can be characterized as follows:

Let $1 = a_1 < a_2 < \cdots < a_t$ be integers, with $a_1 \, | \,  a_2 \, | \, \cdots \, | \,  a_t$, and let $c_1 < c_2 < \ldots < c_t$ be any integers such that $c_1 \, | \,  c_2 \, | \, \cdots \, | \,  c_t$. For any nonzero integer $k$, let $\alpha(k)$ be the largest integer $i$ such that $a_i | k$. Then $f(k) =c_{\alpha(k)}$ for all nonzero $k$, and $f(0)$ is any multiple of $c_t$.

Please inform me if the following solution has any errors:
Click to reveal hidden text
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
veyron
16 posts
#10 • 5 Y
Y by ali.agh, Adventure10, Mango247, and 2 other users
a different approach:
1. $f(n)|f(0)$
2. $f(n)=f(-n)$
3. $f(n)|f(kn)$
4. let $am+bn=gcd(m,n)$
then $f(bn)|f(am)-f(gcd(m,n))$
$f(am)|f(bn)-f(gcd(m,n))$
at least one of $f(am)-f(gcd(m,n))$ , $f(bn)-f(gcd(m,n))$ equals 0
we have $f(am) \ge f(m) \ge f(gcd(m,n))$ $f(n) \ge f(m)$
so $f(am)=f(m)=f(gcd(m,n))$
and $f(gcd(m,n))|f(n)$
we have $f(m)|f(n)$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathmdmb
1547 posts
#11 • 1 Y
Y by Adventure10
orl wrote:
Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers m and n, the difference $f(m) - f(n)$ is divisible by $f(m- n).$ Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m).$

Proposed by Mahyar Sefidgaran, Iran
Nice problem.

We use the facts: $a,b\in\mathbb{N}a|b\implies b\ge a$ and $a|b\pm a\implies a|b$.

First let's prove that $f$ is an even function.
Set $n=0$ giving that $f(m)|f(m)-f(0)\implies f(m)|f(0)\forall m$. Setting $m=0$, we get $f(-n)|f(n)$ and since $f$ is defined for all integers, it is symmetric for $n$ and $-n$ implying $f(-n)=f(n)$
Then expand using $m+n=m-(-n)$ to note that $f(m+n)|f(m)-f(n)$. Since the co-domain of $f$ is $\mathbb{N}$ we have three cases.

Case 1:
$f(m)-f(n)\ge f(m+n)$. But we have $f(m)=f(m+n-n)|f(m+n)-f(n)$ giving $f(m)-f(n)\ge f(m+n)\ge f(m)+f(n)$ $\implies f(m)+f(n)\le f(m)-f(n)\implies 2f(n)\le 0$, contradiction since $f(m)\in\mathbb{N}$.

Case 2:
$  f(m)\le f(n)-f(m+n) $ which is almost similar using the given fact $f(n)\ge f(m)$ and not possible.

Case 3:
$f(m+n)=f(m)$ holds as the only possibility.
Then $f(m)|f(m+n)-f(m)=f(n)-f(m)\implies f(m)|f(n)$.
We are done.

Edit: Since most solutions use the same idea, I was thinking to solve this using induction. Is it possible with induction? Also, may be in the cases I have reversed the order of $m$ and $n$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Samanyolu
15 posts
#12 • 3 Y
Y by Adventure10 and 2 other users
What do you think about this solution?
1. f(m) divides f(0) for all m integers. So, f(m) can take a finite number of values.
2. We can partition the integers into a finite number of sets S1, S2, ..., Sr so that for all i all elements of Si have same image f(Si) under f.
3. WLOG assume that f(S1)<f(S2)<...<f(Sr)
4. Since f(m-n)|f(m)-f(n), we can find 1<=t<=r so that f(St)|f(Sj)-f(Si) for all 1<=i<j<=r
5. We prove by induction on r that f(S1)|f(S2)|.....|f(Sr).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
yunxiu
571 posts
#13 • 3 Y
Y by Adventure10, Mango247, and 1 other user
mszew wrote:
"Is it possible to find all f?For example:
$f(n) \in \{a,-a\}$ and $f(0)=k a$

Another example:$f(odd)=a$, $f(even)=ab$, $f(0)=abc$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SCP
1502 posts
#14 • 1 Y
Y by Adventure10
mathmdmb wrote:
orl wrote:
Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers m and n, the difference $f(m) - f(n)$ is divisible by $f(m- n).$ Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m).$

Proposed by Mahyar Sefidgaran, Iran

Case 1:
$f(m)-f(n)\ge f(m+n)$. But we have $f(m)=f(m+n-n)|f(m+n)-f(n)$ giving $f(m)-f(n)\ge f(m+n)\ge f(m)+f(n)$ $\implies f(m)+f(n)\le f(m)-f(n)\implies 2f(n)\le 0$, contradiction since $f(m)\in\mathbb{N}$.

.
Wrong

f(m)|f(m+n)-f(n)=0 gives
f(m)+f(n ge f(m+n) here with f; qnd f(m+n) different

Hence it is wrong qnd zouldn`t get more than four and you hqve typo in casa2
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mavropnevma
15142 posts
#15 • 16 Y
Y by ali.agh, Adventure10, Mango247, sabkx, and 12 other users
Again, a fat-less late proof. Let us first gather some trivial results.

Since $f(m)=f(m-0)\mid f(m)-f(0)$, it follows $f(m)\mid f(0)$ for every integer $m$.
We now have $f(-n)=f(0-n)\mid f(0)-f(n)$, so $f(-n)\mid f(n)$, since $f(-n)\mid f(0)$. Then also $f(n)\mid f(-n)$, therefore $f(n)=f(-n)$ (they are both positive).

Now we can write
\[f(m-n) \mid f(m) - f(n),\]
\[f(n) \mid f(m) - f(m-n),\]
\[f(m) \mid f(n) - f(n-m) = f(n) - f(m-n),\]
therefore we have three positive integers, each dividing the difference of the other two. That is only possible if two of them are equal, and dividing the third, so for $f(m) \leq f(n)$ we either have $f(m) = f(n)$, or else we can say even more, namely $f(m-n) = f(m) \mid f(n)$.

What can we say about such functions? It is now time for some elementary group theory. Define the fibre $\Omega =f^{-1} (\omega)$ that contains $0$.
In general, we must have $\Omega - \Omega \subseteq \Omega$, since for any elements $m,n \in \Omega$ we have $\omega = f(n) \mid f(m) - f(m-n) = \omega - f(m-n)$, implying $f(m-n) = \omega$, hence $m-n \in \Omega$. Therefore $\Omega$ is some additive subgroup $(k\mathbb{Z},+) \subsetneq (\mathbb{Z},+)$.

Clearly, a constant $f$ fulfills.
If $f$ takes more than one value, and it may only take finitely many, all divisors of $\omega = f(0)$ (so $\textrm{Im} f$ is a finite chain in the poset $(\mathbb{N}^*, \mid)$, of maximal element $\omega$), then it is easy to show that $\alpha = f(\pm 1)$ divides them all.

A non-constant example with only two fibres $0\in \Omega =f^{-1} (\omega)$, $\pm 1 \in A=f^{-1} (\alpha)$ (with $\alpha \mid \omega$) will have to have $A = \mathbb{Z} \setminus \Omega$, with $\Omega$ some additive subgroup $(k\mathbb{Z},+) \subsetneq (\mathbb{Z},+)$.

This can most likely be pursued even farther - I will append any further progress ...
Z K Y
G
H
=
a