Last visit was: 18 Nov 2025, 20:31 It is currently 18 Nov 2025, 20:31
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
 1   2   
505-555 Level|   Multiples and Factors|   Number Properties|                           
User avatar
nailgmattoefl
User avatar
Joined: 18 Dec 2009
Last visit: 02 Mar 2010
Posts: 9
Own Kudos:
445
 [419]
Posts: 9
Kudos: 445
 [419]
If n is a positive integer and the product of all integers from 1 to n Updated on: 07 Jul 2019, 23:23
Originally posted by nailgmattoefl on 28 Dec 2009, 11:47.
Last edited by Bunuel on 07 Jul 2019, 23:23, edited 4 times in total.
Edited the question and added the OA
30
Kudos
Add Kudos
388
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

15% (low)

Question Stats:

82% (01:17) correct 18% (01:29) wrong based on 6875 sessions

History

Date
Time
Result
Not Attempted Yet
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

Show SpoilerThis question has different answer choices in OG 2020
A. 8
B. 9
C. 10
D. 11
E. 12
ShowHide Answer
Official Answer
B
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
778,088
 [180]
Given Kudos: 99,964
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,088
 [180]
If n is a positive integer and the product of all integers from 1 to n Updated on: 13 Sep 2025, 00:50
Originally posted by Bunuel on 28 Dec 2009, 12:22.
Last edited by Bunuel on 13 Sep 2025, 00:50, edited 1 time in total.
77
Kudos
Add Kudos
102
Bookmarks
Bookmark this Post
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

Given:

\(n!=990*k=2*5*3^2*11*k\)

\(n!=2*5*3^2*11*k\)

This means that \(n!\) must have all factors of 990 to be a multiple of 990, hence it must also have 11. So the least value of \(n\) is 11 (notice that 11! will include all the other factors of 990 as well, otherwise the least value of \(n\) would have been larger).

Answer: B.

Hope it's clear.
User avatar
LJ
User avatar
Joined: 07 Jun 2009
Last visit: 17 Feb 2013
Posts: 25
Own Kudos:
82
 [57]
Given Kudos: 23
Status:Getting ready for the internship summer
Location: Rochester, NY
Concentration: Finance
Schools:Simon
GPA: 3.06
WE 1: JPM - Treasury
Posts: 25
Kudos: 82
 [57]
If n is a positive integer and the product of all integers from 1 to n 18 Sep 2010, 15:18
38
Kudos
Add Kudos
17
Bookmarks
Bookmark this Post
This question tests the concept of prime factorization. In order to figure out if 990 can be a divisor of the unknown product you need to determine all of the prime factors that combine to successfully divide 990 without leaving a remainder.

The prime factors of 990 are 2, 3, 3, 5, 11

Since 11 is a prime factor of 990, you need to have the number present somewhere in the unknown product. Answer A is the product of integers from 1 to 10 and therefore does not meet the necessary criteria. Answer B includes 11 and therefore is the answer.
General Discussion
User avatar
chix475ntu
User avatar
Joined: 26 May 2005
Last visit: 03 Aug 2011
Posts: 99
Own Kudos:
282
 [12]
Given Kudos: 1
Posts: 99
Kudos: 282
 [12]
If n is a positive integer and the product of all integers from 1 to n 27 Feb 2010, 21:50
8
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
divanshuj

If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value for n?

a) 10
b) 11
c) 12
d) 13
e) 14
Show more

990 = 2 * 5 * 3 * 3* 11
so product from 1 to n should have all the above numbers. n = 11 will have all the above numbers as factors of 1 * 2* ..... * 11

B
User avatar
jakolik
User avatar
Joined: 16 Apr 2010
Last visit: 01 Nov 2012
Posts: 140
Own Kudos:
657
 [17]
Given Kudos: 12
Posts: 140
Kudos: 657
 [17]
If n is a positive integer and the product of all integers from 1 to n 02 Aug 2010, 00:00
13
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
Hi,

The question says that 990 is a factor of n!.
990 = 9*110 = 9*11*10
For 990 to be a factor of n!, n should at least be 11 so that it includes the common factor 11 that is found in 990.


regards,
Jack
User avatar
shrouded1
User avatar
Retired Moderator
Joined: 02 Sep 2010
Last visit: 29 Apr 2018
Posts: 609
Own Kudos:
3,191
 [6]
Given Kudos: 25
Location: London
Products:
My Reviews
Posts: 609
Kudos: 3,191
 [6]
If n is a positive integer and the product of all integers from 1 to n 18 Sep 2010, 15:59
5
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
The least possible value of such a n will be at least the highest prime factor of 990, which is 11

The only other thing to check is if the rest of the factors of 990, can be obtained by multiplication of numbers less than 11. Otherwise n may be greater than 11

