Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
This is a heuristic model, not a proved result. Socialist primes are defined on the page for (2.6).
Model (p. 4). Treat the residues of modulo as random nonzero residues, and use that for . The estimated probability that is socialist is then
(4.1) (p. 4). By Stirling's approximation, . The paper calls this "just a rough upper bound" (p. 4, quoted): conditions (1.1) and (1.2) would lower it by some factor; treating , , as independent and random, (2.7) would suggest , but the congruence for and odd primes (p. 5) means should be larger than that.
Expected count (p. 5). Estimating the number of socialist primes in by , approximated by an integral, the paper derives
and so expects no more than socialist primes greater than . Combined with the search below , it estimates the probability that socialist primes exist at less than .
Proof pointer
Pp. 4--5: Stirling's bound gives (4.1); the count replaces the sum over primes by and bounds the integrand by the derivative of . The replacement of the sum by an integral is heuristic.
Read depth
Claims checked: the model, (4.1) and the expected-count estimate were read on the arXiv v1 print, pp. 4--5. Nothing here is independently reviewed.
Dependencies
Condition (2.7) and the [[factorials_binomials/andrejic_2016_distinct_residues_factorials/computation_p6|search below ]], for the remarks only.
Source. V. Andrejić and M. Tatarevic, On distinct residues of factorials, arXiv:1603.04086v1 (2016); published in Publ. Inst. Math. (Beograd) (N.S.) 100(114) (2016), 101--106. Labels and pages here are those of the arXiv v1 print; the edition read is named on the source card.
Bears on
- Problem 478: a heuristic estimate under which the extreme case with (socialist primes; see the page for (2.6)) is expected to be rare; it proves nothing about .