Find square difference: Difference between revisions
Content added Content deleted
No edit summary |
|||
Line 18: | Line 18: | ||
newSquare = n*n |
newSquare = n*n |
||
if (newSquare - oldSquare > limit2): |
if (newSquare - oldSquare > limit2): |
||
print("Least number is = ") |
print("Least number is = ", end = ""); |
||
#print(int(math.sqrt(oldSquare))) |
|||
print(int(math.sqrt(newSquare))) |
print(int(math.sqrt(newSquare))) |
||
break |
break |
||
Line 30: | Line 29: | ||
<pre> |
<pre> |
||
working... |
working... |
||
Least number is = |
Least number is = 501 |
||
501 |
|||
done... |
done... |
||
</pre> |
</pre> |
Revision as of 16:17, 18 November 2021
Find square difference 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
Find and show on this page the least integer number n, where diffrence of n*n and (n-1)*(n-1) greater than 1000
The result is 5001 because 501*501 - 500*500 = 251001 - 250000 = 1001 > 1000
Python
<lang python> import math print("working...") limit1 = 6000 limit2 = 1000 oldSquare = 0 newSquare = 0
for n in range(limit1):
newSquare = n*n if (newSquare - oldSquare > limit2): print("Least number is = ", end = ""); print(int(math.sqrt(newSquare))) break oldSquare = n*n
print("done...") print() </lang>
- Output:
working... Least number is = 501 done...
Ring
<lang ring> load "stdlib.ring" see "working..." + nl limit1 = 6000 limit2 = 1000 oldPrime = 0 newPrime = 0
for n = 1 to limit1
newPrime = n*n if newPrime - oldPrime > limit2 see "Latest number is = " + sqrt(newPrime) + nl exit ok oldPrime = n*n
next
see "done..." + nl </lang>
- Output:
working... Latest number is = 501 done...