Theorem: If a>b.ge.0 and the Euclid's algorithm uses k.ge.1 recursive

steps then a.ge.F(k+2) and b.ge.F(k)

where

F(0) = 0

F(1) = 1

F(i) = F(i-1) + F(i-2) for i.ge.2

Best

--

Hugo Scolnik

Sorry, an error occurred while loading the content.

Theorem: If a>b.ge.0 and the Euclid's algorithm uses k.ge.1 recursive

steps then a.ge.F(k+2) and b.ge.F(k)

where

F(0) = 0

F(1) = 1

F(i) = F(i-1) + F(i-2) for i.ge.2

Best

--

Hugo Scolnik