nidhis.1408 wrote:If n = 14,444, which of the following operations will not yield a number that is divisible by 11?
a. n - 1
b. n + 10
c. n - 100
d. n + 100,000
c. n - 100,000
Another approach. We can solve this question by first determining the remainder when 14,444 is divided by 11.
Here's one strategy: find a multiple of 11 that's close to (but less than) 14,444
Well, we know 11,000 is a multiple of 11.
Now subtract 11,000 from 14,444 to get 3444
Now find a multiple of 11 that's close to (but less than) 3444
Well, we know 3300 is a multiple of 11.
Now subtract 3300 from 3444 to get 144
Now find a multiple of 11 that's close to (but less than) 144
Well, we know 110 is a multiple of 11.
Now subtract 110 from 144 to get 34
Now find a multiple of 11 that's close to (but less than) 34
Well, we know 33 is a multiple of 11.
Now subtract 33 from 34 to get 1
Great, we now know that, when we divide 14,444 by 11, the remainder is 1.
IMPORTANT: We can now say that 14,444 = 11k + 1 for some integer value of k.
In other words,
n = 11k + 1 for some integer value of k.
Notice that we don't need to know the value of k here.
Okay, now let's check the answer choices:
A) n - 1
If n = 11k + 1, then n-1 = 11k
Since 11k is definitely divisible by 11, we can eliminate A.
B) n + 10
If n = 11k + 1, then n+10 = 11k + 11 = 11(k+1)
Since 11(k+1) is definitely divisible by 11, we can eliminate B.
C) n - 100
If n = 11k + 1, then n-100 = 11k - 99 = 11(k-9)
Since 11(k-9) is definitely divisible by 11, we can eliminate C.
D) n + 100,000
If n = 11k + 1, then n+100,000 = 11k + 100,001 = 11(k + 9091)
Since 11(k + 9091) is definitely divisible by 11, we can eliminate D.
This leaves us with answer choice E?
Are we going to check to see whether it's divisible by 11?
No. We don't have the luxury of time to do so.
Take
E and move on!
Cheers,
Brent