Last visit was: 21 Apr 2026, 00:40 It is currently 21 Apr 2026, 00:40
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
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Apr 2026
Posts: 109,715
Own Kudos:
Given Kudos: 105,795
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,715
Kudos: 810,324
 [12]
1
Kudos
Add Kudos
11
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Apr 2026
Posts: 109,715
Own Kudos:
810,324
 [1]
Given Kudos: 105,795
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,715
Kudos: 810,324
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
General Discussion
User avatar
paragw
Joined: 17 May 2024
Last visit: 16 Apr 2026
Posts: 189
Own Kudos:
193
 [1]
Given Kudos: 38
Posts: 189
Kudos: 193
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
adityamntr
Joined: 15 Jul 2023
Last visit: 21 Feb 2026
Posts: 111
Own Kudos:
81
 [1]
Given Kudos: 13
Location: India
Concentration: General Management, Strategy
Posts: 111
Kudos: 81
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
p is a prime number
it can only be an odd number since p > 10
so all possible odd remainders will be the answer
1 3 5 7 9 11 13 15 17
answer is 9
avatar
ManifestDreamMBA
Joined: 17 Sep 2024
Last visit: 21 Feb 2026
Posts: 1,387
Own Kudos:
897
 [1]
Given Kudos: 243
Posts: 1,387
Kudos: 897
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
No factor p such that 1 < p < generated number, means the number is prime

Possible remainders when 18 divides a number 0<=r<18

Given prime greater than 10 are considered, and 18 is even, the remainder cannot be even

So 0,2,4,6,8,10,12,14,16 are out
1,3,5,7,9,11,13,15,17 remains

Now if something has a remainder of 3 or 9 or 15 then they will be of the form 18k+3 => 3(6k+1) or 18k+9 => 9(2k+1) or 18K + 15 => 3(6k+5). Now this makes the number have 3 and 9 as factors, so these are out too.

Remaining 1,5,7,11,13,17

So 6 possible remainders

