Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

JoãoVitorMC

  • 2 years ago

Prove or disprove: For any integer n, the number n² + n + 1 is odd.

  • This Question is Closed
  1. AriPotta
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    i think that's true

  2. JoãoVitorMC
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i think that to but i have to prove some how

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

    5^2 + 5 +1 25 + 5 +1 = 31 (odd) 1^2 + 1 + 1 1 + 1 +1 = 3 (odd)

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

    so we just proved it

  5. jim_thompson5910
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    break it up into cases Case 1: If n is even,... Case 2: If n is odd,...

  6. AriPotta
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    i can't find any number that disproves it...

  7. jim_thompson5910
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    AriPotta you proved it works for those particular values, but you didn't prove it for all integers

  8. AriPotta
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    2^2 + 2 + 1 4 + 2 + 1 = 7 (odd)

  9. JoãoVitorMC
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ok i'll try using cases

  10. jim_thompson5910
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Case 1: n is an even integer Let k be any integer, so 2k is always even. Let n = 2k n^2 + n + 1 (2k)^2 + (2k) + 1 4k^2 + 2k + 1 2(2k^2 + k) + 1 2q + 1 ... Let q = 2k^2 + k (you can easily show that q is always an integer) So if n = 2k (ie if n is an even integer), then n^2 + n + 1 is equivalent to 2q + 1, which is an odd integer. I'll let you do case 2

  11. JoãoVitorMC
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    thank you!

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

    An even + an odd is an odd . an odd + odd is an even number, and an even + even is an even number. If n is odd n^2 is odd so we have an odd + odd + 1 which is the same as odd + even so it will be odd. If n is an even n^2 is even so n^2 +n will be even. If you add 1 to an even number it is odd. Aripotta has the right idea. Testing numbers works for odd and even in all cases.

  13. jim_thompson5910
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    np

  14. JoãoVitorMC
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    thank you all of you!

  15. 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.