Search the web
Sign In
New User? Sign Up
4gmat · 4gmat - GMAT Online Preparation
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
hi everyone   Message List  
Reply | Forward Message #574 of 1636 |
Help: Counting digits problem!

Hi all,

            Can any body help me in generalizing the formula for the following?

 

a)       The number of 0’s written when you write 1 to 10000.

b)       The number of 1’s written when you write 1 to 10000.

c)       The number of 2’s written when you write 1 to 10000.

Please help me with this, how do we solve this kind of problems in less than a minute, any quick fix??

 

Thanks & Regards,

Rupesh



Fri Oct 6, 2006 8:21 am

rupniceguy
Offline Offline
Send Email Send Email

Forward
Message #574 of 1636 |
Expand Messages Author Sort by Date

hi everyone i want to know about the Powerprep cd whether it is available for GMAT like GRE Powerprep cd issued by ETS. if avialble, where u can get it???? ...
venki srini
venk07_in
Offline Send Email
Oct 6, 2006
8:11 am

Hi all, Can any body help me in generalizing the formula for the following? a) The number of 0's written when you write 1 to 10000. b) The number...
RUPESH KUMAR
rupniceguy
Offline Send Email
Oct 10, 2006
2:30 pm

Hello Rupesh! I think that is a combinatory approach to this kind of problem: a) Think first about numbers of 1 digit: "0" is writen *0 times* * *For...
Said Boufatis
frbsaid
Offline Send Email
Oct 13, 2006
2:20 pm

It's solved this way: let's take one case - number of 2's written from 1 to 10000. Since 10000 does not contain 2, so we have to consider numbers 1 to 9999. ...
Animesh Kumar
animeshkum
Offline Send Email
Oct 17, 2006
7:57 am
Advanced

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help