Jump to content

You can use that

  1. all prime numbers greater than 2 have to be odd, otherwise they would have 2 as a factor, making them non-prime.
  2. the sum of two odd numbers is even.
  3. the sum of two even numbers is even.

to deduce that all primes >2 being odd, the non-prime to be added thus must be even (as odd+odd=even and thus non-prime). In that case the question generalises to if you can write every prime as a prime plus an even number, in which case the answer turns out to be no: https://math.stackexchange.com/questions/269658/whether-a-prime-number-can-be-written-as-sum-of-a-prime-number-and-2n?rq=1

Crystal: CPU: i7 7700K | Motherboard: Asus ROG Strix Z270F | RAM: GSkill 16 GB@3200MHz | GPU: Nvidia GTX 1080 Ti FE | Case: Corsair Crystal 570X (black) | PSU: EVGA Supernova G2 1000W | Monitor: Asus VG248QE 24"

Laptop: Dell XPS 13 9370 | CPU: i5 10510U | RAM: 16 GB

Server: CPU: i5 4690k | RAM: 16 GB | Case: Corsair Graphite 760T White | Storage: 19 TB

Link to comment
https://linustechtips.com/topic/1420176-odd-primes/#findComment-15319893
Share on other sites

Link to post
Share on other sites

10 hours ago, tikker said:

You can use that

  1. all prime numbers greater than 2 have to be odd, otherwise they would have 2 as a factor, making them non-prime.
  2. the sum of two odd numbers is even.
  3. the sum of two even numbers is even.

to deduce that all primes >2 being odd, the non-prime to be added thus must be even (as odd+odd=even and thus non-prime). In that case the question generalises to if you can write every prime as a prime plus an even number, in which case the answer turns out to be no: https://math.stackexchange.com/questions/269658/whether-a-prime-number-can-be-written-as-sum-of-a-prime-number-and-2n?rq=1

The link talks about a prime plus a power of 2. I’m pretty sure that a prime can always be defined as a sum of another prime and a multple of 2 or 1.
 

Link to comment
https://linustechtips.com/topic/1420176-odd-primes/#findComment-15320620
Share on other sites

Link to post
Share on other sites

7 hours ago, Wictorian said:

The link talks about a prime plus a power of 2. I’m pretty sure that a prime can always be defined as a sum of another prime and a multple of 2 or 1.
 

It could be, but you'll have to mathematically prove it. Multiple of 1 is out of the question I think, because everything is a multiple of 1 and the number has to be even since primes are odd. Therefore your multiple of 1 would automatically have to be a multiple of 2. That StackExchange question indeed looked at 2^n, your question would be whether any prime can be written as P2 = P1 + 2n

Crystal: CPU: i7 7700K | Motherboard: Asus ROG Strix Z270F | RAM: GSkill 16 GB@3200MHz | GPU: Nvidia GTX 1080 Ti FE | Case: Corsair Crystal 570X (black) | PSU: EVGA Supernova G2 1000W | Monitor: Asus VG248QE 24"

Laptop: Dell XPS 13 9370 | CPU: i5 10510U | RAM: 16 GB

Server: CPU: i5 4690k | RAM: 16 GB | Case: Corsair Graphite 760T White | Storage: 19 TB

Link to comment
https://linustechtips.com/topic/1420176-odd-primes/#findComment-15320992
Share on other sites

Link to post
Share on other sites

18 hours ago, tikker said:

It could be, but you'll have to mathematically prove it. Multiple of 1 is out of the question I think, because everything is a multiple of 1 and the number has to be even since primes are odd. Therefore your multiple of 1 would automatically have to be a multiple of 2. That StackExchange question indeed looked at 2^n, your question would be whether any prime can be written as P2 = P1 + 2n

I meant every prime can be written either as a multiple of two and a prime or the sum of a prime and 1 and a multiple of 2.

Link to comment
https://linustechtips.com/topic/1420176-odd-primes/#findComment-15322203
Share on other sites

Link to post
Share on other sites

3 hours ago, Wictorian said:

I meant every prime can be written either as a multiple of two and a prime or the sum of a prime and 1 and a multiple of 2.

You're constantly changing the goal, now you're at a sum of three numbers. The point remains unchanged: it'll have to be proven mathematically and that may not be easy, but you'll first have to choose something you want to prove and stick with that. Since you generally cannot prove such a statement true, you will want to prove it false. In other words, you want to find an example that shows you can't write them as you propose. If you can't find such an example with reasonable certainty then you can decide to make it a conjecture (=assumed true, but not sure).

Crystal: CPU: i7 7700K | Motherboard: Asus ROG Strix Z270F | RAM: GSkill 16 GB@3200MHz | GPU: Nvidia GTX 1080 Ti FE | Case: Corsair Crystal 570X (black) | PSU: EVGA Supernova G2 1000W | Monitor: Asus VG248QE 24"

Laptop: Dell XPS 13 9370 | CPU: i5 10510U | RAM: 16 GB

Server: CPU: i5 4690k | RAM: 16 GB | Case: Corsair Graphite 760T White | Storage: 19 TB

Link to comment
https://linustechtips.com/topic/1420176-odd-primes/#findComment-15322355
Share on other sites

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

×