Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 03 Feb 2014
Posts: 25
Location: United States
WE: Operations (Manufacturing)

s(n) is a ndigit number formed by attaching the first n perfect [#permalink]
Show Tags
31 Jul 2014, 22:32
3
This post received KUDOS
5
This post was BOOKMARKED
Question Stats:
66% (02:39) correct 34% (02:28) wrong based on 144 sessions
HideShow timer Statistics
s(n) is a ndigit 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
Official Answer and Stats are available only to registered users. Register/ Login.
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: 8003
Location: Pune, India

Re: s(n) is a ndigit number formed by attaching the first n perfect [#permalink]
Show Tags
31 Jul 2014, 22:46
4
This post received KUDOS
Expert's post
1
This post was BOOKMARKED
cs2209 wrote: s(n) is a ndigit 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)? 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 My Blog
Get started with Veritas Prep GMAT On Demand for $199
Veritas Prep Reviews



Intern
Joined: 04 Sep 2014
Posts: 1

Re: s(n) is a ndigit 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.
Thanks in advance.
V



Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 8003
Location: Pune, India

Re: s(n) is a ndigit 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.
Thanks in advance.
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 94+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 My Blog
Get started with Veritas Prep GMAT On Demand for $199
Veritas Prep Reviews



Current Student
Joined: 23 May 2013
Posts: 189
Location: United States
Concentration: Technology, Healthcare
GPA: 3.5

Re: s(n) is a ndigit number formed by attaching the first n perfect [#permalink]
Show Tags
18 Mar 2015, 08:19
1
This post was BOOKMARKED
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 3299 will each have 4 digits. This makes 9931 = 68 numbers.
Therefore, the total number of digits is 3(1) + 6(2) + 22(3) + 68(4) = 3 + 12 + 66 + 272 = 353.
Answer: B.



Intern
Joined: 25 Mar 2015
Posts: 9

Re: s(n) is a ndigit 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: 44423

Re: s(n) is a ndigit number formed by attaching the first n perfect [#permalink]
Show Tags
30 Dec 2017, 01:54
cs2209 wrote: s(n) is a ndigit 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 exponentbased 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.
_________________
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




Re: s(n) is a ndigit number formed by attaching the first n perfect
[#permalink]
30 Dec 2017, 01:54






