The sum of the squares of certain unusual integers is equal to the concatenation of their individual digits.
For example:
1233 = 12^2+33^2
990100 = 990^2+100^2
Given a number n, write a function that returns true if the number displays this property, and false otherwise. The number of digits will always be even.
This problem is inspired by this blog post: http://benvitalenum3ers.wordpress.com/2013/03/12/concatenation-x-y-x2-y2/
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers39
Suggested Problems
-
3997 Solvers
-
4564 Solvers
-
662 Solvers
-
303 Solvers
-
Find out sum of prime number till given number
271 Solvers
More from this Author9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!