Huge easy difficulty.

Find minimum number \(n\), such that

2n!2^{n!}×2n1!2^{n-1!}×2n2!2^{n-2!}×... ...×23!2^{3!}×22!2^{2!}×21!2^{1!}

is a perfect power of 6710886467108864.

#NumberTheory

Note by Bryan Lee Shi Yang
6 years, 3 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

We start by observing that 67108864=22667108864 = 2^{26}

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

But observe that r=1nr!=1+r=2nr!=1+2N\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 nn.

Kishlaya Jaiswal - 6 years, 3 months ago

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

D G - 6 years, 3 months ago

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 - 6 years, 3 months ago

Sorry, note edited.

Bryan Lee Shi Yang - 6 years, 3 months ago

Guts to powers

Akram Hossain - 6 years, 1 month ago
×

Problem Loading...

Note Loading...

Set Loading...