mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2019-03-26, 07:09   #1
enzocreti
 
Mar 2018

17·31 Posts
Default primes p(n-1) dividing the sum 2+3+5+7+...+p(n)

with Pari Gp i found that up to 10^10 there are only two primes 7 and 8263 of this type. infact 2+3+5+7+11=28 divisibile by 7. and 2+3+5+7+...+8269 divisibile by 8263. the heuristic says that there should be infinitely many of these primes but because the heuristic says loglog(n) they should be very rare. could somebody find onother such prime >10^10?
enzocreti is offline   Reply With Quote
Old 2019-03-26, 09:07   #2
enzocreti
 
Mar 2018

17·31 Posts
Default https://oeis.org/A078721

7 and 8263 belong to the Oeis sequence https://oeis.org/A078721

2
3 5
7 11 13


they are on the left side of this Tarrtaglia triangle made with primes
enzocreti is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
A conjecture about Mersenne primes and non-primes Unregistered Information & Answers 0 2011-01-31 15:41
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

All times are UTC. The time now is 09:05.

Wed May 12 09:05:51 UTC 2021 up 34 days, 3:46, 0 users, load averages: 2.08, 1.89, 1.75

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.