Saturday, July 27, 2019

induction - Prove that every natural number n>15 there exist natural numbers x,ygeqslant1 which solve the equation.


Prove that every natural number n>15 exist Natural numbers x,y1 which solve the equation 3x+5y=n.


so i try induction. base case is for n=16.



so gcd(5,3)=1, after Euclidean algorithm i found:


3(325t)+5(16+3t)=16 so i found that 325t>1c for x and 16+3t>1 for y and for t=6 x=2 and y=2 .


now suppose its takes place for n.


how i show that for n+1?


if there is more elegant way i would love to see.


Answer



For n=16, it is easy: 16=2×3+2×5.


Now, let nN{1,2,,14} and suppose that there are natural numbers x and y such that n=3x+5y. Then:


  • if y>1,n+1=3x+5y+1=3(x+2)+5(y1)and x+2,y1N.

  • Otherwise, n+1=3x+5+1=3x+6, for some natural number x and son+1=3(x3)+5×3.Note the x3N, sincen+1163x+6163x10and therefore, since xN, x4.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...