There can be perfect squares having more than one digit whose all the digits are odd.
True or False
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.
Is there any perfect square integer a Chris , for which there exists a positive integer n such that all the digits of a − ( a ( m o d 1 0 n ) ) are odd ( a > 1 0 2 n )?
Log in to reply
Won't the last n digits of that number always be zero? (If I've misunderstood could you give an example of the operation you mean?)
Log in to reply
Oh, sorry. Remove those zeros. It should be 1 0 n a − ( a ( m o d 1 0 n ) ) . I mean to say, beyond the tenth place towards left, all digits ( > 1 0 1 0 0 digits for example ) are odd.
Log in to reply
@A Former Brilliant Member – That's ⌊ 1 0 n a ⌋ , by the way.
Quick answer: yes! eg 1 2 4 2 = 1 5 3 7 6 .
It's actually possible to get arbitrarily long squares with only their last digit even; one family of these starts 3 4 2 = 1 1 5 6 , 3 3 4 2 = 1 1 1 5 5 6 , 3 3 3 4 2 = 1 1 1 1 5 5 5 6 etc. It's quite a nice bonus question to prove that pattern always works (I think there might already have been a question about that on here.)
Log in to reply
@Chris Lewis – Thank you very much. Actually this was haunting me over a couple of days. You didn't give the link to the question you referred to.
Since the number's square whose all digits are odd, the number is a odd number.
Let the number be 1 0 A + u where A is any positive integer, u is odd number u ∈ { 1 , 3 , 5 , 7 , 9 }
All carry forward digits c u 2 are even.
( 1 0 A + u ) 2 = 1 0 0 A 2 + 2 0 A u + u 2
The tens digit = 2 0 ⋅ A ⋅ u + 1 0 ⋅ c u 2 ( m o d 1 0 ) = 2 ⋅ A ⋅ u + c u 2 ( m o d 1 0 ) = even
∴ no such perfect numbers whose digits are odd.
Problem Loading...
Note Loading...
Set Loading...
In fact, at least one of the last two digits of a square number greater than 9 is always even.
First proof: list all possible pairs of final digits of odd squares (there are only 1 1 of them) and check: 0 1 , 0 9 , 2 5 , 4 9 , 8 1 , 2 1 , 6 9 , 8 9 , 6 1 , 4 1 , 2 9
Second proof: all even squares end in an even digit; we don't need to worry about those. So consider an odd square, s = ( 2 n + 1 ) 2 .
We know that s − 1 = 4 n 2 + 4 n is a multiple of 4 . Also, the last digit of s is one of 1 , 5 , 9 . So the last digit of s − 1 is one of 0 , 4 , 8 . Hence (by divisibility rules for 4 ) the tens digit must be even.