Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

frx

  • 3 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
  1. frx
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I do have the solution but I don't really get, should I post it?

  2. sauravshakya
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I think yes.

  3. frx
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Hang on one sec..

  4. frx
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

  5. frx
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    pic2 is the euclideam algorithm

  6. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy