Difference between revisions of "2016 UNCO Math Contest II Problems/Problem 2"
m (→Solution) |
m (→Solution) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Fearsome Foursome | ||
| + | Factorial Find the complete prime factorization of <cmath>\frac{(4!)!}{[(3!)!]^4}</cmath> | ||
| + | (The answer will be a product of powers of eight distinct primes.) | ||
== Solution == | == Solution == | ||
| − | + | <math>\boxed{2^6*3^2*7^3*11^2*13*17*19*23}</math> | |
== See also == | == See also == | ||
{{UNCO Math Contest box|year=2016|n=II|num-b=1|num-a=3}} | {{UNCO Math Contest box|year=2016|n=II|num-b=1|num-a=3}} | ||
| − | [[Category:Intermediate Number Theory | + | [[Category:Intermediate Number Theory Problems]] |
Latest revision as of 22:41, 16 February 2016
Problem
Fearsome Foursome
Factorial Find the complete prime factorization of ![\[\frac{(4!)!}{[(3!)!]^4}\]](http://latex.artofproblemsolving.com/8/1/d/81d2243ac2b439b665044d8a0b1ebc5273ca6c50.png)
(The answer will be a product of powers of eight distinct primes.)
Solution
See also
| 2016 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
