Understand the problem

Determine all integers $n \geq 2$ for which the number $11111$ in base $n$ is a perfect square.
Source of the problem
Cyprus IMO TST 2018, Problem 1
Topic
Number Theory
Difficulty Level
7/10
Suggested Book
Challenges and Thrills of Pre College Mathematics

Start with hints

Do you really need a hint? Try it first!

Let us write the problem in Mathematical Language i.e. in the form of equations.  \( (11111)_n\) in base n \( = 1 + n + n^2 + n^3 + n^4 \). So, the problem reduces to finding positive integer solutions to \( m^2 = 1 + n + n^2 + n^3 + n^4 \).  
The idea is that we will try to bound the \( 1 + n + n^2 + n^3 + n^4 \) in between some squares and from that we will try to estimate the values of m in terms of n. Observe that$(2m)^2=4n^4+4n^3+4n^2+4n+4.$ Now, can you form squares from the right side?  If not can you bound it by two squares?    
First of all to form, you take the max terms \(4n^4 = (2n)^2 \). So, that term must be included in the square. Also, try to find a, b, c such that \( (2n^2 + an + b)^2\) can be made greater or lesser the given expression.  Observe that you will get the following. $(2n^2+n)^2<4n^4+4n^3+4n^2+4n+4<(2n^2+n+2)^2$ Now, guess that  $(2n^2+n)^2<(2m)^2<(2n^2+n+2)^2$ So, what we get the relationship of m and n?
We get that \((2m) = (2n^2 + n + 1) \). Hence,  $(2m)^2=(2n^2+n+1)^2 \Leftrightarrow 4n^4+4n^3+4n^2+4n+4=(2n^2+n+1)^2.$ Observe that, this results in a lot of cancellation of terms and we are left with:  $n^2-2n-3=0.$This gives the solution (m,n) = (11, 3)

Watch video

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

Tetrahedron Problem | AIME I, 1992 | Question 6

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1992 based on Tetrahedron Problem.

Triangle and integers | AIME I, 1995 | Question 9

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1995 based on Triangle and integers.

Functional Equation Problem from SMO, 2018 – Question 35

Try this problem from Singapore Mathematics Olympiad, SMO, 2018 based on Functional Equation. You may use sequential hints if required.

Sequence and greatest integer | AIME I, 2000 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2000 based on Sequence and the greatest integer.

Arithmetic sequence | AMC 10A, 2015 | Problem 7

Try this beautiful problem from Algebra: Arithmetic sequence from AMC 10A, 2015, Problem. You may use sequential hints to solve the problem.

Series and sum | AIME I, 1999 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1999 based on Series and sum.

Inscribed circle and perimeter | AIME I, 1999 | Question 12

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2011 based on Rectangles and sides.

Problem based on Cylinder | AMC 10A, 2015 | Question 9

Try this beautiful problem from Mensuration: Problem based on Cylinder from AMC 10A, 2015. You may use sequential hints to solve the problem.

Cubic Equation | AMC-10A, 2010 | Problem 21

Try this beautiful problem from Algebra, based on the Cubic Equation problem from AMC-10A, 2010. You may use sequential hints to solve the problem.

Median of numbers | AMC-10A, 2020 | Problem 11

Try this beautiful problem from Geometry based on Median of numbers from AMC 10A, 2020. You may use sequential hints to solve the problem.