Hey, i have a problem with a certain exercise : Company ships sandwiches in boxes of 3 or 5 each. Use induction to prove that every number of sandwiches above 7 can be shipped in only full boxes of 3 or 5.
So I started by Base Induction :
for n = 8 8 = 5*1 + 3*1 so it's true.
I can't figure out the Step Induction, but i started to write every number as 3*k + 5*l and what i observed is that every number above 7 can be written like this :
8,11,14.... 3n + 5 = 3(n+1) + 2 , n>=1
9,12,15.... 3(n+2) , n>=1
10,13,16... 3(n+2) + 1, n>=1
I'd really appreciate any hints on this matter as I am clueless. Sorry for any mistakes, as seen above English isn't my native language.
So I started by Base Induction :
for n = 8 8 = 5*1 + 3*1 so it's true.
I can't figure out the Step Induction, but i started to write every number as 3*k + 5*l and what i observed is that every number above 7 can be written like this :
8,11,14.... 3n + 5 = 3(n+1) + 2 , n>=1
9,12,15.... 3(n+2) , n>=1
10,13,16... 3(n+2) + 1, n>=1
I'd really appreciate any hints on this matter as I am clueless. Sorry for any mistakes, as seen above English isn't my native language.