Number Theory #4

Let nn be a positive integer such that 2n+12n+1 and 3n+13n+1 are both squares. Prove that 40n40|n.

#NumberTheory

Note by Victor Loh
6 years, 11 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

It suffices to prove 5n,8n5\mid n,8\mid n.

Given that 2n+1=x2,3n+1=y22n+1=x^2, 3n+1=y^2, If we add the two equations we get: 5n+2=x2+y2x2+y22(mod5)5n+2=x^2+y^2\Rightarrow x^2+y^2\equiv 2\pmod 5, since the quadratic residues of mod 55 are0,1,40,1,4, we can check that only x2y21x^2\equiv y^2\equiv 1 works, therefore 2n110(mod5)5n2n\equiv 1-1\equiv 0\pmod 5\Rightarrow 5\mid n

The same analysis can be done for 88, but we will multiply the second equation by 22 first and then add: 8n+3=x2+2y2x2+2y23(mod8)8n+3=x^2+2y^2\Rightarrow x^2+2y^2\equiv 3\pmod 8, since the quadratic residues of mod 88 are 0,1,40,1,4, we can check that only x2y21x^2\equiv y^2\equiv 1 works again, which means 3n110(mod8)8modn3n\equiv 1-1\equiv 0\pmod 8\Rightarrow 8\mod n and we are done.

Xuming Liang - 6 years, 11 months ago

Log in to reply

Great!

Victor Loh - 6 years, 11 months ago
×

Problem Loading...

Note Loading...

Set Loading...