✦ 5 frontiers

read-only vieweressays

erdős #164

← #163 · #165 → (packet.json; erdosproblems.com)

A set $A \subset N$ is primitive if no member of $A$ divides another. Is the sum $n \in A \sum \frac{1}{n lo g n}$ maximised over all primitive sets when $A$ is the set of primes?

Worked, still open.

number theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A137245 — Decimal expansion of Sum_{p prime} 1/(p * log p).1,6,3,6,6,1,6,3,2,3,3,5,1,2,6,0,8,6,8,5,6,9,6,5,8,0,0,3,9,2,1,8,6,3,6,7,1,1,8,1,5,9,7,0,7,6,1,3,1,2,9,3,0,5,8,6,0,0,3,0,

links

Create a formalisation here · link

status

solved

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub