SmartScore 99
SmartScore 86
SmartScore 92
Here's the question you clicked on:
frx
I need help to proof that fermat numbers always are relatively prime. I've got the lead that \[F_{m}|(F _{n}-2), ...where... m<n\] and that I should use the euclidean algorithm on that.
I do have the solution but I don't really get, should I post it?
I think yes.
Hang on one sec..
pic2 is the euclideam algorithm
Not the answer you are looking for?Search for more explanations.