Last visit was: 19 Nov 2025, 11:02 It is currently 19 Nov 2025, 11:02
Close
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
Your Progress

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
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
samark
Joined: 26 Aug 2010
Last visit: 15 Oct 2011
Posts: 42
Own Kudos:
798
 [41]
Given Kudos: 18
Location: India
Concentration: Finance
Posts: 42
Kudos: 798
 [41]
10
Kudos
Add Kudos
31
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
Given Kudos: 99,977
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,309
 [11]
7
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
General Discussion
User avatar
bobfirth
Joined: 11 Nov 2011
Last visit: 10 Aug 2014
Posts: 7
Own Kudos:
63
 [2]
Given Kudos: 4
Posts: 7
Kudos: 63
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 18 Nov 2025
Posts: 4,145
Own Kudos:
10,988
 [1]
Given Kudos: 99
Expert
Expert reply
Posts: 4,145
Kudos: 10,988
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
bobfirth

1. & 2. SUFFICIENT y = 3 (the only prime number with an odd two digit result when raised to the 4th power)
therefore n is a multiple of 9, and the sum of the digits of all multiples of 9 is 9.

The sum of the digits of all multiples of 9 is divisible by 9. It is not generally equal to 9. For example, 99 is divisible by 9, and the sum of its digits is 18.

That turns out not to affect the solution here, however, since we are only concerned with two-digit numbers less than 99, and the sum of the digits of every multiple of nine between 18 and 90 inclusive is always 9.
avatar
Bowtie
Joined: 08 Sep 2011
Last visit: 03 May 2012
Posts: 28
Own Kudos:
27
 [1]
Given Kudos: 5
Concentration: Finance, Strategy
Posts: 28
Kudos: 27
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
+1 C

Stmt 1 tells you that y is a small prime integer because the square has to be lower than 99 and has to have a multiple lower than 99. This leaves us 3 and 5 but we. So insuff

stmt 2 tells us that y is 3 or less but is insuff by itself because the stem of the question does not say anything about y

together y = 3 and stmt 1 tells us that it is divisible by 9 and for something to be divisible by 9 the digits add up to 9.
User avatar
GMATNinja
User avatar
GMAT Club Verbal Expert
Joined: 13 Aug 2009
Last visit: 19 Nov 2025
Posts: 7,443
Own Kudos:
69,786
 [2]
Given Kudos: 2,060
Status: GMAT/GRE/LSAT tutors
Location: United States (CO)
GMAT 1: 780 Q51 V46
GMAT 2: 800 Q51 V51
GRE 1: Q170 V170
GRE 2: Q170 V170
Products:
Expert
Expert reply
GMAT 2: 800 Q51 V51
GRE 1: Q170 V170
GRE 2: Q170 V170
Posts: 7,443
Kudos: 69,786
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I think your conclusion is correct, harsh6239, though I'm pretty sure that this is an MGMAT question, and I found a slightly different version of it elsewhere:

What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.

So if we go with the version that specifies that y is prime, then...

Statement 1: y could be any number of primes, which means that n must be divisible by 4, 9, 25, or 49. And that really doesn't narrow things down very much. -- not sufficient

Statement 2: tells us absolutely nothing about n. -- not sufficient

Together: since we know that y is prime, then y^4 could be 16 or 81... except that y^4 has to be odd. So y^4 must be 81. And if n < 99, then n must also be 81.

The answer is C, and you were completely correct. :)
avatar
harsh6239
Joined: 30 Oct 2012
Last visit: 09 Mar 2017
Posts: 16
Own Kudos:
Given Kudos: 17
Location: United States
Concentration: General Management, Entrepreneurship
GMAT 1: 750 Q50 V40
WE:Science (Transportation)
Products:
GMAT 1: 750 Q50 V40
Posts: 16
Kudos: 1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
GMATNinja
I think your conclusion is correct, harsh6239, though I'm pretty sure that this is an MGMAT question, and I found a slightly different version of it elsewhere:

What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.

So if we go with the version that specifies that y is prime, then...

Statement 1: y could be any number of primes, which means that n must be divisible by 4, 9, 25, or 49. And that really doesn't narrow things down very much. -- not sufficient

Statement 2: tells us absolutely nothing about n. -- not sufficient

Together: since we know that y is prime, then y^4 could be 16 or 81... except that y^4 has to be odd. So y^4 must be 81. And if n < 99, then n must also be 81.

The answer is C, and you were completely correct. :)


