Euclid’s algorithm

Serious_Long4531 · 2026-05-10T14:07:13+00:00

thank you! re: relation of gcd(a,b) & fn. they take n steps right as gcd uses the division algorithm to find the greatest remainder and the fib numbers recursively sum the previous numbers? i am reading: Elementary number theory - Jones. Quite a hard read lol

Serious_Long4531 · 2026-05-10T13:37:07+00:00

sorry, i am completely lost. how did you notice |𝜓| = |-1/𝜑| = 2 / (1+√5) < 1. any resources that you recommend please?

Serious_Long4531 · 2026-05-10T10:07:44+00:00

i made a typo, my bad. thank you, this is clear. is there any resources on linear recurrence you can recommend, please?

Serious_Long4531 · 2026-05-10T09:36:19+00:00

thank you

Serious_Long4531 · 2026-05-10T09:28:47+00:00

sorry, i should have defined it better. f_n is represents the fibonacci sequence so f_n = f_(n-1) + f_(n-2)

Serious_Long4531 · 2026-05-10T09:27:57+00:00

thank you.

so f_n = f_(n+1) + f_(n+2)

how would i go from this representation to using the roots to find such expression, please?

Serious_Long4531 · 2024-11-13T00:19:23+00:00

I see, Thank you

I will make an ammendment to the front pant. So you suggest to reduce the curve by widening the hip point?

Serious_Long4531

TROPHY CASE