Tessellate S.T.E.M.S. (2019) - Mathematics - Category A (School) - Set 2 - Subjective Problem 2

Find all positive integers n n for which 2n12^n-1 has a multiple of the form m2+9m^2+9.


This problem is a part of Tessellate S.T.E.M.S. (2019)

#NumberTheory

Note by Tessellate S.T.E.M.S. Mathematics
2 years, 7 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 will show that 2n12^n-1 has a multiple of the form m2+9m^2+9 if and only if nn is a power of 2.2.

First, suppose there is an odd prime pn.p|n. Look at the equation m29(mod2p1).m^2 \equiv -9 \pmod{2^p-1}. Since pp is odd, 2p12^p-1 is not divisible by 3,3, so we can multiply both sides by the multiplicative inverse of 99 to get k21(mod2p1).k^2 \equiv -1 \pmod{2^p-1}. The Jacobi symbol (12p1)\left( \frac{-1}{2^p-1} \right) is 1-1 because 2p13(mod4),2^p-1 \equiv 3 \pmod 4, so 1-1 is not a square mod 2p12^p-1 and the equation has no solutions.

Hence 2p12^p-1 has no multiple of the form m2+9.m^2+9. Since any multiple of 2n12^n-1 is a multiple of 2p1,2^p-1, 2n12^n-1 has no multiples of the form m2+9.m^2+9.

It remains to show that if nn is a power of 2,2, 2n12^n-1 has a multiple of the form m2+9.m^2+9. Proceed by induction. First, n=1,2,4n=1,2,4 are clear as base cases. (Use m=6.m=6.) Now suppose nn is a (larger) power of 2.2. By the inductive hypothesis, 2n/212^{n/2}-1 has a multiple of the form m12+9.m_1^2+9. Also, (2n/2+1)9=(32n/4)2+9,(2^{n/2}+1) \cdot 9 = (3 \cdot 2^{n/4})^2+9, so (32n/4)2+9(3 \cdot 2^{n/4})^2+9 is a multiple of 2n/2+12^{n/2}+1. Now use the Chinese Remainder Theorem to construct a number mm such that mm1(mod2n/21)m32n/4(mod2n/2+1) \begin{aligned} m &\equiv m_1 \pmod{2^{n/2}-1} \\ m &\equiv 3 \cdot 2^{n/4} \pmod{2^{n/2}+1} \\ \end{aligned}

Then m2+9m^2+9 will be divisible by the relatively prime positive integers 2n/212^{n/2}-1 and 2n/2+1,2^{n/2}+1, hence by their product 2n1.2^n-1. \Box

(To give an idea of that inductive process, let's construct an mm for n=8.n=8. First, we have that 62+96^2+9 is a multiple of 241,2^4-1, and 122+912^2+9 equals 99 times 24+1,2^4+1, so now use the Chinese Remainder Theorem to get an mm satisfying m6(mod15)m \equiv 6 \pmod{15}, m12(mod17).m \equiv 12 \pmod{17}. One solution, m=39,m=-39, leads to the multiple 392+9=153039^2+9 = 1530 of the number 281=255.2^8-1 = 255.)

Patrick Corn - 2 years, 5 months ago
×

Problem Loading...

Note Loading...

Set Loading...