But that is easy to see since 990=9*10*11. So taking all the numbers below 11 will suffice.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
778,088
 [4]
Given Kudos: 99,964
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,088
 [4]
If n is a positive integer and the product of all integers from 1 to n 13 Feb 2011, 18:53
1
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
Similar questions to practice:

https://gmatclub.com/forum/m26-184460.html (GMAT Club Tests)
https://gmatclub.com/forum/what-is-the- ... 68984.html (GMAT Club Tests)
https://gmatclub.com/forum/n-is-a-posit ... 04272.html
https://gmatclub.com/forum/n-is-a-posit ... 04272.html
https://gmatclub.com/forum/if-the-produ ... 86936.html
https://gmatclub.com/forum/if-5400mn-k- ... 09284.html
https://gmatclub.com/forum/if-m-and-n-a ... 08985.html
https://gmatclub.com/forum/if-n-and-y-a ... 92562.html
https://gmatclub.com/forum/if-p-is-a-po ... 98638.html
https://gmatclub.com/forum/if-x-and-y-a ... 30696.html
https://gmatclub.com/forum/what-is-the- ... 21070.html
https://gmatclub.com/forum/if-x-and-y-a ... 00413.html

Hope it helps.
avatar
nammers
avatar
Joined: 19 Jul 2011
Last visit: 05 Dec 2011
Posts: 77
Own Kudos:
125
 [8]
Given Kudos: 4
Concentration: Finance, Economics
Schools: Duke '15
GPA: 3.9
Schools: Duke '15
Posts: 77
Kudos: 125
 [8]
If n is a positive integer and the product of all integers from 1 to n 24 Aug 2011, 08:13
7
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
You need to primarily find the primes of 990:
2,3,3,5,11
The integer must contain all these primes

By knowing 11 is an prime, we know the answer can be B,C,D or E as these all contain 11.
11=1,2,3,4,5,6,7,8,9,10,11

11 contains the 2,3,5 and 11 explicitly and the second 3 comes from the 6 (2*3), therefore the answer is 11.

This is because we know a number that contains all the primes of 990 will be a multiple of 990.

Hope this helps
avatar
nammers
avatar
Joined: 19 Jul 2011
Last visit: 05 Dec 2011
Posts: 77
Own Kudos:
125
 [5]
Given Kudos: 4
Concentration: Finance, Economics
Schools: Duke '15
GPA: 3.9
Schools: Duke '15
Posts: 77
Kudos: 125
 [5]
If n is a positive integer and the product of all integers from 1 to n 24 Aug 2011, 09:29
5
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The answer would be the number which contains all the factors of the figure.
The series of 1 to 11 contained all the factors of 990. 2,3,3,5 and 11.
Because 990 is made up from these 5 numbers such that 2*3*3*5*11 = 990
If you times the other numbers (1,4,6,7,8,9,10) in the series you will get a multiple of 990 from this.

I picked 11 because it asked for the least possible value of n. Picking 12,13,14 would result in a multiple of 990 but the number is more than the least possible value of 11.

The best way to interpret problems is through practice, you will come to understand questions better over time. Always remember GMAT questions are simple questions made to look complicated.
avatar
SunnyDelight
avatar
Joined: 09 Feb 2011
Last visit: 16 Mar 2012
Posts: 7
Own Kudos:
13
 [3]
Given Kudos: 2
Posts: 7
Kudos: 13
 [3]
If n is a positive integer and the product of all integers from 1 to n 24 Aug 2011, 09:50
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
just entered this in google and you're right! (1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10 * 11) / 990 = 40 320

meanwhile (1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10) / 990 = 3 665.45455 wouldn't work

It makes sense because the highest prime factor of 990 must also be a factor of any multiple of 990.

I guess I need to do more practice problems involving multiples and number properties.
User avatar
Sachin9
User avatar
Joined: 22 Jul 2012
Last visit: 25 Dec 2015
Posts: 351
Own Kudos:
174
Given Kudos: 562
Status:Gonna rock this time!!!
Location: India
GMAT 1: 640 Q43 V34
GMAT 2: 630 Q47 V29
WE:Information Technology (Computer Software)
GMAT 2: 630 Q47 V29
Posts: 351
Kudos: 174
If n is a positive integer and the product of all integers from 1 to n 25 Jan 2013, 02:29
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

We are told that \(n!=990*k=2*5*3^2*11*k\) --> \(n!=2*5*3^2*11*k\) which means that \(n!\) must have all factors of 990 to be the multiple of 990, hence must have 11 too, so the least value of \(n\) is 11 (notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)..

Answer: B.

Hope it's clear.
Show more


to cement my understanding, maximum value of n can be anything, right?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
778,088
 [1]
Given Kudos: 99,964
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,088
 [1]
