Mirror Squared

How many perfect squares have the property that all of their digits are equal?

Note: 0 = 0 2 0=0^2 is a perfect square.


The answer is 4.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

14 solutions

Fætter Guf
Nov 21, 2015

Firstly, let d d be the single digit 1 d 9 1 \leq d \leq 9 that the square number is composed of. d d can then only be 1, 4, 5, 6, or 9 because of the last digit of square numbers.

Secondly, assume b 2 b^{2} is a square number with the wanted properties: b 2 = d × 1 0 n + d × 1 0 n 1 + . . . + d × 10 + d , n 0 b 2 = d ( 1 0 n + 1 0 n 1 + . . . + 10 + 1 ) b 2 = d ( 1 0 n + 1 1 ) 9 \begin{aligned} b^{2} &= d \times 10^{n} + d \times 10^{n-1} + ... + d \times 10 + d \quad , \quad n \geq 0\\ b^{2} &= d(10^{n} + 10^{n-1} + ... + 10 + 1) \\ b^{2} &= \frac{d(10^{n+1}-1)}{9} \end{aligned}

Case 1: n > 0 n > 0 .
Considering quadratic residues modulo 4, we have b 2 0 , 1 ( m o d 4 ) b^{2} \equiv 0, 1 \pmod 4 . Since ( 1 0 n + 1 1 ) 9 3 ( m o d 4 ) \frac{(10^{n+1}-1)}{9} \equiv 3 \pmod 4 , this means that we must have d 0 , 3 ( m o d 4 ) d \equiv 0, 3 \pmod 4 . Hence, d = 3 , 4 , 7 , or 8 d = 3, 4, 7, \text{or} \ 8 . Referencing the possible last digits of a square, this means that we can only have d = 4 d = 4 . Notice that since ( 1 0 n + 1 1 ) 9 3 ( m o d 4 ) \frac{(10^{n+1}-1)}{9} \equiv 3 \pmod 4 , it is not a square number. Hence 4 × ( 1 0 n + 1 1 ) 9 3 ( m o d 4 ) 4 \times \frac{(10^{n+1}-1)}{9} \equiv 3 \pmod 4 is also not a perfect square. Thus, there are no solutions in this case.

Case 2: n = 0 n=0
If n = 0 n = 0 , then we are looking at single digit numbers. The only possibilities for d d are 0, 1, 4, and 9; the square numbers of one digit.

So there are 4 square numbers with all of their digits equal.

Moderator note:

Can you explain "Since ( 1 0 n + 1 1 ) 9 3 ( m o d 4 ) \frac{(10^{n+1}-1)}{9} \equiv 3 \pmod 4 , we see that p p must be 3, 4, 7, or 8 in order for b 2 b^{2} to have a proper quadratic residue. This leaves 4 to be the only candidate"?

Also, how do you know that " ( 1 0 n + 1 1 ) 9 \frac{(10^{n+1}-1)}{9} isn't a square number"?

How did you use the fact that n > 0 n > 0 ?

Great that you're attempting to prove this, instead of just claiming that the only solutions are 0, 1, 4, 9.

Some questions:

  1. Can you explain "Since ( 1 0 n + 1 1 ) 9 3 ( m o d 4 ) \frac{(10^{n+1}-1)}{9} \equiv 3 \pmod 4 , we see that p p must be 3, 4, 7, or 8 in order for b 2 b^{2} to have a proper quadratic residue. This leaves 4 to be the only candidate"?

  2. Also, how do you know that " ( 1 0 n + 1 1 ) 9 \frac{(10^{n+1}-1)}{9} isn't a square number"?

  3. How did you use the fact that n > 0 n > 0 ?

Calvin Lin Staff - 5 years, 6 months ago

