mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2018-01-02, 07:20   #1
George M
 
Dec 2017

2·52 Posts
Default Another "how to prove"

Quote:
Originally Posted by George M View Post
p_{n + 1} \ = \ \{\sum_{k = 1}^{n}(p_{k + 1} \ - \ p_{k}) \ : \ p_m \ = \ m^{th} \ prime \ number\}
The equation is incorrect, but seemingly correct if you add 2 to the RHS. Can anybody demonstrate a proof?
George M is offline   Reply With Quote
Old 2018-01-02, 18:02   #2
danaj
 
"Dana Jacobsen"
Feb 2011
Bangkok, TH

32·101 Posts
Default

Moved from a a post on a Prime Gap Searches thread.
danaj is offline   Reply With Quote
Old 2018-01-02, 18:08   #3
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by George M View Post
The equation is incorrect, but seemingly correct if you add 2 to the RHS. Can anybody demonstrate a proof?
You are summing the prime gaps, you need to add 2 because 2 is tje first prime.
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Stockfish game: "Move 8 poll", not "move 3.14159 discussion" MooMoo2 Other Chess Games 5 2016-10-22 01:55
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" wildrabbitt Miscellaneous Math 11 2015-03-06 08:17
P-1 B1/B2 selection with "Test=" vs "Pfactor=" James Heinrich Software 2 2005-03-19 21:58
Would Minimizing "iterations between results file" may reveal "is not prime" earlier? nitai1999 Software 7 2004-08-26 18:12

All times are UTC. The time now is 20:11.


Sun Oct 17 20:11:37 UTC 2021 up 86 days, 14:40, 0 users, load averages: 1.13, 1.25, 1.25

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.