0

I'm attempting to solve this via induction

So for our base case let $k = 13$ then $x = 3, y = 1$ so the base case holds

Assume that for all $k$ where $ k \geq 13$ up to some integer $n$ that the claim holds s.t. they can all be written as some $2x + 7y$.

Where do I go from here?

ChuChugga
  • 13
  • 4
  • FYI, this is basically a special case of the Frobenius coin problem, with it stating that actually all integers $\ge 6$ can be written as $2x + 7y$ for some non-negative integers $x$ and $y$. – John Omielan Jun 19 '20 at 02:40

2 Answers2

0

If $k \ge 0$ is even, $k = 2 \cdot (k/2) + 7 \cdot 0$.

If $k \ge 7$ is odd, $k -7$ is even, so $k - 7 = 2 \cdot ((k-7)/2)$ and $k = 2 \cdot ((k-7)/2) + 7 \cdot 1$.

Robert Israel
  • 448,999
0

For an even number $z>13$ then let $y=0$ and then $x=z/2$. For an odd number $z>=13$ then let $y=1$ and then $x=(z-7)/2$

Χpẘ
  • 1,130
  • 6
  • 8