Need n squares that equal one square all together, none zero, none fractured. For example, calling squares(2) should output [16 9] or [25 144] etc, because 16=4*4, 9=3*3, and 16+9=5*5, similarly 25=5*5, 144=12*12, and 25+144=13*13.
1819 Solvers
Project Euler: Problem 4, Palindromic numbers
101 Solvers
44 Solvers
246 Solvers
Relative ratio of "1" in binary number
109 Solvers
Tags