A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 4 years ago

- let p and k prims,p>=2 and k>=2, - let a and b natural numbers ,a>=1 and b>=1, prove that for every n>=2 exist one a=(p-1)/2 and b=(k-1)/2 such that this equation n=a+b+1 is true . -for example : 2=(2-1)/2 +(2-1)/2 +1 2= 1/2 +1/2 +1 2=1+1 2=2 or 3=(3-1)/2 +(3-1)/2 +1 3=1+1+1 3=3 or 4=(5-1)/2 +(3-1)/2 +1 4=2+1+1 4=4

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

    n = (p-1)/2 + (k-1)/2 +1 = (p+k)/2. Thus, what the question is actually asking is to prove that are always an infinite number of primes>2 such that the sum of any two of them is even.But this is obviously true as any prime>2 is odd and the sum of two odd numbers is always even.

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

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


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