Difference between revisions of "Factorial"
Williamhu888 (talk | contribs) (→See Also) |
Williamhu888 (talk | contribs) (→Examples) |
||
Line 54: | Line 54: | ||
* <math>46! = 5502622159812088949850305428800254892961651752960000000000</math> | * <math>46! = 5502622159812088949850305428800254892961651752960000000000</math> | ||
* <math>47! = 258623241511168180642964355153611979969197632389120000000000</math> | * <math>47! = 258623241511168180642964355153611979969197632389120000000000</math> | ||
− | |||
* <math>48! = 12413915592536072670862289047373375038521486354677760000000000</math> | * <math>48! = 12413915592536072670862289047373375038521486354677760000000000</math> | ||
* <math>49! = 608281864034267560872252163321295376887552831379210240000000000</math> | * <math>49! = 608281864034267560872252163321295376887552831379210240000000000</math> | ||
* <math>50! = 30414093201713378043612608166064768844377641568960512000000000000</math> | * <math>50! = 30414093201713378043612608166064768844377641568960512000000000000</math> | ||
− | (<math>50!</math> is 65 digits long | + | (<math>50!</math> is already 65 digits long!) |
== Additional Information == | == Additional Information == |
Revision as of 21:19, 29 March 2011
The factorial is an important function in combinatorics and analysis, used to determine the number of ways to arrange objects.
Contents
[hide]Definition
The factorial is defined for positive integers as . Alternatively, a recursive definition for the factorial is
.
Examples
( is already 65 digits long!)
Additional Information
By convention, is given the value
.
The gamma function is a generalization of the factorial to values other than nonnegative integers.
Prime Factorization
- Main article: Prime factorization
Documentation
Use {{hatnote|text}} </noinclude>
Since is the product of all positive integers not exceeding
, it is clear that it is divisible by all
primes
, and not divisible by any prime
. But what is the power of a prime
in the prime factorization of
? We can find it as the sum of powers of
in all the factors
;
but rather than counting the power of
in each factor, we shall count the number of factors divisible by a given power of
. Among the numbers
, exactly
are divisible by
(here
is the floor function). The ones divisible by
give one power of
. The ones divisible by
give another power of
. Those divisible by
give yet another power of
. Continuing in this manner gives
for the power of in the prime factorization of
. The series is formally infinite, but the terms converge to
rapidly, as it is the reciprocal of an exponential function. For example, the power of
in
is just
(
is already greater than
).
Uses
The factorial is used in the definitions of combinations and permutations, as is the number of ways to order
distinct objects.
Problems
Introductory
- Find the units digit of the sum
(Source)
Intermediate
- Let
be the product of the first
positive odd integers. Find the largest integer
such that
is divisible by
(Source)
Olympiad
- Let
be the number of permutations of the set
, which have exactly
fixed points. Prove that
.
(Source)
See Also
- A cool link to calculate factorials: http://www.nitrxgen.net/factorialcalc.php