Waste less time on Facebook — follow Brilliant.
×

Huge easy difficulty.

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\).

Note by Bryan Lee Shi Yang
2 years ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

We 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\). Kishlaya Jaiswal · 2 years ago

Log in to reply

Guts to powers Akram Hossain · 1 year, 10 months ago

Log in to reply

Sorry, note edited. Bryan Lee Shi Yang · 2 years ago

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. D G · 2 years ago

Log in to reply

I don't understand your notation. Could you be more explicit with your product formula? D G · 2 years ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...