mersenneforum.org Another "how to prove"
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2018-01-02, 07:20   #1
George M

Dec 2017

2·52 Posts
Another "how to prove"

Quote:
 Originally Posted by George M $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?

 2018-01-02, 18:02 #2 danaj   "Dana Jacobsen" Feb 2011 Bangkok, TH 22·227 Posts Moved from a a post on a Prime Gap Searches thread.
2018-01-02, 18:08   #3
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts

Quote:
 Originally Posted by George M 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.

 Similar Threads Thread Thread Starter Forum Replies Last Post MooMoo2 Other Chess Games 5 2016-10-22 01:55 wildrabbitt Miscellaneous Math 11 2015-03-06 08:17 James Heinrich Software 2 2005-03-19 21:58 nitai1999 Software 7 2004-08-26 18:12

All times are UTC. The time now is 02:02.

Mon Mar 1 02:02:56 UTC 2021 up 87 days, 22:14, 0 users, load averages: 1.84, 1.83, 2.16