Find square difference

From Rosetta Code
Revision as of 16:00, 18 November 2021 by CalmoSoft (talk | contribs) (Created page with "{{Draft task}} ;Task:Find an show on this page the least integer number '''n''', where diffrence of '''n*n''' and '''(n-1)*(n-1)''' greater than '''1000''' <br><br> =={{hea...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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 an show on this page the least integer number n, where diffrence of n*n and (n-1)*(n-1) greater than 1000



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...