In the first question, it’s specified not less than 200000 , and we are counting numbers less than this only? Why is it so , or either i didn’t understood the question .
Oops, thanks for catching it – it should have been “not greater than”. I’ve corrected it now! 🙂
I didn’t understand the second approach …using base method …please explain in little detail
If we are allowed only 2 digits, 0 and 1, then the numbers we write will be only “base 2” numbers, correct? So If I ask you how many numbers of up to 3 digits can be written using only 0 and 1, we could list them out as follows 1, 10, 11, 100, 101, 110, 111 i.e. 7 numbers in all. But we could also say, we just need to write all numbers till 111 (the largest 3-digit number) in base 2. Now 111 in base 2 is nothing but 7 in base ten so we would say 7 such numbers.
Similarly, if we had options of digits 0, 1, 2 and wanted to write numbers of up to 5 digits, then we could very well say we are writing numbers in base 3 (which uses digits 0, 1, 2) and the largest number is 22222. Now 22222 in base 3 translates to 242 in base 10, so we can say there will be 242 such numbers directly.
understood ..thanx a lot 🙂
Very good article .
In last question, the number formed is by using 0,7,8. Then also base 3 is considered. According to approach , base 3 can only be used when number formed is by 0,1,2( numbers less than base).
@incessant: Whether it is 0 1 2 or 0 8 7 or 0 3 4 what we need to notice is, we are making use of just 3 digits. And in the question we need to find the number of numbers that can be formed.
so the choice of numbers is not of importance, what is important is number of digits.
So even if you are using 0 8 7 it basically drops down to the fact that we are forming numbers with 3 digits and we know in base 3 we can have a maximum of 3 digits.
Third question is number between 0 and 1,000,000 right?.then
1 _ _ _ _ _ _
1(only zero)*3*3*3*3*3*3=3^6 ?
3^6 – 1 because you are also counting a case with all 0.
IF the last question had been 1,2 & 3 instead of 0, 5 & 6 , can we apply the same method ?
Yes, with suitable adjustments. Try it out with 2-digit and 3-digit numbers to get a feel of how it works, then extend it to 6 digits.
That’s a good method. Just out of curiosity, what do we do in case of a question like – How many numbers less than 50,000 can be formed using digits 1,2,3,4 and 5 ? How will we adjust 50,000 according to the base 5? Thanks.
Garima, in this case it would be simpler to just say 4 ways for 1st digit and 5 ways for each other = 4 * 5^4 = 2500 numbers. To go the base system route you would have to equate 0, 1, 2, 3, 4 with 1, 2, 3, 4, 5, and then say we wan’t number up to 40000 in base 5…could get confusing. We would use this kind of approach when the other methods get too messy, which isn’t the case here 🙂
Oh okay. Yes, that would get quite confusing!! Thanks for such a quick response.
Off the topic, but also wanted to say that your blog is really, really amazing. Do continue posting here, would love to find out more ways around the dreadful formulae 😀
So the base system method should be used only when possible digits while forming the number includes 0. Correct?
@shreya24 I would rather say, even when there is no 0, we would use it as a last resort if we can’t see an easier approach!
We will, but more infrequently, as and when we find something worth posting 🙂 Some nice way to circumvent a formula or to explain a concept…
In the last question why you have taken (222222)base 3. why n’t (1000000)base 3
Because no 7 digit can be formed.
Hi J! Regarding the approach of including 0 in each digit places and getting all the possible combinations(like the last sum), is it imperative that 0 has to be there in given set of usable digits? e.g. in the last question with 0,7,8 digits, what if there was 7,8 and a non-zero number? I tried introducing 0 as a dummy and finding the possible cases but there are too many extraneous solutions to be taken out in the end. Is this a valid way? If so, what would be the ideal approach for this method? And I did find a similar question in one of the older comments, but it wasn’t clear if he mentioned this method particularly, so I’m re-posting this doubt. Kindly help me out.
Then we would just do 3^6 + 3^5 + 3^4 + 3^3 + 3^2 + 3^1 (no minus required as there is no case to be eliminated). No need of elaborate contortions 🙂
A suggestion: try it out for a smaller case, say 2 digits. That will give you a feel for how it works. Once you grasp the pattern you can always extend it further!
You will find that with 0, 7, 8 you will get 7, 8, 70, 77, 78, 80, 87, 88 i.e. 8 cases (3^2 – 1). But for 3, 7, 8 it would be 3, 7, 8, 33, 37, 38, 73, 77, 78, 83, 87, 88 i.e. 12 numbers (3^2 + 3^1). Now try and figure out why (as in the underlying P&C behind the pattern)!
Thank you J, for such a quick reply! Yes. Got it. Introduction of a new 0 is not required, the problem is simple enough to be approached conventionally. And there is always a pattern I noticed. The number of solutions in each cases is in a G.P series. So need of listing out all the cases individually. Just the 1st term and number of terms is sufficient to find out the sum of the series!! Thanks a lot for the suggestion regarding the pattern recognition, this type of problems has become much simpler now!! 🙂
In the first question, why are we not considering 0 as a single digit number? The question asks about number not greater than 200000.
Because traditionally, the default for such questions is “natural numbers”. Else, we could include negative numbers or fractions or even irrationals and there would not be a finite answer!
Fill in your details below or click an icon to log in:
You are commenting using your WordPress.com account.
( Log Out /
You are commenting using your Google+ account.
( Log Out /
You are commenting using your Twitter account.
( Log Out /
You are commenting using your Facebook account.
( Log Out /
Connecting to %s
Notify me of new comments via email.