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 Solvers41
Suggested Problems
-
3825 Solvers
-
7588 Solvers
-
The Goldbach Conjecture, Part 2
2421 Solvers
-
723 Solvers
-
Convert given decimal number to binary number.
2383 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!