Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$.
Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$.
(a) Show that there are only finitely many pairs of consecutive highly divisible
integers of the form $(a, b)$ with $a\mid b$.
(b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.
Source : IMO SL 2005 N5
IMO SL 2005 N5
For discussing Olympiad Level Number Theory problems
Unread post by rah4927 » Fri Feb 03, 2017 8:21 pm
Jump to
- General Discussion
- ↳ News / Announcements
- ↳ Introductions
- ↳ Social Lounge
- ↳ Site Support
- ↳ Test Forum
- ↳ Teachers' and Parents' Forum
- Mathematics
- ↳ Primary Level
- ↳ Junior Level
- ↳ Secondary Level
- ↳ Higher Secondary Level
- ↳ College / University Level
- Olympiads & Other Programs
- ↳ Divisional Math Olympiad
- ↳ Primary: Solved
- ↳ Junior: Solved
- ↳ Secondary: Solved
- ↳ H. Secondary: Solved
- ↳ National Math Olympiad (BdMO)
- ↳ National Math Camp
- ↳ Asian Pacific Math Olympiad (APMO)
- ↳ International Olympiad in Informatics (IOI)
- ↳ International Mathematical Olympiad (IMO)
- Olympiad Level
- ↳ Geometry
- ↳ Number Theory
- ↳ Algebra
- ↳ Combinatorics
- Sciences
- ↳ Physics
- ↳ Chemistry
- ↳ Computer Science
- ↳ Biology
- ↳ Astronomy & Astrophysics