Factoring a what?

This is a question from the International Mathematics Contest 2013, I've been trying to solve it for a long time, But I couldn't find a legitimate solution. Could anyone give a mathematical solution to it? Algebraic, Geometric (if something of the kind exists), Thanks! =D

Give a factor of the expression: 242+221+12^{42} + 2^{21} + 1.

#NumberTheory

Note by Giwon Kim
5 years, 4 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

Seems easy for a IMC Question, unless I messed up.

242+221+1=26312211 2^{42} + 2^{21} + 1 = \frac{2^{63} - 1}{2^{21} - 1}

So we need to find a prime for which 2631(modp) 2^{63} \equiv 1 \pmod{p} but 221≢1(modp) 2^{21} \not \equiv 1 \pmod{p} .

Since 963 9|63 and 9∤21 9\not | 21 , if we find a prime such that 291(modp) 2^9 \equiv 1 \pmod{p} but 23≢1(modp) 2^3 \not \equiv 1 \pmod{p} , we are done.

Now 291=511=773 2^9 - 1 = 511 = 7*73 . So 291(mod7,73) 2^9 \equiv 1 \pmod{7,73} . But, we have 231(mod7) 2^3 \equiv 1 \pmod{7} and 23≢1(mod73) 2^3 \not \equiv 1 \pmod{73} . So 7 is ruled out. So the prime which we require is 73 73 .

We can verify this since 242+221+1=236+6+218+3+126+23+1=64+8+1=730(mod73) 2^{42} + 2^{21} + 1 = 2^{36 + 6} + 2^{18+3} + 1 \equiv 2^6 + 2^3 + 1 = 64 + 8 + 1 = 73 \equiv 0 \pmod {73}

Siddhartha Srivastava - 5 years, 4 months ago

Log in to reply

Thank you so much for the response! =D But could I ask one more thing? I can see you used Fermat's little Theorem there, but I don't understand how you factored the first equation. I'd really appreciate it if you could explain that part too. Thaaaanks =DD

EDIT: Or wait, is it Fermat's little theorem??? XDD

Giwon Kim - 5 years, 4 months ago

Log in to reply

242+221+1=26312211 2^{42} + 2^{21} + 1 = \frac{2^{63} - 1}{2^{21} - 1}

This equation?

It's just some simple algebra. x2+x+1=(x2+x+1)(x1)(x1)=x31x1 x^2 + x + 1 = \dfrac{(x^2 + x + 1)(x-1)}{(x-1)} = \dfrac{x^3 - 1}{x-1} , where x=221 x = 2^{21}

Siddhartha Srivastava - 5 years, 4 months ago

Log in to reply

@Siddhartha Srivastava Ohhhh I see, XD The idea is quite simple, but I've never encountered it before. That really helped a lot, XDD Thanks!

Giwon Kim - 5 years, 3 months ago
×

Problem Loading...

Note Loading...

Set Loading...