Hacker News new | ask | show | jobs
by S4M 1480 days ago
It said that the quantity sum(1/(n log n) for n in A) is always finite when A is a primitive set. The "operation done to each element of the set" is n -> 1 / (n log n).