Find minimum number \(n\), such that

\(2^{n!}\)×\(2^{n-1!}\)×\(2^{n-2!}\)×... ...×\(2^{3!}\)×\(2^{2!}\)×\(2^{1!}\)

is a perfect power of \(67108864\).

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestWe start by observing that \(67108864 = 2^{26}\)

So, it suffices to find the least \(n\) such that \(\sum_{r=1}^n r! = 26k\) for some arbitrary positive integer \(k\).

But observe that \[\sum_{r=1}^n r! = 1+ \sum_{r=2}^n r! = 1+2N\]

Hence, we see that the LHS is odd whereas RHS is even. And therefore, no solution exists for \(n\).

Log in to reply

Guts to powers

Log in to reply

Sorry, note edited.

Log in to reply

Assuming you mean to write parentheses around your exponents, there is no solution. Your question is equivalent to asking if there are any integers which satisfy 2^x = 9615^y, which is false since gcd(2, 9615) = 1.

Log in to reply

I don't understand your notation. Could you be more explicit with your product formula?

Log in to reply