Thank you sir for your reply. The slightly different version of question which you have given here states that y is a prime and hence an integer. My confusion in the original question which I had posted is that if we see statement 2 then y^4 is equal to a two digit odd integer and so y need not be an integer always. so going back to statement 1 then y^2 may be a fraction and not necessarily 9. In this case answer will be E. How to confirm this one mathematically ?
User avatar
GMATNinja
User avatar
GMAT Club Verbal Expert
Joined: 13 Aug 2009
Last visit: 19 Nov 2025
Posts: 7,443
Own Kudos:
69,786
 [2]
Given Kudos: 2,060
Status: GMAT/GRE/LSAT tutors
Location: United States (CO)
GMAT 1: 780 Q51 V46
GMAT 2: 800 Q51 V51
GRE 1: Q170 V170
GRE 2: Q170 V170
Products:
Expert
Expert reply
GMAT 2: 800 Q51 V51
GRE 1: Q170 V170
GRE 2: Q170 V170
Posts: 7,443
Kudos: 69,786
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
OK, so if we're going with your version...

Quote:
What is the sum of the digits of the positive integer n where n<99 ?

1) n is divisible by the square of y.

2) y*y*y*y (y raised to the power 4) is equal to a two digit positive odd integer.

Statement 1: We don't even know that y is an integer, so the square of y could be anything... which means that n could be anything, too. (The square of y could, for example, be 1.) -- incredibly insufficient

Statement 2: We don't know that y is an integer, so y^4 could be any two-digit positive odd integer... and that gives us 45 possible values for y^4, most of which are not integers. And the statement says absolutely nothing about n. -- still incredibly insufficient

Together: y^4 could be any two-digit odd integer, which means that we have tons of possible values for y^2, including 5, 7, and 9. N could then be any multiple of 5, 7, or 9. -- still not sufficient

So in the version without the phrase "prime number" in statement 1, the answer would definitely be E.
avatar
Arvars
Joined: 21 Oct 2012
Last visit: 27 Nov 2012
Posts: 10
Own Kudos:
40
 [3]
Given Kudos: 16
Posts: 10
Kudos: 40
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
samark
What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.


Statement 1 : Square of prime number less than 99 leaves us with 3,5,7,9 (Not sufficient)

Statement 2 : y^4 is a two digit odd integer (Not sufficient)

But when we combine both the we are left only with y=3 and the n is divisible by 9, so we get a unique answer which also 9

Answer : C
User avatar
TooLong150
Joined: 10 Mar 2013
Last visit: 07 Feb 2022
Posts: 135
Own Kudos:
Given Kudos: 2,412
GMAT 1: 620 Q44 V31
GMAT 2: 610 Q47 V28
GMAT 3: 700 Q49 V36
GMAT 4: 690 Q48 V35
GMAT 5: 750 Q49 V42
GMAT 6: 730 Q50 V39
GPA: 3
Products:
GMAT 6: 730 Q50 V39
Posts: 135
Kudos: 536
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bowtie
+1 C

Stmt 1 tells you that y is a small prime integer because the square has to be lower than 99 and has to have a multiple lower than 99. This leaves us 3 and 5 but we. So insuff

stmt 2 tells us that y is 3 or less but is insuff by itself because the stem of the question does not say anything about y

together y = 3 and stmt 1 tells us that it is divisible by 9 and for something to be divisible by 9 the digits add up to 9.

I think your conclusion to (1) is incomplete. y could also = 7, because (7^2)*2 = 98, which is < 99.
User avatar
stonecold
Joined: 12 Aug 2015
Last visit: 09 Apr 2024
Posts: 2,244
Own Kudos:
3,549
 [1]
Given Kudos: 893
GRE 1: Q169 V154
GRE 1: Q169 V154
Posts: 2,244
Kudos: 3,549
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Fun Property of first ten multiples 9 ->
09
18
27
36
45
54
63
72
81
90

The units digit is increasing by 1 and units digit is decreasing by 1=> Sum of digits remain the same =9

From 1 and 2 => y must be 3
Hence x must be a multiple of 9 between 0 and 99
Hence sum of its digits must be 9


Hence C
User avatar
sb0541
Joined: 13 Apr 2010
Last visit: 14 Feb 2022
Posts: 62
Own Kudos:
Given Kudos: 16
Products:
Posts: 62
Kudos: 55
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Nahid078
What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of y.
(2) y^4 is a two-digit positive odd integer.


From Statement 1, n is divisible by square of y .
y can be 1 , 4 , 9, 16 ...
Clearly Insufficient .

From Statement 2 , Y^4 is a two digit positive odd integer
y^4 = 81 => y = 3
No information on n .
So, statement is Insufficient .

Combine , we know that sum of digits of n is equal to 9 .
Answer is C .
User avatar
gps5441
Joined: 04 May 2014
Last visit: 03 Feb 2018
Posts: 106
Own Kudos:
Given Kudos: 126
Location: India
WE:Sales (Mutual Funds and Brokerage)
Posts: 106
Kudos: 81
Kudos
Add Kudos
Bookmarks
Bookmark this Post
n<99 or n can be any of the following no 98, 97......1

