2017 UNCO Math Contest II Problems/Problem 11

Revision as of 00:18, 20 May 2017 by Timneh (talk | contribs) (Problem)

Problem

Divide and Conquer 

(a) How many different factorizations are there of $4096$ (which is $2^{12}$) in which each factor is either a square or a cube (or both) of an integer and each factor is greater than one? Regard $4 \times 4 \times 4 \times 8 \times 8$ and $4 \times 8 \times 4 \times 8 \times 4$ as the same factorization: the order in which the factors are written does not matter. Regard the number itself, $4096$, as one of the factorizations.

(b) How many different factorizations are there of $46,656$ as a product of factors in which each factor is either a square or a cube (or both) of an integer and each factor is greater than one? As before, the order in which the factors is written does not matter, and the number itself counts as a factorization. Note that $46,656$ = $2^6 \times 3^6$.

Solution

See also

2017 UNCO Math Contest II (ProblemsAnswer KeyResources)
Preceded by
Problem 10
Followed by
last question
1 2 3 4 5 6 7 8 9 10
All UNCO Math Contest Problems and Solutions