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
Let p=2n+1 as most of the primes are odd, with particular natural number n. We now have 16n2+16n+5 as the number to check. One only needs to choose any multiple of 5 as n while maintaining the primality p. With n=5, p=11, which is prime, and 4p2+1=485, which isn't a prime.
So, no.
Note: In a glance, I know the statement are false; because if it is true, we won't have a problem in finding the next biggest prime. Which we actually kind of have.
First of all, I wasn't nor intended to say that every prime can be written as 2n+1, with any integer n. As it is obviously wrong. To clarify, I'm using 2n+1 as p for the sake of one and only one thing, making the problem easier to be solved.
Second, have you read the third sentence in the first paragraph? It says "One only needs to choose any multiple of 5 as n while maintaining the primality of p."
And third, don't write "firstly" if you're only pointing one thing.
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
Let p=2n+1 as most of the primes are odd, with particular natural number n. We now have 16n2+16n+5 as the number to check. One only needs to choose any multiple of 5 as n while maintaining the primality p. With n=5, p=11, which is prime, and 4p2+1=485, which isn't a prime.
So, no.
Note: In a glance, I know the statement are false; because if it is true, we won't have a problem in finding the next biggest prime. Which we actually kind of have.
Log in to reply
Firstly your first assumption is wrong Prime number cannot be written as 2n +1 put n=4
You can say 'most' of the prime numbers can be written as p=6n±1 Except numbers ending with 5 in the above expression
Log in to reply
First of all, I wasn't nor intended to say that every prime can be written as 2n+1, with any integer n. As it is obviously wrong. To clarify, I'm using 2n+1 as p for the sake of one and only one thing, making the problem easier to be solved.
Second, have you read the third sentence in the first paragraph? It says "One only needs to choose any multiple of 5 as n while maintaining the primality of p."
And third, don't write "firstly" if you're only pointing one thing.
Log in to reply
f(p)=4p2+1
f(p)=4p2+4p+1−4p
=(2p+1)2−4p
odd - even is not always a prime number
therefore statement is false