Statement 1- n is divisible by the square of the prime number y

Prime nos 2, 3, 5, 7, 11.....

Square of prime 4, 9, 25, 49, 121- n can be divisible by any of the above prime nos till 7-since n<99

Statement-2-y⁴ is a two-digit odd integer- what is y-No information hence statement is not sufficient

Statement 1 and 2. y is prime-y² divides n and y⁴ is a 2 digit odd no.

Test the nos
2-is even
3-3²=9 and 3⁴=81=odd.
Hence the no is divisible by 9 and any no is divisible by 9 if its sum must be divisible by 9. since n<99 the n is a 2 digit no whose sum=9(18, 27, 36, 72, 81)
avatar
masoomjnegi
Joined: 20 Dec 2018
Last visit: 12 Mar 2019
Posts: 33
Own Kudos:
Posts: 33
Kudos: 7
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Statement 1. N = ay2 (y is a prime number)
N has different value for y = 3, 5, 7 etc. Hence, Insufficient.
Statement 2. y4 is a two digit odd integer.
y= 3.
But we don’t know the relation between ‘n’ and ‘y’ in statement 2. Hence, Insufficient.
Statement 1 & 2 together. Using the results of statement 1 and 2, we get,
n = ay2 and y = 3
n = 9a
So, n is a no divisible by 9. Any two digit no divisible by 9 has sum of its digits = 9.
Hence, Sufficient.
avatar
BussinesArtist
Joined: 19 Jan 2018
Last visit: 09 May 2020
Posts: 8
Own Kudos:
Given Kudos: 10
Location: India
GMAT 1: 650 Q46 V34
GPA: 4
GMAT 1: 650 Q46 V34
Posts: 8
Kudos: 1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
samark
What is the sum of the digits of the positive integer n where n < 99?

1) n is divisible by the square of the prime number y.

2) y4 is a two-digit odd integer.

What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y --> clearly insufficient, as no info about y.

2) y^4 is a two-digit odd integer --> also insufficient, as no info about n, but from this statement we know that if y is an integer then y=3 (y must be odd in order y^4 to be odd and it cannot be less than 3 or more than 3 since 1^4 and 5^4 are not two digit numbers).

(1)+(2) Since from (1) y=integer then from (2) y=3, so n is divisible by 3^2=9. Number to be divisible by 9 sum of its digits must be multiple of 9, as n is two-digit number <99 then the sum of its digits must be 9 (18, 27, 36, ..., 90.). Suffiicient.

Answer: C.

Hello,
Thanks for all your responses and help as it is a great help for preparations

I figured out a flaw here , may be I am wrong but I needed your opinion.

The question only says that n is a positive integer and doesnot says anything about y,
I marked the answer "E".
As per all comments, we can see that 9 is happening to be the sum.
considering y is 3 , but since there is no mentioning of Y, it can be a -ve , fraction or decimal.
I took y as √7 then y raised to 4th power becomes 49.

So, this made me mark E.

Please could you tell me where did I go wrong.

Always thankful to you for your explanations.

Thanks
Harshit
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
Given Kudos: 99,977
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,309
Kudos
Add Kudos
Bookmarks
Bookmark this Post
BussinesArtist
Bunuel
samark
What is the sum of the digits of the positive integer n where n < 99?

1) n is divisible by the square of the prime number y.

2) y4 is a two-digit odd integer.

What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y --> clearly insufficient, as no info about y.

2) y^4 is a two-digit odd integer --> also insufficient, as no info about n, but from this statement we know that if y is an integer then y=3 (y must be odd in order y^4 to be odd and it cannot be less than 3 or more than 3 since 1^4 and 5^4 are not two digit numbers).

(1)+(2) Since from (1) y=integer then from (2) y=3, so n is divisible by 3^2=9. Number to be divisible by 9 sum of its digits must be multiple of 9, as n is two-digit number <99 then the sum of its digits must be 9 (18, 27, 36, ..., 90.). Suffiicient.

Answer: C.

Hello,
Thanks for all your responses and help as it is a great help for preparations

I figured out a flaw here , may be I am wrong but I needed your opinion.

The question only says that n is a positive integer and doesnot says anything about y,
I marked the answer "E".
As per all comments, we can see that 9 is happening to be the sum.
considering y is 3 , but since there is no mentioning of Y, it can be a -ve , fraction or decimal.
I took y as √7 then y raised to 4th power becomes 49.

So, this made me mark E.

Please could you tell me where did I go wrong.

Always thankful to you for your explanations.

