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.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# 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"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
We will show that 2n−1 has a multiple of the form m2+9 if and only if n is a power of 2.
First, suppose there is an odd prime p∣n. Look at the equation m2≡−9(mod2p−1). Since p is odd, 2p−1 is not divisible by 3, so we can multiply both sides by the multiplicative inverse of 9 to get k2≡−1(mod2p−1). The Jacobi symbol(2p−1−1) is −1 because 2p−1≡3(mod4), so −1 is not a square mod 2p−1 and the equation has no solutions.
Hence 2p−1 has no multiple of the form m2+9. Since any multiple of 2n−1 is a multiple of 2p−1,2n−1 has no multiples of the form m2+9.
It remains to show that if n is a power of 2,2n−1 has a multiple of the form m2+9. Proceed by induction. First, n=1,2,4 are clear as base cases. (Use m=6.) Now suppose n is a (larger) power of 2. By the inductive hypothesis, 2n/2−1 has a multiple of the form m12+9. Also, (2n/2+1)⋅9=(3⋅2n/4)2+9, so (3⋅2n/4)2+9 is a multiple of 2n/2+1. Now use the Chinese Remainder Theorem to construct a number m such that
mm≡m1(mod2n/2−1)≡3⋅2n/4(mod2n/2+1)
Then m2+9 will be divisible by the relatively prime positive integers 2n/2−1 and 2n/2+1, hence by their product 2n−1.□
(To give an idea of that inductive process, let's construct an m for n=8. First, we have that 62+9 is a multiple of 24−1, and 122+9 equals 9 times 24+1, so now use the Chinese Remainder Theorem to get an m satisfying m≡6(mod15), m≡12(mod17). One solution, m=−39, leads to the multiple 392+9=1530 of the number 28−1=255.)
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:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
We will show that 2n−1 has a multiple of the form m2+9 if and only if n is a power of 2.
First, suppose there is an odd prime p∣n. Look at the equation m2≡−9(mod2p−1). Since p is odd, 2p−1 is not divisible by 3, so we can multiply both sides by the multiplicative inverse of 9 to get k2≡−1(mod2p−1). The Jacobi symbol (2p−1−1) is −1 because 2p−1≡3(mod4), so −1 is not a square mod 2p−1 and the equation has no solutions.
Hence 2p−1 has no multiple of the form m2+9. Since any multiple of 2n−1 is a multiple of 2p−1, 2n−1 has no multiples of the form m2+9.
It remains to show that if n is a power of 2, 2n−1 has a multiple of the form m2+9. Proceed by induction. First, n=1,2,4 are clear as base cases. (Use m=6.) Now suppose n is a (larger) power of 2. By the inductive hypothesis, 2n/2−1 has a multiple of the form m12+9. Also, (2n/2+1)⋅9=(3⋅2n/4)2+9, so (3⋅2n/4)2+9 is a multiple of 2n/2+1. Now use the Chinese Remainder Theorem to construct a number m such that mm≡m1(mod2n/2−1)≡3⋅2n/4(mod2n/2+1)
Then m2+9 will be divisible by the relatively prime positive integers 2n/2−1 and 2n/2+1, hence by their product 2n−1. □
(To give an idea of that inductive process, let's construct an m for n=8. First, we have that 62+9 is a multiple of 24−1, and 122+9 equals 9 times 24+1, so now use the Chinese Remainder Theorem to get an m satisfying m≡6(mod15), m≡12(mod17). One solution, m=−39, leads to the multiple 392+9=1530 of the number 28−1=255.)