Log in to reply

  1. Square numbers have two possible remainders modulo 4; 0 and 1. These are what are called 'quadratic residues'. Since b 2 b^{2} is obviously a square number, its remainder modulo 4 must be either 0 or 1 - this means that d ( 1 0 n + 1 1 ) 9 \frac{d(10^{n+1}-1)}{9} must have remainder 0 or 1 modulo 4 as well. Now, "since ( 1 0 n + 1 1 ) 9 3 ( m o d 4 ) \frac{(10^{n+1}-1)}{9} \equiv 3 \pmod 4 , we see that p p must be 3, 4, 7, or 8..." because 3 × 3 1 ( m o d 4 ) 3 \times 3 \equiv 1 \pmod 4 , 4 × 3 0 ( m o d 4 ) 4 \times 3 \equiv 0 \pmod 4 , 7 × 3 1 ( m o d 4 ) 7 \times 3 \equiv 1 \pmod 4 , and 8 × 3 0 ( m o d 4 ) 8 \times 3 \equiv 0 \pmod 4 "...in order for b 2 b^{2} to have a proper quadratic residue. This leaves 4 to be the only candidate," and the reason 4 is the only candidate is because we already knew that d d had to be either 1, 4, 5, 6, or 9.

  • We know that ( 1 0 n + 1 1 ) 9 \frac{(10^{n+1}-1)}{9} isn't a square number, because its remainder modulo 4 is 3, and it has to be either 0 or 1 for it to be a square number.

  • We use the fact that n > 0 n > 0 when we have to show that ( 1 0 n + 1 1 ) 9 \frac{(10^{n+1}-1)}{9} isn't a square number. If n = 0 n=0 the remainder would be 1 modulo 4, hence d d would need to have remainder 0 or 1 modulo 4, which would make it a square number. Since n = 0 n=0 implies that b 2 b^{2} is a single digit, we see that the only possibilities for d d are 0, 1, 4, and 9; the square numbers of one digit.

  • I don't know if its rigorous enough, or if I've made a mistake somewhere.

    Should I edit the explanations into my solution?

    Fætter Guf - 5 years, 6 months ago

    Log in to reply

    Yes please!

    1. This should be expressed as "Consider quadratic residues mod 4, we have b 2 0 , 1 ( m o d 4 ) b^2 \equiv 0, 1 \pmod{4} , and 1 0 n + 1 1 9 3 ( m o d 4 ) \frac{ 10^{n+1} - 1 } { 9} \equiv 3 \pmod{4} , which means that d 0 , 1 ( m o d 4 ) d \equiv 0, 1 \pmod{4} . Hence, d = 3 , 4 , 7 d = 3, 4, 7 or 8. [Note that you used p p in place of d d , which confused me further.
    2. Great, that should be explicitly stated.
    3. Yup, that's where it's used, and should be stated.

    With this in place, you will have a complete rigorous solution.

    Calvin Lin Staff - 5 years, 6 months ago

    Log in to reply

    @Calvin Lin Woops! I don't know how p p snuck in there - but I've edited my solution. Hopefully it's adequate.

    I'm assuming you meant d 0 , 3 ( m o d 4 ) d \equiv 0, 3 \pmod 4 in (1).

    Fætter Guf - 5 years, 6 months ago

    Log in to reply

    @Fætter Guf Great! I've made some edits to improve the explanation :)

    Calvin Lin Staff - 5 years, 6 months ago

    Log in to reply

    @Calvin Lin This question is unclear as what is expected, brilliant staff needs to review before posting

    fio alp - 5 years, 5 months ago

    Log in to reply

    @Fio Alp This question looks fine to me. Can you explain what the issue you are having is? Specifically, what part is "unclear"?

    Calvin Lin Staff - 5 years, 5 months ago

    Log in to reply

    @Calvin Lin At first glance, I thought the question required both the perfect square number and its root to have the same digits. (I think I partly got this thinking from the example.) This only happens with 0 and 1. When 2 was not the correct answer, I reread the question and realized that only the perfect square number was to have the same digits. However, if the question is made more explicit, there may not be much of a question left.

    David Richner - 5 years, 4 months ago

    @Calvin Lin How did we get the equality 1 0 n + 1 1 9 3 ( m o d 4 ) \dfrac{10^{n + 1} - 1}{9}\equiv 3 \pmod{4} ?

    Tirthankar Mazumder - 11 months, 3 weeks ago

    Sir , I Cant understand the question at all .. can you please clarify

    Jhoemar Mendiogarin - 5 years, 4 months ago

    Log in to reply

    Can you clarify which part of the question you do not understand?
    Do you know all of the terms used?
    Do you know what the sentence means?

    Where did you get stuck in understanding?

    Calvin Lin Staff - 5 years, 4 months ago

    what is the question here?, if someone is unclear in their question should not be allowed to post it here.

    fio alp - 5 years, 5 months ago

    I don't understand. What is "equal"? All the squares are equal. If you mean "the same" then the only way I understand it is if 0 and 1 fit the answer.

    Jeff Hunt - 3 years, 7 months ago

    Log in to reply

    "All of the digits are equal". So, in the case of the square number 16, the digits are 1 and 6, and the digits are not equal.

    Calvin Lin Staff - 3 years, 7 months ago

    What is modulo?

    Sayan Das - 4 years, 9 months ago

    The ans is:0,1,4,9 which is 0^2,1^2,2^2,3^2

    this question is ambiguous.. "How many perfect squares have the property that all of their digits are equal?"....digits are "equal"????shouldnt it be digits are the "same"???

    Agreed, i had no idea what this meant. Terribly worded question xD the answer should be 2: 0^2=0 and 1^2=1, where all the digits are actually equal..

    Will Dowd - 4 years, 10 months ago

    Oh, so it means the perfect square and the square root have the SAME NUMBER OF DIGITS?

    Dang, that's a terribly-worded question.

    A Former Brilliant Member - 4 years, 6 months ago

    udvat question it is.............. ha ha ha !!!!!!!!!!!!!!!! ans tar mathamundu bujhlam na

    Nabanita Brahmachari - 4 years, 6 months ago

    Log in to reply

    Ri8 nabanita

    Sanjoy Pal - 4 years, 6 months ago

    It should say that the digits within the square are equal to each other. Faulty wording.

    Marta Reece - 4 years, 5 months ago

    A correct answer could be 4, since there are 4 perfect squares that have the property etc. The question does not ask to list them.

    Michael McPherson - 3 years, 8 months ago

    I hate this problem because it's literally a troll problem 😓😓 they made this to screw with us

    Eiman Hairston - 3 years, 4 months ago

    Yes, this question had me thinking of a

    x^2=x question format this question isn't just terribly worded, they are not actually asking you to do the thing that is the supposed solution.

    Perfect circles could stand with more explanation in the context of the question too

    Viewing solutions hasn't even really led me to understand what the question really should be.

    Evelien Heerens - 2 years, 8 months ago

    What the hell is this question asking about?????????

    Nishant Ranjan - 1 year, 7 months ago

    0, 1, 4 and 9.

    What is the question actually asking??

    Debmeet Banerjee - 5 years, 6 months ago

    dang it!!I entered 3(1,4,9).

    Adarsh Kumar - 6 years, 7 months ago

    Log in to reply

    yea I missed 0 too in the first try..

    Aditya Pappula - 6 years, 7 months ago

    enter 3 , than 4

    math man - 6 years, 7 months ago

    I am lazy to type out the whole solution using latex. But here is how I did it:

    First prove that a number(say x ) x) containing only 1's with more that 1 digit cannot be a square since it always leaves a remainder of 3 when divided by 4. Then every number in the form a a . . . a a \overline { aa...aa } with n a's is a multiple of x with n 1's. Doing some casework it can be proved that a a . . . a a \overline { aa...aa } is not a perfect square when there are more than 1 a's. Hence such a number can have only one digit. Therefore the possible values are 0,1,4,9.

    @Satvik Golechha Please do tell me if have made a mistake(s).

    milind prabhu - 6 years, 7 months ago

    Log in to reply

    Perfect, @milind prabhu . Why don't you make it a solution, looks great!

    Satvik Golechha - 6 years, 7 months ago

    yeah but why is this a level 4 problem? a number with same digits mean it is divisible by a string of 1's with the same number of digits. so a number with more than one digit cant satisfy the problem.

    Eric Escober - 6 years, 7 months ago

    Log in to reply

    Maybe it's a level 4 because of the proof of the same...

    Satvik Golechha - 6 years, 7 months ago

    Log in to reply

    hey what about this? try the square of the number 3333333 and just keep adding 3 so on you will get you answers in terms of number which contain only 1 and W.R.T. your question you did not mention that the number should be a two digit or a 3 digit number SO YOUR QUESTION WRONG! So should i report to Calvin Lin or you should better change the statement of your question!

    Smarth Mittal - 6 years, 4 months ago

    The answer is any square. Equal numbers is what makes it a square. Duh...

    Haddon Harper - 4 years, 7 months ago

    This is a poorly worded question...

    Travis Brownlee - 4 years, 6 months ago

    Log in to reply

    I agree to this, poorly worded.... I had to view the solve!

    Sfurvdio Rwen - 3 years, 9 months ago

    What did it mean by equal digit?

    Sfurvdio Rwen - 3 years, 9 months ago
    Auro Light
    Sep 12, 2017

    When all digits are same, the number is
    AAAA.......n times, and it is also a perfect square. Which means A×1111...n times is a perfect square. But 111....n times is equal to, = 1+10 +10^2+.......+10^(n-1)=(10^n -1)/9.
    This implies that A as well as this sum should each be a perfect square separately.
    Let (10^n - 1)/9 = b^2,
    then 10^n - 9b^2 = 1,
    => (root 10^n + 3b )(root 10^n - 3b)= 1×1
    => n = 0 and b = 0, which mean that the number is A×(10^0)= A, a single digit
    number.
    So, A = 0, 1, 4 and 9 are possible answers.


    The first clear explanation in date, among the ones above.

    Leonblum Iznotded - 2 years, 10 months ago

    Could you explain why " This implies that A as well as this sum should each be a perfect square separately. "?

    Andy Lau - 2 years, 7 months ago
    William Gardner
    Oct 2, 2017

    I need some help. I guessed and got it right, but I definitely do not understand this question at all. Which to me, makes my answer wrong. What exactly is a perfect square?? And what is meant by "have the property that all of their digits are equal"?? Thanks for the help.

    Mikuri Fujisaka
    Nov 20, 2014

    A number of the same digits, as seen in other solutions, must be divisible by a number made of only 1s. However, these numbers can only be divisible by themselves, 1, and the set of 3 and the 037 string if the number of 1s is divisible by 3.

    However, the 1 string has to be multiplied by itself in order to have this be a perfect square. Thus, the only 1 string that fits is 1 itself - so they have to be 1 digit perfect squares.

    The positive single-digit perfect squares are 1, 4, and 9. However, 0 is also a perfect square too: 0 2 = 0 0^{2}=0

    Stephen Rasey
    Aug 24, 2018

    How about 7 as an answer? Is (-3)^2 a different square than (+3)^2 They both result in +9, but are they different squares?

    Gia Hoàng Phạm
    Aug 15, 2018

    Then a 2 < 10 a^2<10 or a < 10 a<\sqrt{10} that a a is a integer which is 0 , 1 , 2 , 3 0,1,2,3

    Anwar .
    Aug 22, 2017

    The solution is to prove that no same digit serie with a length > 1 can be a perfect square. If it was it'll be obviously something like 111111... , 444444.... or 9999..... because of 1, 2^2, 3^3 multiplying 11111... So we have to prove that any serie of 1 cannot be a perfect square. It s obvious for 11 as a prime number so what about length > 3. Lets analyse the 2 last digits of the root of this hypothetical square. It would be something like A1 or A9 because only 1 and 9 squares ends by 1. the squares of such roots should have thoses patterns on their 2 last digits : - A1 : 2 A ;1 : 2 A cannot end by 1 (even) - A9 :18 A +8;1 : 18 A +8 cannot end by 1 - If it was the case 18*A should end by 3 - Impossible So the solution is 0,1,4 and 9

    Arindam Paul
    Jun 12, 2017

    Since, there is no such no. greater than equal to 2 digits having ALL the digits same and the number being a perfect square, we need to choose only 1 digit perfect squares. Those are 0= 0 2 0^{2} , 1= 1 2 1^{2} , 4= 2 2 2^{2} , 9= 3 2 3^{2} . Thus, these 4 digits are the required answers.

    It could be thought as since the digits are to be same then all the single digit perfect square(0,1,4,9) would be the answer plus we have to check whether any unit multiple (i.e 0-9) of numbers like 11,111,1111 and similarly 1111111...... would be perfect square and it is simple to see they won't be.

    There are only 22 possible endings for perfect square numbers. 11 is not one of them. All square numbers end in either 00, 01, 04, 09, 16, 21, 24, 25, 29, 36, 41, 44, 49, 56, 61, 64, 69, 76, 81, 84, 89 or 96.

    Robert Singleton - 3 years, 10 months ago
    Abhishek Maurya
    Feb 13, 2017

    What if i say -1,-2,-3 are also the solutions

    Rao Nagisetty
    Dec 26, 2016

    All square integers end in either 0, 1,4,9,6,5. So if there is a square S with all digits equal it must be dddd..d where d is one of 0,1,4,5,6,9. Further if the number has n decimal places and d is 1,4, or 9 easy to see that S/d is a square with all its digits equal to 1. On the other hand if d=6, 6^2 must divide S and so 6 must divide S/d which is odd, a contradiction. If d=5, 5^2 divides S and so 5 divides S/d, that is impossible because S/d ends in 1 and any number divisible by 5 must end in either 5 or 0. The question is reduced to finding all squares whose digits are all equal to 1. In this case if S has n digits, S=1+ 10^1+.......+10^(n-1) which is equal to (10^n-1)/9= (say) b^2. Thus (10^n-1)=(3b)^2 which is congruent to 1 mod 4 because 3b is odd. Thus 10^n is congruent to 2 mod 4. That is impossible unless n=1. This means S=1. Hence the only possibilities are 0,1,4,9.

    Zyberg Nee
    Dec 24, 2016

    x x x . . . x = 111...1 x \overline{xxx...x} = 111...1x , 0 x 9 0 \le x \le 9 .

    When number is higher than 1 digit, we need 111...1 to be equal to x for the number to be a perfect square. However, since x can not be higher than 9, we are looking for one digit numbers.

    Next we check for the perfect squares lesser or equal to 9. There are 4 \boxed{4} such ones.

    1 pending report

    Vote up reports you agree with

    ×

    Problem Loading...

    Note Loading...

    Set Loading...