Which is the least possible integer greater than , which cannot be expressed in the form , where and are non-negative integers?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Short Solution:
A quick glance at the options shows that for 8 , y cannot be a non-negative integer (here, it is 3 1 ).
Complete Solution:
The number in question, when divided by 7 , must leave a whole number with a remainder divisible by 3 . We can convert the options like so:
1 5 ≡ 1 ( m o d 7 )
8 ≡ 1 ( m o d 7 )
1 1 ≡ 4 ( m o d 7 )
1 3 ≡ 6 ( m o d 7 )
Modular Arithmetic
From first glance, 1 5 , 8 , 1 1 do not satisfy the requirements. ( 1 3 is possible since 6 is divisible by 3 .) However, we also need to take all of these ( m o d 3 ) . Here we go:
1 5 ≡ 0 ( m o d 3 )
8 ≡ 2 ( m o d 3 )
1 1 ≡ 2 ( m o d 3 )
As can be seen, 1 5 is another possible choice (it can be made using 7 × 0 + 3 × 5 ). We are left with 1 1 and 8 . The smallest of them is 8 .
Alternatively, use the Postage Stamp Problem / Chicken McNugget Theorem . By direct application of it, we find that every number greater than 1 2 can be expressed in the form 7 x + 3 y . Of the options, we only have 8 and 1 1 left. We can then easily find that 8 is the correct answer.