Steady squares: Difference between revisions
Content added Content deleted
Line 11: | Line 11: | ||
limit = 10000 |
limit = 10000 |
||
for n in range(limit): |
for n in range(1,limit): |
||
nstr = str(n) |
nstr = str(n) |
||
nlen = len(nstr) |
nlen = len(nstr) |
Revision as of 07:09, 21 December 2021
Steady squares is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: 376*376 = 141376. Let's call a number with this property a steady square. Find steady squares under 10.000
Python
<lang python> print("working...") print("Steady numbers under 10.000 are:") limit = 10000
for n in range(1,limit):
nstr = str(n) nlen = len(nstr) square = str(pow(n,2)) rn = square[-nlen:] if nstr == rn: print(str(n) + " " + str(square))
print("done...") </lang>
- Output:
working... Steady numbers under 10.000 are: 1 1 5 25 6 36 25 625 76 5776 376 141376 625 390625 9376 87909376 done...
Ring
<lang ring> see "working..." +nl limit = 10000
for n = 1 to limit
nstr = string(n) len = len(nstr) square = pow(n,2) rn = right(string(square),len) if nstr = rn see "" + n + " " + square + nl ok
next
see "done..." +nl </lang>
- Output:
working... Steady numbers under 10.000 are: 1 1 5 25 6 36 25 625 76 5776 376 141376 625 390625 9376 87909376 done...