Proof...

Is the statement true : "if 'p' is a prime then 4 p2p^{2} + 1 is also prime ?"

#NumberTheory #Proofs

Note by Vighnesh Raut
6 years, 8 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

Let p=2n+1p = 2n + 1 as most of the primes are odd, with particular natural number nn. We now have 16n2+16n+516n^{2} + 16n + 5 as the number to check. One only needs to choose any multiple of 55 as nn while maintaining the primality pp. With n=5n = 5, p=11p = 11, which is prime, and 4p2+1=4854p^{2} + 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.

Damiann Mangan - 6 years, 8 months ago

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±1p = 6n \pm 1 Except numbers ending with 5 in the above expression

Krishna Sharma - 6 years, 8 months ago

Log in to reply

First of all, I wasn't nor intended to say that every prime can be written as 2n+12n + 1, with any integer nn. As it is obviously wrong. To clarify, I'm using 2n+12n + 1 as pp 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 55 as nn while maintaining the primality of pp."

And third, don't write "firstly" if you're only pointing one thing.

Damiann Mangan - 6 years, 8 months ago

Log in to reply

@Damiann Mangan Oh

Krishna Sharma - 6 years, 8 months ago

f(p)=4p2+1f(p) = 4p^{2} + 1

f(p)=4p2+4p+14p f(p) = 4p^{2} + 4p +1 - 4p

=(2p+1)24p= (2p + 1)^{2} - 4p

odd - even is not always a prime number

therefore statement is false

U Z - 6 years, 8 months ago
×

Problem Loading...

Note Loading...

Set Loading...