Thanks
Harshit

(1) says: n is divisible by the square of the prime number y
avatar
Mohammad Ali Khan
Joined: 11 Aug 2017
Last visit: 04 Sep 2019
Posts: 48
Own Kudos:
Given Kudos: 92
Posts: 48
Kudos: 20
Kudos
Add Kudos
Bookmarks
Bookmark this Post
GMATNinja
I think your conclusion is correct, harsh6239, though I'm pretty sure that this is an MGMAT question, and I found a slightly different version of it elsewhere:

What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.

So if we go with the version that specifies that y is prime, then...

Statement 1: y could be any number of primes, which means that n must be divisible by 4, 9, 25, or 49. And that really doesn't narrow things down very much. -- not sufficient

Statement 2: tells us absolutely nothing about n. -- not sufficient

Together: since we know that y is prime, then y^4 could be 16 or 81... except that y^4 has to be odd. So y^4 must be 81. And if n < 99, then n must also be 81.

The answer is C, and you were completely correct. :)


[color=#9e0039]How can it be inferred that n has to 81. S2 only confirms that y=3 , and if we apply it in S1 then we can say denom. has to be 9 but nothing is clear about numer. can be 9,18,27 ?? please guide
User avatar
CareerGeek
Joined: 20 Jul 2017
Last visit: 19 Nov 2025
Posts: 1,292
Own Kudos:
4,271
 [1]
Given Kudos: 162
Location: India
Concentration: Entrepreneurship, Marketing
GMAT 1: 690 Q51 V30
WE:Education (Education)
GMAT 1: 690 Q51 V30
Posts: 1,292
Kudos: 4,271
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Mohammad Ali Khan
GMATNinja
I think your conclusion is correct, harsh6239, though I'm pretty sure that this is an MGMAT question, and I found a slightly different version of it elsewhere:

What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.

So if we go with the version that specifies that y is prime, then...

Statement 1: y could be any number of primes, which means that n must be divisible by 4, 9, 25, or 49. And that really doesn't narrow things down very much. -- not sufficient

Statement 2: tells us absolutely nothing about n. -- not sufficient

Together: since we know that y is prime, then y^4 could be 16 or 81... except that y^4 has to be odd. So y^4 must be 81. And if n < 99, then n must also be 81.

The answer is C, and you were completely correct. :)


[color=#9e0039]How can it be inferred that n has to 81. S2 only confirms that y=3 , and if we apply it in S1 then we can say denom. has to be 9 but nothing is clear about numer. can be 9,18,27 ?? please guide

mohammad Ali Khan

You are right that combining both n can take all multiples values of square of number 3 which are 9,18, 27, 36, 45, 54, 63, 72, 81, 90.

But the question is sum of digits of n which is ALWAYS 9 for any of the above possible values. That’s why the answer is C

Hope it’s clear.

Posted from my mobile device
User avatar
Archit3110
User avatar
Major Poster
Joined: 18 Aug 2017
Last visit: 19 Nov 2025
Posts: 8,422
Own Kudos:
Given Kudos: 243
Status:You learn more from failure than from success.
Location: India
Concentration: Sustainability, Marketing
GMAT Focus 1: 545 Q79 V79 DI73
GMAT Focus 2: 645 Q83 V82 DI81
GPA: 4
WE:Marketing (Energy)
GMAT Focus 2: 645 Q83 V82 DI81
Posts: 8,422
Kudos: 4,982
Kudos
Add Kudos
Bookmarks
Bookmark this Post
samark
What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.

good question
#1
n is divisible by the square of the prime number y
y can be 2,3,5,7 many possiblities
#2
y^4 is a two-digit odd integer
y=2,3 again we have many values of n
from 1 &2
y=3 ; y^2 = 9 and sum of digits divisible by 9 has sum of digits =9
IMO C
User avatar
AVMachine
Joined: 03 May 2024
Last visit: 26 Aug 2025
Posts: 190
Own Kudos:
Given Kudos: 40
Posts: 190
Kudos: 154
Kudos
Add Kudos
Bookmarks
Bookmark this Post
samark
What is the sum of the digits of the positive integer n where n < 99?

(1) n is divisible by the square of the prime number y.
(2) y^4 is a two-digit odd integer.
1. Prime no divisor, 2 - 4; 3 - 9; 5 - 25; 7 - 49; 11 - 121 (More then 99)

As per statement one, there could be four values of n, which is insufficient.

2. As y has only been mentioned in the first statement not in the main paragraph hence alone this statement is not sufficient.

1&2: With this y^4 can only be possible for 2 and 3, and out of these two primes, only three will result odd no. Sufficient.
Moderators:
Math Expert
105390 posts
496 posts