GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 19 Jun 2019, 00:08

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

# s(n) is a n-digit number formed by attaching the first n perfect

Author Message
TAGS:

### Hide Tags

Intern
Joined: 03 Feb 2014
Posts: 22
Location: United States
GMAT 1: 680 Q48 V35
WE: Operations (Manufacturing)
s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

Updated on: 30 Dec 2017, 01:51
3
5
00:00

Difficulty:

65% (hard)

Question Stats:

68% (03:16) correct 32% (03:06) wrong based on 155 sessions

### HideShow timer Statistics

s(n) is a n-digit number formed by attaching the first n perfect squares, in order, into one integer. For example, s(1) = 1, s(2) = 14, s(3) = 149, s(4) = 14916, s(5) = 1491625, etc. How many digits are in s(99)?

A. 350
B. 353
C. 354
D. 356
E. 357

Originally posted by cs2209 on 31 Jul 2014, 22:32.
Last edited by Bunuel on 30 Dec 2017, 01:51, edited 2 times in total.
Renamed the topic and edited the question.
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 9331
Location: Pune, India
Re: s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

31 Jul 2014, 22:46
4
1
cs2209 wrote:
s(n) is a n-digit number formed by attaching the first n perfect squares, in order, into one integer. For example, s(1) = 1, s(2) = 14, s(3) = 149, s(4) = 14916, s(5) = 1491625, etc. How many digits are in s(99)?

• 350
• 353
• 354
• 356
• 357

What is the best way to approach this problem?

Focus on the points where the number of digits in squares change:

1, 2, 3 - Single digit squares. First 2 digit number is 10.

4 , 5,...9 - Two digit squares. To get 9, the last number with two digit square, think that first 3 digit number is 100 which is 10^2. so 9^2 must be the last 2 digit square.

10, 11, 12, ... 31 - Three digit squares. To get 31, think of 1000 - the first 4 digit number. It is not a perfect square but 900 is 30^2. 32^2 = 2^10 = 1024, the first 4 digit square.

32 - 99 - Four digit squares. To get 99, think of 10,000 - the first 5 digit number which is 100^2.

So number of digits in s(99) = 3*1 + 6*2 + 22*3 + 68*4 = 3 + 12 + 66 + 272 = 353
_________________
Karishma
Veritas Prep GMAT Instructor

##### General Discussion
Intern
Joined: 04 Sep 2014
Posts: 1
Re: s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

04 Sep 2014, 19:27
Hi Karishma,

Can you please explain how you drove to the final evaluation - So number of digits in s(99) = 3*1 + 6*2 + 22*3 + 68*4 = 3 + 12 + 66 + 272 = 353

I'm not sure of how you got 3,6,22,68, etc.

V
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 9331
Location: Pune, India
Re: s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

04 Sep 2014, 20:26
fishfulthinking wrote:
Hi Karishma,

Can you please explain how you drove to the final evaluation - So number of digits in s(99) = 3*1 + 6*2 + 22*3 + 68*4 = 3 + 12 + 66 + 272 = 353

I'm not sure of how you got 3,6,22,68, etc.

V

First two digit number is 10 and first 2 digit square is 16. 16 is the square of 4. This means the first 3 numbers have a square which is a single digit.
First 3 digit number is 100 which is the square of 10. So numbers from 4 till 9 must have 2 digit squares. This gives us a total of 9-4+1 = 6 numbers
First 4 digit number is 1000 and first 4 digit square is 1024 (which is 2^10 or 32^2). So numbers from 10 to 31 must have 3 digit squares. This gives us a total of 31 - 10 + 1 = 22 numbers.
First 5 digit number is 10000 which is the square of 100. So numbers from 32 to 99 must have 4 digit squares. This gives us 99 - 32+1 = 68 numbers
_________________
Karishma
Veritas Prep GMAT Instructor

Current Student
Joined: 23 May 2013
Posts: 186
Location: United States
Concentration: Technology, Healthcare
GMAT 1: 760 Q49 V45
GPA: 3.5
Re: s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

18 Mar 2015, 08:19
1
We need to find the total number of digits in all of the square numbers from 1 - 99.

1, 4, 9 <-- all have one digit.
16, 25, 36, ...., 81 <-- all have two digits.

Each 'n' will acquire a new digit when n^2 exceeds a power of ten.

$$sqrt(10)$$ is more than 3 and less than 4, so n =1,2,3 will have 1 digit when you square n (1,4,9). This makes 3 numbers.
$$sqrt(100) = 10$$, so n = 4,5,6,7,8, and 9 will have two digits when you square n. (16, 25, ...,81). This makes 9 - 3 = 6 numbers.
$$sqrt(1000)$$ is more than 30 (30^2 = 900) and a quick check will show that $$31^2 = 961$$, while $$32^2 = 1024$$, so n = 10,11,...,31 will have 3 digits. This makes 31 - 9 = 22 numbers.
$$sqrt(10000) = 100$$, so all of the rest of the numbers from 32-99 will each have 4 digits. This makes 99-31 = 68 numbers.

Therefore, the total number of digits is 3(1) + 6(2) + 22(3) + 68(4) = 3 + 12 + 66 + 272 = 353.

Intern
Joined: 25 Mar 2015
Posts: 9
Schools: ISB '16
Re: s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

12 Sep 2015, 10:47
know the numbers wherein the count increases i.e at 10...all 3 digit squares come....at 31 all 4 digit squares come...till 99
so it is 18 digits till 10, next 21 numbers to go till 32, & lastly 68 numbers till 99...so 18+(21*3)+(68*4)=353
Math Expert
Joined: 02 Sep 2009
Posts: 55681
Re: s(n) is a n-digit number formed by attaching the first n perfect  [#permalink]

### Show Tags

30 Dec 2017, 01:54
cs2209 wrote:
s(n) is a n-digit number formed by attaching the first n perfect squares, in order, into one integer. For example, s(1) = 1, s(2) = 14, s(3) = 149, s(4) = 14916, s(5) = 1491625, etc. How many digits are in s(99)?

A. 350
B. 353
C. 354
D. 356
E. 357

VERITAS PREP OFFICIAL SOLUTION:

Since this exponent-based problem deals with massive numbers, the Guiding Principles of Exponents urge you to look for a pattern. We know that the first three squares (1, 4, 9) have one digit each. We know that the next six squares (16, 25, 36, 49, 64, and 81) have two digits each. Now we need to see when our squares have three digits and four digits, respectively.

We know that 10^2 = 100, which is the smallest number that has three digits. We know that 30^2 = 900, so we're still at three digits. 31^2 = 961, so that works too, but 32^2 will be put us over 1000. Hence the squares from 10 to 31 all have THREE digits.

100^2 = 10,000, which is the smallest number to have five digits, so 99^2 must have four. Hence all the squares from 32 to 99 must have four digits.

Now we just need to add all this up.

1^2 -> 3^2 have one digit each, so 3*1 = 3 total digits

4^2 -> 9^2 have two digits each, so 6*2 = 12 total digits

10^2 -> 31^2 have three digits each, so 22*3 = 66 total digits

32^2 -> 99^2 have four digits each, so 68*4 = 272 total digits

272 + 66 + 12 + 3 = 353, so that's our answer.
_________________
Re: s(n) is a n-digit number formed by attaching the first n perfect   [#permalink] 30 Dec 2017, 01:54
Display posts from previous: Sort by