REVIEW 2 major objections 1 minor 1 cited by
Conjectures about Primes and Cyclic Numbers
T0 review · 2 major / 1 minor · reviewed 2026-08-05 · deepseek-v4-flash
Pith's one-line read The paper reports that the cyclic-number analogue of the second Hardy-Littlewood conjecture fails, as shown by an exhaustive count of the 28,488,167 cyclic numbers below 10^8.
desk verdict The abstract promises a clean disproof but hides the essential details; the idea is sound and worth referee time. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing identity is the equivalence between a group-theoretic and an arithmetic statement: an integer $n$ is cyclic if and only if $\gcd(n,\phi(n))=1$, with $\phi$ Euler's totient. This turns 'every group of size $n$ is cyclic' into a fast numerical test, and the paper applies it to enumerate all cyclic numbers below $10^8$. That enumeration, with count $28{,}488{,}167$, is the device that produces the counterexample.
What would settle it
Independently recompute the set of $n<10^8$ with $\gcd(n,\phi(n))=1$ and verify the total is $28{,}488{,}167$; then scan pairs $(x,y)$ with $x+y<10^8$ for a violation of $C(x+y)-C(x)\le C(y)$. If no violation exists, or if the total differs, the disproof fails.
Extended reading notes
Core claim
The core discovery is a finite counterexample: the analogue of the second Hardy-Littlewood conjecture for cyclic numbers is false. In its prime form, that conjecture says the number of primes in an interval $(x,x+y]$ never exceeds the number of primes up to $y$. Replacing primes by cyclic numbers gives the inequality $C(x+y)-C(x)\le C(y)$, where $C$ counts cyclic numbers; the paper reports that this inequality fails somewhere among cyclic numbers below $10^8$. The enumeration total is $28{,}488{,}167$, and the equivalence $n$ cyclic $\iff \gcd(n,\phi(n))=1$ is what makes the search purely arithmetic.
Load-bearing premise
The load-bearing premise is that the enumeration of all cyclic numbers below $10^8$ is complete and correct, because the disproof rests on one interval counterexample found in that list.
Editorial extensions
If this is right
- If the computed list is complete, the cyclic analogue of the second Hardy-Littlewood conjecture is false, so interval-counting conjectures about primes do not automatically transfer to the larger set of cyclic numbers.
- Because every prime is cyclic, the counterexample shows a counting inequality can fail for a superset of the primes even though it is believed to hold for the primes themselves.
- The other cyclic analogues proposed in the paper remain undecided; the paper explicitly invites proofs or disproofs of them.
- The enumeration provides a concrete data set for future tests: all cyclic numbers below $10^8$ can be reused to check the remaining conjectures.
Reading between the lines
- Editorial inference: the abstract does not display the exact inequality tested. The natural form of the cyclic analogue is $C(x+y)-C(x)\le C(y)$; if the paper used a different formulation, the disproof should be read against that statement.
- Editorial inference: if the enumeration is independently verified, a natural next step is to locate the smallest $x,y$ that violate the cyclic inequality and to study how the excess $C(x+y)-C(x)-C(y)$ behaves as $x$ grows.
- Editorial inference: the cyclic counterexample could serve as a testbed for the original prime conjecture, since understanding why the totient condition produces violations for cyclic numbers may clarify how special the primes' distribution is.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper defines cyclic numbers (positive integers n such that every group of order n is cyclic, equivalently gcd(n, φ(n)) = 1), observes that every prime is cyclic, and proposes analogues of known or conjectured prime properties, including some new conjectures about primes. The author reports having enumerated the 28,488,167 cyclic numbers below 10^8 and claims to disprove the cyclic analogue of the second Hardy-Littlewood conjecture about primes. This referee report is based only on the abstract, since the full text was not available. The precise inequality being disproved, the enumeration method, and the actual counterexample are not stated in the abstract.
Significance. If the claimed disproof is correct, it would be a notable separation result: the natural interval-counting analogue of the second Hardy-Littlewood conjecture for cyclic numbers would be false, while the original prime conjecture remains open. The reported count is plausible and consistent with the known density of cyclic numbers (about 0.284), and the defining equivalence is a standard theorem. However, the significance cannot be fully assessed because two load-bearing pieces of information are absent from the abstract: the exact analogue that is tested and the computational basis for the enumeration. The paper's invitation for independent proofs or disproofs is a positive feature, but it does not remove the need for the author to make the central claim verifiable.
major comments (2)
- [Abstract] The disproved analogue is not stated. The abstract says only that the author disproves 'the cyclic analog of the second conjecture about primes of Hardy and Littlewood.' The natural analogue is that C(x+y) <= C(x) + C(y) for all x,y, equivalently the number of cyclic numbers in (x, x+y] never exceeds the number up to y. If a different inequality was tested—with restricted ranges, a different reference count, or a different counting function—the disproof may not address the intended conjecture. Please state the exact inequality tested and report the extremal interval and the value of the interval-counting function at that interval.
- [Abstract] The enumeration of 28,488,167 cyclic numbers below 10^8 is the computational foundation of the disproof, yet no algorithm, implementation, or independent check is reported. A single missed or misclassified number could change the maximum of the interval-counting function and invalidate the counterexample. The count itself is plausible, but the disproof collapses without a reproducible enumeration. Please include the algorithm, the code or a detailed pseudocode, and an independent verification (for example, comparing against the gcd criterion or a known sequence), and report the location and value of the extremal counterexample.
minor comments (1)
- [Abstract] The phrase 'second conjecture about primes of Hardy and Littlewood' is ambiguous unless the conjecture is stated. Please include its precise formulation, both in the abstract and in the body, so that the analogue being disproved is unambiguous.
Circularity Check
No circular derivation found in the abstract; the central claim is a computational disproof of an external conjecture, and the gaps noted are verification gaps, not circularity.
full rationale
The abstract contains no derivation chain that reduces a predicted outcome to its own input. The definition of cyclic numbers (gcd(n, phi(n)) = 1) is independent of any conjecture about primes or cyclic numbers. The main claim is an empirical disproof of the cyclic analog of Hardy and Littlewood's second conjecture, tested against an enumerated list of cyclic numbers below 10^8. That conjecture is external to the paper, so a counterexample drawn from the enumeration does not make the disproof circular. The enumeration's completeness and the exact form of the tested inequality are not described, but those are reliability and verification concerns, not instances of self-definition, fitted-parameter renaming, or load-bearing self-citation. The proposed analog conjectures may be tested on the same data that motivated them, which could weaken their evidentiary value, but the abstract does not state that they were fitted to the data and no equation or fitted parameter is shown to force the outcome. There is no self-citation and no uniqueness claim imported from the authors' prior work. Therefore no circular step can be exhibited, and the appropriate finding is no significant circularity.
Assumptions & free parameters
assumptions (3)
- standard math n is cyclic if and only if gcd(n, φ(n)) = 1 (equivalence between 'every group of size n is cyclic' and the Euler totient criterion).
- domain assumption The enumeration of all n < 10^8 with gcd(n, φ(n)) = 1 is complete and correctly yields 28,488,167 cyclic numbers.
- domain assumption The inequality tested is the faithful cyclic analogue of the second Hardy-Littlewood conjecture.
Cite this review
Pith. "Pith review of Conjectures about Primes and Cyclic Numbers." pith.science (2026). https://pith.science/paper/ZQ5F4YJX
@misc{pith2026250808335,
author = {Pith},
title = {Pith review of: Conjectures about Primes and Cyclic Numbers},
year = {2026},
howpublished = {\url{https://pith.science/paper/ZQ5F4YJX}},
note = {Machine review of arXiv:2508.08335}
}
abstract
A positive integer $n$ is defined to be cyclic if and only if every group of size $n$ is cyclic. Equivalently, $n$ is cyclic if and only if $n$ is relatively prime to the number of positive integers less than $n$ that are relatively prime to $n$. Because every prime number is cyclic, it is natural to ask whether a (proved or conjectured) property of primes extends to cyclic numbers. I review proved or conjectured properties of primes (including some new conjectures about primes) and propose analogous conjectures about cyclic numbers. Using the 28,488,167 cyclic numbers less than $10^8$, I test the conjectures about cyclic numbers and disprove the cyclic analog of the second conjecture about primes of Hardy and Littlewood. Proofs or disproofs of the remaining conjectures are invited.
Forward citations
Cited by 1 Pith paper
-
A counterexample to a subadditivity conjecture of Cohen for Sophie Germain cyclic numbers
Cohen's Conjecture 66 fails: C_σ(3959)=697 > 696 = C_σ(31)+C_σ(3928) at m=31, n=3928.
Reviewed August 5, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.