mersenneforum.org Graduate Student’s Side Project Proves Prime Number Conjecture
 Register FAQ Search Today's Posts Mark Forums Read

2022-06-07, 23:49   #2
Dr Sardonicus

Feb 2017
Nowhere

7·292 Posts

Quote:
 Originally Posted by rudy235 Disclosure: i must say do not like the heading too much but that is the actual title of the Article in Quanta magazine with yesterday’s date by Jordana Cepelewicz.
I agree, Quanta booted the title. A more accurate title appears to be A proof of the Erdős primitive set conjecture (Arxiv preprint).

I found a description of the conjecture online:
Quote:
 A subset of the integers larger than 1 is primitive if no member divides another. Erdős proved in 1935 that $\sum_{a\in A}\frac{1}{a\log(a)}$ for a running over a primitive set A is universally bounded over all choices for A. In 1988 he asked if this universal bound is attained for the set of prime numbers.

 Similar Threads Thread Thread Starter Forum Replies Last Post Xyzzy Lounge 5 2021-11-11 03:10 robert44444uk Other Mathematical Topics 18 2018-11-02 18:57 wildrabbitt Math 8 2016-06-28 08:15 pinhodecarlos Forum Feedback 1 2012-09-11 05:11 TObject GPU Computing 2 2012-07-21 01:56

All times are UTC. The time now is 01:07.

Tue Aug 9 01:07:34 UTC 2022 up 32 days, 19:54, 1 user, load averages: 0.80, 0.95, 0.99