A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
 2 years ago
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.
 2 years ago
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.

This Question is Closed

frx
 2 years ago
Best ResponseYou've already chosen the best response.0I do have the solution but I don't really get, should I post it?

frx
 2 years ago
Best ResponseYou've already chosen the best response.0pic2 is the euclideam algorithm
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.