Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

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.

  • one year ago
  • one year ago

  • This Question is Closed
  1. frx
    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?

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

    I think yes.

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

    Hang on one sec..

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

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

    pic2 is the euclideam algorithm

    • one year ago
    • Attachments:

See more questions >>>

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.