A community for students.
Here's the question you clicked on:
 0 viewing
jhonyy9
 4 years ago
 for example :
(21) (21)
 +  +1 = 2
2 2
(31) (31)
 +  +1 =3
2 2
(51) (31)
 +  +1 = 2 +1 +1 =4
2 2
(51) (51)
 +  +1 = 2+2+1=5
2 2
can be this proven that is true for every natural numbers ?
jhonyy9
 4 years ago
 for example : (21) (21)  +  +1 = 2 2 2 (31) (31)  +  +1 =3 2 2 (51) (31)  +  +1 = 2 +1 +1 =4 2 2 (51) (51)  +  +1 = 2+2+1=5 2 2 can be this proven that is true for every natural numbers ?

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0can be do it by induction ?

EscherichiaRinku
 4 years ago
Best ResponseYou've already chosen the best response.0The difficult part here is probably getting a general formula. Then proving it by induction shouldn't be hard.

hoblos
 4 years ago
Best ResponseYou've already chosen the best response.1(a1) (a1) 2a 2  +  +1 =  +1 = a1+1 =a 2 2 2

hoblos
 4 years ago
Best ResponseYou've already chosen the best response.1this is true for any natural number

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0,,hoblos" yes i see it but this need to be proven

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so if we know that p and k are primes

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0 prove that for every n natural numbers grater or equal 2 exist one p and k numbers prim grater or equal 2 such that the below equation is true : (p1) (k1)  +  +1 = n 2 2

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0this was my previosly question

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so than p=2a+1 and k=2b+1

hoblos
 4 years ago
Best ResponseYou've already chosen the best response.1actually there exist more than one p & k such that the equation is true!! for example: if n=4 you may take (p=5 k=3) or (p=7 k=1) but there is one condition that must be satisfied which is n=(p+k)/2

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so but do you can prove it in one proning style ,method that is true for every natural numbers ?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0sorry proving stayle ,method

hoblos
 4 years ago
Best ResponseYou've already chosen the best response.1well.. i have only this method for now for all natural numbers p & k , there exist n such that (p1) (k1)  +  +1 = n => (p+k)/2 1+1=n => n=(p+k)/2 2 2

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0not right because if you see the first sentence of this exercise there is that p and k are prims

hoblos
 4 years ago
Best ResponseYou've already chosen the best response.1they dont have to be primes try p=6 k=4 and you will get n=5 the exercise is also stating that we have only one p&k while we have more than one!!

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0but is indifferent from this exercise p and k are prims
Ask your own question
Sign UpFind 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
 Engagement 19 Mad Hatter
 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.