If n is a positive integer and the product of all integers from 1 to n 25 Jan 2013, 04:51
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Sachin9
Bunuel
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

We are told that \(n!=990*k=2*5*3^2*11*k\) --> \(n!=2*5*3^2*11*k\) which means that \(n!\) must have all factors of 990 to be the multiple of 990, hence must have 11 too, so the least value of \(n\) is 11 (notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)..

Answer: B.

Hope it's clear.


to cement my understanding, maximum value of n can be anything, right?
Show more

The maximum value of n is not limited at all. For all n more than or equal to 11, n! will be a multiple of 990.
User avatar
davidfrank
User avatar
Joined: 21 Jun 2011
Last visit: 18 Sep 2021
Posts: 46
Own Kudos:
118
Given Kudos: 15
Location: United States
Concentration: Accounting, Finance
WE:Accounting (Accounting)
Posts: 46
Kudos: 118
If n is a positive integer and the product of all integers from 1 to n 15 Jul 2013, 00:29
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

We are told that \(n!=990*k=2*5*3^2*11*k\) --> \(n!=2*5*3^2*11*k\) which means that \(n!\) must have all factors of 990 to be the multiple of 990, hence must have 11 too, so the least value of \(n\) is 11 (notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)..

Answer: B.

Hope it's clear.
Show more

Hi Bunuel,

I am not sure why have excluded 10, which seems to be one of the factors (5*2).
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
778,088
 [3]
Given Kudos: 99,964
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,088
 [3]
If n is a positive integer and the product of all integers from 1 to n 15 Jul 2013, 00:33
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
davidfrank
Bunuel
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

We are told that \(n!=990*k=2*5*3^2*11*k\) --> \(n!=2*5*3^2*11*k\) which means that \(n!\) must have all factors of 990 to be the multiple of 990, hence must have 11 too, so the least value of \(n\) is 11 (notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)..

Answer: B.

Hope it's clear.

Hi Bunuel,

I am not sure why have excluded 10, which seems to be one of the factors (5*2).
Show more

n! must be a multiple of 990=90*11. Now, if n=10, then it wont have 11 as its factor, so it cannot be a multiple of a number which HAS 11 as its factor.

Hope it's clear.
User avatar
GMATPill
User avatar
Joined: 14 Apr 2009
Last visit: 17 Sep 2020
Posts: 2,260
Own Kudos:
3,817
 [1]
Given Kudos: 8
Location: New York, NY
Posts: 2,260
Kudos: 3,817
 [1]
If n is a positive integer and the product of all integers from 1 to n 26 Feb 2014, 11:11
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Here's a more elaborated thinking response to what you all have summarized above -- but for those who need the extra steps, try this.

990* multiple = product of 1 to n
990 * multiple = 1 * 2 * 3 * 4 * 5 * ... * n
11 * 3 * 3 * multiple = 1 * 2 * 3 * 4 * 5 * ... * n

We need to find the smallest value for n. We know in the factor tree, any number can be broken down to its lowest level in the factor tree. And that factor tree will comprise of all prime factors.

The factors on the left side are:
11 and 3 and 'multiple' -- the multiple can be anything.

We know that we want 990 to go into the right side (we don't care how many times).

The 990 consists of 11 and 3^2. So essentially it's prime factors are 11 and 3. These lowest level prime factors must go into the right side -- so the right side at the very least must contain the lowest prime factors from the left side.

So, we see 1 * 2 * 3 * 4 * 5 * ... * n

contains a 3.

But it does not contain an '11'.
11 is the answer.

Hope that helps.
User avatar
KarishmaB
User avatar
Joined: 16 Oct 2010
Last visit: 18 Nov 2025
Posts: 16,265
Own Kudos:
76,983
 [6]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,265
Kudos: 76,983
 [6]
If n is a positive integer and the product of all integers from 1 to n 26 Feb 2014, 19:30
4
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
flood
If n is a positive integer and the product of all the integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

a) 10
b) 11
c) 12
d) 13
e) 14

I got this one right but I'm not too clear on the logic behind it.
Show more

Can you multiply two numbers (other than 11) and get an 11? No because 11 is prime. If 11 is a part of the product of 3 numbers, say a*b*c, it must have been one of the numbers.
Given that the product is 990x (where x is some integer). When we start breaking down 990 into factors, we start with 9*11*10. We see that 9 and 10 will be further broken down into smaller factors but 11 will not be. It is prime. So one of the numbers which multiplied to give 990x must have been 11.
Since consecutive integers 1 to n were multiplied, n is either 11 or greater than 11 to include 11 in the numbers multiplied.
Least possible value of n is 11.
User avatar
GMATinsight
User avatar
Major Poster
Joined: 08 Jul 2010
Last visit: 18 Nov 2025
Posts: 6,835
Own Kudos:
16,349
 [4]
