Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

frx

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

    I think yes.

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

    Hang on one sec..

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

  5. frx
    • 2 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.

    Search OpenStudy
    • Attachments:

Ask your own question

Ask a Question
Find 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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.