- #1
FelixHelix
- 28
- 0
Stuck on this CW question. have been learing about Eulcidean Algorithm and Bezouts Identity but I'm at a complete loss.
Q: Prove by induction that if r[itex]_{n+1}[/itex] is the first remainder equal to 0 in the Euclidean Algorithm then r[itex]_{n+1-k}[/itex] [itex]\geq[/itex] f[itex]_{k}[/itex]
I know that proof by induction starts with a base step with n = 1; leading to the inductive step on n+1 but I'm struggling to even understand the question properly.
Any advice at all would be appreciated. The work is due in the morning :( and I can't find any examples like this on the web.
Please help
Felix
Q: Prove by induction that if r[itex]_{n+1}[/itex] is the first remainder equal to 0 in the Euclidean Algorithm then r[itex]_{n+1-k}[/itex] [itex]\geq[/itex] f[itex]_{k}[/itex]
I know that proof by induction starts with a base step with n = 1; leading to the inductive step on n+1 but I'm struggling to even understand the question properly.
Any advice at all would be appreciated. The work is due in the morning :( and I can't find any examples like this on the web.
Please help
Felix