Answer D
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more
User avatar
luisdicampo
Joined: 10 Feb 2025
Last visit: 19 Apr 2026
Posts: 480
Own Kudos:
Given Kudos: 328
Products:
Posts: 480
Kudos: 73
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more
[Deconstructing the Question
The problem defines the generated numbers as integers greater than 10 that have "no factor \(p\) such that \(1 < p < \text{number}\)".
This is the definition of a Prime Number.
So, we are looking for the possible remainders when a prime number \(n > 10\) is divided by 18.

Step 1: Properties of Primes > 10
Let the prime be \(n\). Since \(n > 10\), \(n\) cannot be even (otherwise it's divisible by 2).
Since \(n > 10\), \(n\) cannot be a multiple of 3 (otherwise it's divisible by 3).
The divisor is \(18 = 2 \times 3^2\).
Since \(n\) shares no factors with 18, \(n\) and 18 are coprime (\(gcd(n, 18) = 1\)).

Step 2: Analyze Remainders
If \(n\) is coprime to 18, the remainder \(r\) must also be coprime to 18.
The possible remainders modulo 18 are integers from 0 to 17. We must exclude all even numbers and all multiples of 3.
Let's list the candidates:
1 (Coprime) * 2, 3, 4 (Share factors with 18)
5 (Coprime) * 6 (Shares factors)
7 (Coprime) * 8, 9, 10 (Share factors)
11 (Coprime) * 12 (Shares factors)
13 (Coprime) * 14, 15, 16 (Share factors)
17 (Coprime) The set of possible distinct remainders is {1, 5, 7, 11, 13, 17}.

Step 3: Verification
Do primes exist for these remainders?
\(19 \equiv 1 \pmod{18}\)
\(23 \equiv 5 \pmod{18}\)
\(43 \equiv 7 \pmod{18}\)
\(11 \equiv 11 \pmod{18}\)
\(13 \equiv 13 \pmod{18}\)
\(17 \equiv 17 \pmod{18}\)
All are valid primes > 10.

Total count: 6.

Answer: D
User avatar
jefferyillman
Joined: 01 Dec 2024
Last visit: 20 Apr 2026
Posts: 50
Own Kudos:
Given Kudos: 3
Posts: 50
Kudos: 27
Kudos
Add Kudos
Bookmarks
Bookmark this Post
9. Number of remainders for divisor 18 is 0 to 17 remainder. Numbers starts at greater than 10. Must repeat remainders after 18. 18 has remainder of zero
User avatar
sharmayogeeta
Joined: 02 Jan 2025
Last visit: 12 Apr 2026
Posts: 22
Own Kudos:
20
 [1]
Given Kudos: 14
Location: India
Posts: 22
Kudos: 20
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The program essentially throws out prime number greater than 10.
These numbers are all odd, therefore on division with 18, they will leave odd remainder.
Therefore possible remainders = {1,3,5,7,...17} = 9 in number
However, since they are all prime, they cannot leave multiple of 3 as remainder,
since if say 3 is a remainder of n, then n = 18q+3 which is a multiple of 3 and not a prime.
So removing 3,9 and 15 from list of 9 remainders, we are left with 6 remainders.
User avatar
MANASH94
Joined: 25 Jun 2025
Last visit: 11 Apr 2026
Posts: 88
Own Kudos:
63
 [1]
Given Kudos: 16
Location: India
Schools: IIM IIM ISB
GPA: 2.9
Schools: IIM IIM ISB
Posts: 88
Kudos: 63
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Any number greater than 10 has no factor p means it should be a prime number.
Now prime numbers from 11 onwards are:
11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61,....
When divided by 18 these yields remainder of:
11, 13, 17, 1, 5, 11, 13, 1, 5, 7, 11, 17,....
Seems only six of them are repeating.

OR

any number beyond 10 will have maximum of remainders: 1, 2, 3, 4, ....., 17.
Since the numbers from 1-17 will have multiples of 2 and 3 we can remove them because they cannot be remainders of prime.
So we are left with: 1, 5, 7, 11, 13, 17.

Hence: D
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more
User avatar
truedelulu
Joined: 01 Sep 2025
Last visit: 24 Jan 2026
Posts: 81
Own Kudos:
70
 [1]
Given Kudos: 16
Products:
Posts: 81
Kudos: 70
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
So we know that the computer program is generating prime numbers greater than 10.
Since the number is prime number and the program divides it by 18 (18=2*3^2), the remainder must be less than 18 and not divisible by 2 or 3.
=> The remainder: 1,5,7,11,13,17

Answer: D
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more
User avatar
sitrem
Joined: 19 Nov 2025
Last visit: 24 Feb 2026
Posts: 91
Own Kudos:
84
 [1]
Given Kudos: 238
Posts: 91
Kudos: 84
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Answer D
The definitions of the number generated (let's call it n) tells us that each number generated n is a prime number (since it does not have any factor ≠ 1 or ≠ n), it also tells us that n > 10, so n could be any prime number greater than 10
n=x*18 + remainder=x(2*3^2) + remainder

if n/18 gave a remainder that is an even number this would mean that n is even, but it cannot be, since n is a prime number. (eg 20/18 -> remainder 2, 34/18 -> remainder 16)
if n/18 gave a remainder that is a multiple of 3 this would mean that n is a multiple of 3, but it cannot be.

Since n is a positive integer, the remainder must be an integer >= 1 and <18.
If from all those numbers we eliminate all even number and all multiples of 3, there are 6 numbers left: 1, 5, 7, 11, 13, 17
User avatar
forestmayank
Joined: 05 Nov 2025
Last visit: 31 Mar 2026
Posts: 103
Own Kudos:
87
 [1]
Given Kudos: 6
Posts: 103
Kudos: 87
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If the number is greater than 10 with the condition that p is not a factor of 1<p<generated number.
considering that p is given as a variable and could be any lower number that could divide the generated number unless the generated number is prime. In that case there would be no number greater than 1 but smaller than the generated number that could divide it.

Hence the generated number is a prime number greater than 10.

Now the prime greater than 10 would be 11, 13, 17, 19, 23, 29, 31, 37, 41, 43 and so on.

Dividing these with 18 would give remainders as 11, 13, 17, 1, 5, 11, 13, 1, 5, 7 and so on. The list includes 1 and all the prime numbers smaller than 18 except 3.

Considering the fact that each prime number greater than 3 is of the form (multiple of 6 + 1) OR (multiple of 6 - 1), 3 cannot be the remainder as 18 is also a multiple of 6.

Hence, the list highlighted above is complete and there are only 6 such remainders. Answer is D.
User avatar
Archit3110
User avatar
Major Poster
Joined: 18 Aug 2017
Last visit: 20 Apr 2026
Posts: 8,625
Own Kudos:
5,190
 [1]
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)
Products:
GMAT Focus 2: 645 Q83 V82 DI81
Posts: 8,625
Kudos: 5,190
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?
A. 3
B. 4
C. 5
D. 6
E. 9

the condition of have no factor 1<p< the generated number is possible only when generated number is prime
possible numbers generated
11,13,17,19,23,27,29,31,37 so on...
remainders distinct possible when 18 is divided to generated numbers ( 11,13,17,19,23,27,29,31,37)

11,13,17,1,5,7

6 possible distinct remainders

OPTION D , 6 is correct
User avatar
hershehy
Joined: 28 Jul 2025
Last visit: 20 Apr 2026
Posts: 24
Own Kudos:
18
 [1]
Given Kudos: 5
Posts: 24
Kudos: 18
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IMO D

The program generates positive integers greater than 10 with no factors other than 1 and itself that means we are looking for prime numbers greater than 10.

We are asked how many distinct remainders while dividing from 18 such primes can produce.

prime number>10 are 11, 13, 17, 19, 23, ... so on basicalaly.

we also need to know that since 18 has factors 2,3,3. Remainders cannot share factor with it, so we are only left with all other remainders that are prime, <18 and not 2,3.

those are 1,5,7,11,13,17. After this it will repeat, so 6 is the correct answer.
User avatar
Sumimasen
Joined: 21 Jan 2024
Last visit: 20 Apr 2026
Posts: 36
Own Kudos:
33
 [1]
Given Kudos: 11
Products:
Posts: 36
Kudos: 33
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
A number (N) which has no factor p such that 1<p<N will always be a prime number.
Given N>10. All prime numbers will always be odd numbers.
If we divide N by 18 then remainder (r) can only be 0 to 17.
N=18k + r, here N is odd, 18k is even. N can be odd only when r is also odd. (Odd=Even+Odd)
r can be 1,3,5,7,9,11,13,15,17.
Because N is a prime number so 18k and r should also be coprime to each other.
Hence, r must be 1,5,7,11,13,17
Answer is 6 (D)
User avatar
arushi118
Joined: 21 Jul 2024
Last visit: 19 Apr 2026
Posts: 267
Own Kudos:
76
 [1]
Given Kudos: 894
Location: India
Concentration: Leadership, General Management
GPA: 8.2/10
Products:
Posts: 267
Kudos: 76
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
We know:
-- that remainder will have to be lesser than 18
-- P is a prime number

p = 18x + r (x is an integer and r is the remainder)
Now r cannot be a multiple of 2 because if it is a multiple of 2 then:
p = 18x + 2R -> 2(9x + R) -> this will mean that p can be divided by 2 which should not be the case as p = 2 not possible (p>10) and p is a prime number.

r can also not be a multiple of 3 as if it is a multiple of 3:
p = 18x + 3R -> 3(6x + R) -> this will mean that p is divisible by 3 but that is not possible as p is prime and more than 10.

So possible values of r which are less than 18, odd, not multiples of 3 -> 1, 5, 7, 11, 13, 17

So, 6 values. (Answer is D)
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 20 Apr 2026
Posts: 5,985
Own Kudos:
5,855
 [1]
Given Kudos: 163
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
GMAT 1: 690 Q50 V34
Posts: 5,985
Kudos: 5,855
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Positive integers greater than 10 that have no factor p such that 1 < p < the generated number; means p is a prime number greater than 10

p = {11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,...}
18 = 2*3^2

p = 18k + r : where r can not be even or a multiple of 3

Remainders = {11,13,17,1,5,7} : 6 possible remainders since remainder is odd and 3,9,15 can not be remainder otherwise 3 will be a factor of p.

IMO D
User avatar
chasing725
Joined: 22 Jun 2025
Last visit: 13 Jan 2026
Posts: 176
Own Kudos:
173
 [1]
Given Kudos: 5
Location: United States (OR)
Schools: Stanford
Schools: Stanford
Posts: 176
Kudos: 173
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more

Possible reminders = 1, 2, 3, 4, 5, 6, 7, 8, 9 , 10, 11, 12, 13, 14, 15, 16 , 17

The remainder can't be even the number generated is odd. Hence we can eliminate all even numbers.

Between 1, 3, 5, 7, 9, 11, 13, 17
If the remainder is 3 or 9, the number will be of form 18x + 3 or 18x + 9. In this case, the number would not be a prime number. Hence, we can eliminate 3 and 9.

Possible remainers = 1, 5, 7, 11, 13, 17

Option D
User avatar
tannu.jha_0104
Joined: 07 Apr 2024
Last visit: 30 Mar 2026
Posts: 3
Own Kudos:
5
 [1]
Given Kudos: 27
Location: India
GMAT 1: 200 Q10 V10
GRE 1: Q135 V135
GMAT 1: 200 Q10 V10
GRE 1: Q135 V135
Posts: 3
Kudos: 5
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Possible odd remainders mod 18---1,3,5,7,9,11,13,15,17
removing multiples of 3---(3,9,15)
total number -6
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more
User avatar
VT10
Joined: 15 Mar 2025
Last visit: 28 Feb 2026
Posts: 7
Own Kudos:
Given Kudos: 12
Posts: 7
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
A positive integer having no factor p between p and the integer itself means such integer is a prime number.

So, generated numbers are prime numbers greater than 10.

Generated number/18 => Remainder noted

Starting with 11

11/18 => Rem= 11
13/18 => Rem=13
17/18 => Rem=17
19/18 => Rem=1
23/18 => Rem=5
29/18 => Rem=11

Going on the same remainders will repeat.

So distinct remainders= 11,13,17,1,5

So, Number of distinct remainders=5

Option C
Bunuel
A computer program randomly generates positive integers greater than 10 that have no factor p such that 1 < p < the generated number. Each time a number is generated, the program divides it by 18 and records the remainder. How many distinct remainders could the program possibly record?

A. 3
B. 4
C. 5
D. 6
E. 9

Gift
12 Days of Christmas Competition
This question is part of our holiday event
Win $40,000 in prizes: courses, tests, and more
 1   2   3   4   5   
Moderators:
Math Expert
109715 posts
Tuck School Moderator
853 posts