Given Kudos: 128
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Products:
My Reviews
Expert
Expert reply
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
Posts: 6,835
Kudos: 16,349
 [4]
If n is a positive integer and the product of all integers from 1 to n 20 Oct 2015, 04:31
2
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Bunuel
If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?

(A) 8
(B) 9
(C) 10
(D) 11
(E) 12


Kudos for a correct solution.
Show more

product of all the integers from 1 to n = n!
990 = 9*10*11
i.e. n! must be divisible by 9, 10 and 11 all for n! to be divisible by 990
i.e. minimum value of n must be 11 for n! to be divisible by 11 and 10 and 9 both

P.S. 11!= 11*10*9*8*7*6*5*4*3*2*1

n = 11

Answer: option D
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [2]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [2]
If n is a positive integer and the product of all integers from 1 to n Updated on: 09 Jan 2021, 07:02
Originally posted by BrentGMATPrepNow on 20 Oct 2015, 07:17.
Last edited by BrentGMATPrepNow on 09 Jan 2021, 07:02, edited 1 time in total.
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14


Kudos for a correct solution.
Show more

A lot of integer property questions can be solved using prime factorization.
For questions involving divisibility, divisors, factors and multiples, we can say:
If N is divisible by k, then k is "hiding" within the prime factorization of N

Consider these examples:
24 is divisible by 3 because 24 = (2)(2)(2)(3)
Likewise, 70 is divisible by 5 because 70 = (2)(5)(7)
And 112 is divisible by 8 because 112 = (2)(2)(2)(2)(7)
And 630 is divisible by 15 because 630 = (2)(3)(3)(5)(7)

For more on this concept, see the 2nd half of this free video: https://www.gmatprepnow.com/module/gmat- ... /video/825

So, if some number is a multiple of 990, then 990 is hiding in the prime factorization of that number.

Since 990 = (2)(3)(3)(5)(11), we know that one 2, two 3s, one 5 and one 11 must be hiding in the prime factorization of our number.

For 11 to appear in the product of all the integers from 1 to n, n must equal 11 or more.
So, the answer is B

Cheers,
Brent
User avatar
ScottTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 14 Oct 2015
Last visit: 18 Nov 2025
Posts: 21,712
Own Kudos:
26,990
 [5]
Given Kudos: 300
Status:Founder & CEO
Affiliations: Target Test Prep
Location: United States (CA)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 21,712
Kudos: 26,990
 [5]
If n is a positive integer and the product of all integers from 1 to n 03 May 2016, 11:47
3
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
nailgmattoefl
If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10
B. 11
C. 12
D. 13
E. 14

Show Spoiler
I got the right answer 11 by stating:
--> 990 can be divided by 11

Is is the right way to solve that?

Thanks in advance.
Show more

Solution:

We are given that the product of all integers from 1 to n, inclusive, (i.e., n!) is a multiple of 990.

Thus, n! = 990 x k for some integer k.

Another way to visualize the given information is to say:

n!/990 must be an integer. Thus, n! must contain all the factors of 990.

Notice that 990 = 99 x 10 = 9 x 11 x 10. So in order for n!/990 to be an integer, n must at least be equal to 11, since 11! = 11 x 10 x 9 x … x 3 x 2 x 1.

Answer: B
avatar
dkubanyi
avatar
Joined: 02 Aug 2016
Last visit: 31 Aug 2016
Posts: 1
Own Kudos:
4
 [4]
Given Kudos: 15
Posts: 1
Kudos: 4
 [4]
If n is a positive integer and the product of all integers from 1 to n 14 Aug 2016, 07:04
2
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Lets breakdown the question:
n is a positive integer
Therefore n>0

the product of all the integers from 1 to n, inclusive, is a multiple of 990

Therefore (1 x 2 x 3 ..... x n) / 990 gives an integer
Therefore n!/990 gives an integer
Therefore n!/(9 x 10 x 11)gives an integer

Question: What is the least possible value of n!
This means what is the lowest value that n! can be so that when it is divided by 9 x 10 x 11, the outcome gives an integer

The lowest value of n! should have all the factors that are in the demoninator so that when divided an integer is formed

11! / (9 x 10 x 11) = (11 x 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1) / (9 x 10 x 11)
= 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1

10! / (9 x 10 x 11) = (10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1) / (9 x 10 x 11)
= (9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1) / 11 = mixed number

Any number lower than 10! will give a mixed number.

Any number higher that 11! will give an integer, however 11! is the lowest value that will produce an integer when 990 is the denominator.
 1   2   
Moderators:
Bunuel
Math Expert
105355 posts
Krunaal
Tuck School Moderator
805 posts