Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 50002

If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
07 Sep 2015, 23:12
Question Stats:
87% (00:58) correct 13% (01:15) wrong based on 173 sessions
HideShow timer Statistics




Current Student
Joined: 05 Apr 2015
Posts: 393

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
08 Sep 2015, 01:50
Using divisibility rules on 13,333:
Sum of numbers in odd places(7)  sum of numbers in even places(6) = 1
Hence if we are 1 short of 13,333 the number becomes divisible by 11.
Hence A.
Regards, Dom.




Manager
Joined: 10 Aug 2015
Posts: 103

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
08 Sep 2015, 05:59
Solution : When 13,333 is divided by 11, the remainder is 1. So, n =1.
Option A



Manager
Joined: 13 Apr 2015
Posts: 74
Concentration: General Management, Strategy
GPA: 3.25
WE: Project Management (Energy and Utilities)

If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
08 Sep 2015, 08:36
Divisibility Rule for 11.
Add and subtract digits in an alternating pattern (add first digit, subtract second digit, add third digit.... so on). Then the answer must be either 0 or divisible by 11.
Eg  1364 = + 1  3 + 6  4 = 0, Therefore this no is divisible by 11.
Eg  3729 = + 3  7 + 2  9 = (  11 ), Therefore divisible by 11.
In this case 13,333 = 1 3 + 3  3 +3 = 1. If u notice 3 & + 3 will get canceled of, so u need to plug in values in this eq : 1  a + b to make it equal to zero. So plug in 3 & +2 .
No will be 13332 which is divisible by 11. And 13332 is 1 less that the original No.
Therefore Ans is A.
Yes it is a bit cummbersome process, but divisibility rule of 11 might help us better in some other question than here.
Alternate way is to check the reminder of 13333 / 11  which comes out be 1. There fore 1 is to be subtracted to make 13333 divisible by 11.



Intern
Joined: 12 Nov 2013
Posts: 40

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
08 Sep 2015, 13:22
Bunuel wrote: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
(A) 1 (B) 3 (C) 5 (D) 7 (E) 9
Kudos for a correct solution. Answer is A For a number to be divisible by 11, the absolute difference of the sum of odd place digits  even placed digits = 0 or divisible by 11 Here, sum of odd digits = 7, sum of even digits = 6 difference = 1 So if n = 1, the number is 13,332. Sum of odd placed digits become 6 So difference = 0.
_________________
Kindly support by giving Kudos, if my post helped you!



Current Student
Joined: 11 Jul 2015
Posts: 17
Location: United States
GMAT 1: 650 Q47 V32 GMAT 2: 710 Q46 V41
GPA: 3.4
WE: Supply Chain Management (Aerospace and Defense)

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
08 Sep 2015, 17:45
Divide 13,333 by 11. Result equals 1212 with a remainder of 1. Thus if you subtract 1 from 13,333 you will have a multiple of 11.
Looking at our answers, A matches.



Math Expert
Joined: 02 Sep 2009
Posts: 50002

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
13 Sep 2015, 07:53
Bunuel wrote: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
(A) 1 (B) 3 (C) 5 (D) 7 (E) 9
Kudos for a correct solution. VERITAS PREP OFFICIAL SOLUTION:Note that this doesn’t look like a remainder problem. It has some algebra to it – we’re solving for n, and what we know about n is based on an inequality presented in fairly abstract form. Your flashcards won’t label this as a remainder problem, but your problemsolving skills should. Before we solve for n, let’s talk about n. What is n in a conceptual sense? We know that if we subtract n from 13,333, then the resulting number is divisible by 11. Logically, then, we can make the leap that n needs to be taken off of 13,333 in order for it to be divisible by 11. Accordingly, n is the leftover portion of 13,333 when it is divided by 11 – it’s that last remaining portion that makes 13,333 not divisible by 11. So n, conceptually, is the remainder – it’s what’s left over when we try to make this division work. That logic we just used reverseengineers the concept of a remainder. We had to create it conceptually, but now that we know that n is just the remainder, this is now a division problem. If we take 13,333 and divide by 11, we end up taking off: 13,333 11,000 → 2,333 2,200 → 133 110 →23 22 → 1 The remainder is 1, and the correct answer is A (Note: because the problem only asked for the remainder – n – we didn’t need to bother with the quotient, so this problem can be done a little quicker with less hassle). Keep in mind here that the GMAT isn’t really testing your ability to calculate the remainder in a division problem; that ability is assumed. The GMAT does want to know whether you can take an asset – your ability to perform division problems – and find a way to use it to solve a uniquelooking problem. The division is just a vehicle for the GMAT to test your ability to reverseengineer a concept, to solve a problem using a familiar tool in an unfamiliar way.
To do so, yes, you must have that fundamental math ability, but that’s just the price of admission to showcase your reasoning skills on a problem like this. Your flashcards can’t teach you to do this; reading back through your notes can’t teach you to do this; you need to think analytically: what is the problem? How can I rephrase the question to make it better fit my knowledge base? Were the numbers different and easier to manage, how would I go about solving this, and therefore how can I apply it to this more complex situation? These are the thought processes that business schools want!
If you’re like the student described at the beginning of this article – if you’ve worked hard to build and polish your knowledge base with regard to GMAT content but have hit a plateau with your score – these are the things you need to master. When you study math skills, don’t merely learn them topdown, but ask yourself how the question could be flipped around to test it from another angle. Ask yourself if there are unique cases that might challenge your typical approach to a problem like this (what if there were no remainder? Could n be both 11 and 0?). Challenge yourself to think, and not just to remember.
While many tests you’ve taken could be beaten by what you remembered and what you knew, the GMAT cannot. It’s very nature as a reasoning test is to force you to think in unique ways from odd angles, and if you’ve hit that plateau of frustration with your scores, that’s when you need to challenge yourself not only to follow and remember instructions, but to be able to create them yourself.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Senior Manager
Joined: 06 Dec 2016
Posts: 250

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
06 Apr 2017, 10:05
You could even try proces elimination Let's look at answer A 13332/11 = 1101.
Therefore the answer is A. The other answers are incorrect.



NonHuman User
Joined: 09 Sep 2013
Posts: 8461

Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n?
[#permalink]
Show Tags
26 Sep 2018, 11:44
Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up  doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources




Re: If 13,333 – n is divisible by 11, and 0 < n < 11, what is n? &nbs
[#permalink]
26 Sep 2018, 11:44






