REVIEW 4 major objections 5 minor 7 references
Notes on Divisibility of Catalan Numbers
T0 review · 4 major / 5 minor · reviewed 2026-08-08 · deepseek-v4-flash
Pith's one-line read This paper claims that for every n>6, the Catalan number C_n contains a prime factor of the form 6k−1, and that this forces 6 to divide σ(C_n).
desk verdict One correct lemma, but the main theorem is unsupported and the asymptotics have a factor-of-two error. 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 mechanism is the interval divisibility fact: every prime in $(n+1, 2n]$ divides $C_n$. This converts the claim that $C_n$ has a $6k-1$ prime factor into an interval problem about primes congruent to $5$ modulo $6$. The second mechanism is the $\sigma$-function pairing argument: for an integer of the form $6k-1$, divisors pair as $(d, n/d)$ whose sums vanish modulo $3$, and parity forces divisibility by $2$, together giving $\sigma(6k-1)$ divisible by $6$. The asymptotic claims apply a known theorem on the number of prime factors of factorials to estimate $\omega(C_n)$, and use equidistribution of primes plus the twin-prime density to estimate the number of $6k-1$ and twin-prime factors.
What would settle it
Factor $C_n$ for $n>6$ and search for a prime divisor of the form $6k-1$; the universal claim is settled by the first $n$ that lacks one. Since the proof reduces to intervals, one can also test the interval statement directly: any $n>6$ whose interval $(n+1, 2n]$ contains only primes congruent to $1$ mod $6$, together with $2$ and $3$, would break the argument. A companion check is to compute $\sigma(C_n)$ modulo $6$ up to a chosen bound; if $6$ fails to divide $\sigma(C_n)$ for some $n>6$, then either the main theorem or the step from a $6k-1$ prime factor to a divisor-sum multiple of $6$ is wrong.
Extended reading notes
Core claim
On the paper's own terms, the discovery is Theorem 1: every Catalan number beyond the sixth is divisible by at least one prime of the form $6k-1$. The route goes through the interval $(n+1, 2n]$: because $C_n$ is a quotient of factorials, every prime inside that interval survives into its factorization. If $C_n$ had no $6k-1$ prime factor, all of those interval primes would have to be congruent to $1$ mod $6$, which the author takes to contradict the distribution of primes and the existence of twin primes. From this the paper derives Corollary 4, that $6$ divides $\sigma(C_n)$ for $n>6$, and it independently proves Lemma 2, that $\sigma(6k-1)$ is divisible by $6$ for every positive integer $k$.
Load-bearing premise
In the proof of Theorem 1, the load-bearing assumption is that every interval $(n+1, 2n]$ with $n>6$ contains a prime congruent to $5$ mod $6$; this is asserted rather than proved, with the paper's only support being that its failure would contradict the twin prime conjecture.
Editorial extensions
If this is right
- If Theorem 1 is right, then $\sigma(C_n)$ is divisible by $6$ for every $n>6$, a uniform divisibility law for an infinite family.
- The theorem rules out the possibility that Catalan numbers beyond a point use only the primes $2$, $3$, and primes congruent to $1$ mod $6$.
- The interval mechanism makes the theorem equivalent to a strong interval statement about primes in arithmetic progressions, so a proof of that statement would give a self-contained route.
- The asymptotic estimates say $\omega(C_n)$ grows like $2n/\log n$, with about $n/\log n$ factors of the form $6k-1$, so those factors appear infinitely often; the twin-prime density then predicts infinitely many twin-prime pairs among the factors.
- If Conjecture 1 is correct, the divisibility relation $b \mid \sigma(bk-1)$ has exactly the finite base set $\{1, 3, 4, 6, 8, 12, 24\}$.
Reading between the lines
- Editorial inference: the proof would become unconditional if one proved the interval statement directly for residue $5$ mod $6$; the paper does not take up that proof.
- Editorial inference: the written step to Corollary 4 needs the exponent of the $6k-1$ prime to be odd, because $\sigma(p^e)$ is divisible by $6$ when $e$ is odd and not when $e$ is even; a complete proof must supply that or find another source of divisibility.
- Editorial inference: the asymptotic estimate treats $C_n$ as roughly a factorial quotient, but cancellation can remove primes; a direct count of primes in $(n+1, 2n]$ by residue class would sharpen the prediction.
- Editorial inference: Conjecture 1 invites a computational search over bases $b$ outside the listed set, checking whether $b$ divides $\sigma(bk-1)$ for a long block of $k$ values; the first counterexample would end the conjecture.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper investigates when Catalan numbers C_n have prime factors congruent to 5 mod 6, when 6 divides the sum-of-divisors sigma(C_n), and asymptotic estimates for the number of prime factors of C_n. It states Theorem 1 (every C_n with n > 6 has a prime factor of the form 6k - 1), Corollary 4 (6 divides sigma(C_n) for n > 6), and several asymptotic claims based on de Bruijn's theorem, Dirichlet's theorem, and the Hardy-Littlewood conjecture. The proof of Theorem 1 argues by contradiction using the Twin Prime Conjecture, and the asymptotic section performs subtraction of factorial prime-count estimates.
Significance. If validly established, a guarantee that every sufficiently large Catalan number has a prime factor 5 mod 6 would be a modest but genuine addition to the arithmetic study of Catalan numbers. The paper, however, does not supply a valid proof of its main theorem, its corollary is unjustified because prime exponents are ignored, and the asymptotic section contains an algebraic error that invalidates the claimed 2n/log n growth. The manuscript also relies on the unproved Twin Prime Conjecture and the Hardy-Littlewood conjecture in places where standard analytic estimates would be needed. No machine-checked proofs, reproducible code, or parameter-free derivations are provided, and the central claims are consequently not supported.
major comments (4)
- [Section 1, Theorem 1 proof] The proof assumes, for contradiction, that there exist infinitely many Catalan numbers with no prime factor of the form 6k - 1. This is not the negation of the theorem's statement "for n > 6, Cn has prime factors of the form 6k - 1"; the negation is "there exists some n > 6 for which Cn has no such factor." Even a successful contradiction would leave finitely many possible exceptions unhandled. Furthermore, the assertion that an interval (n+1, 2n] containing no prime of the form 6k - 1 contradicts the Twin Prime Conjecture is incorrect: the Twin Prime Conjecture only states that there are infinitely many pairs p, p+2, and it does not imply that every dyadic interval contains such a prime. The proof therefore depends on an unproved and much stronger interval statement that is never established.
- [Section 2, Corollary 4] The proof states that by Theorem 1 there is a prime factor 6k - 1 and "consequently" sigma(6k - 1) = 6k. This equality holds only if 6k - 1 is prime and only for the prime itself. If the prime p = 6k - 1 divides Cn with exponent e > 1, then sigma(p^e) is not generally equal to 6k; for instance sigma(5^2) = 31. The corollary could be repaired by proving that the prime of the form 6k - 1 lies in the interval (n+1, 2n], where its exponent in Cn is exactly 1, but Theorem 1 does not establish this. As written, Corollary 4 does not follow.
- [Section 3.1] The estimate omega(n!) ~ n/log n is used to write omega(Cn) ~ 2n/log n - 2n/(2 log(n/2)). Even if one accepted this subtraction, the displayed expression simplifies to roughly n/log n, not 2n/log n. Moreover, subtracting the distinct-prime counts of the numerator and denominator factorials is not a valid way to obtain the distinct-prime count of the quotient after cancellations. The correct first-order count of new prime divisors introduced by the numerator is at most the number of primes in (n, 2n], which is ~ n/log n. The claim that Cn has approximately 2n/log n distinct prime factors is therefore unsupported.
- [Sections 3.2 and 3.3] Dirichlet's theorem on primes in arithmetic progressions gives asymptotic equidistribution over all primes, not a statement that each individual integer Cn has exactly half of its prime factors of the form 6k - 1. Similarly, the Hardy-Littlewood twin-prime density 2C2 x/(log x)^2 applies to the number of twin primes up to x; it cannot be transferred to the prime factors of a single number Cn by replacing x with n. The expression C2 n/(log n)^2 is asserted without derivation, and the conclusion that twin prime factors persist infinitely often in Cn does not follow from the preceding heuristic.
minor comments (5)
- [Section 2, Lemma 2 proof] The proof contains garbled sentences: "But this suggests that 6n - 1 is even" appears to be a typo for "6k - 1", and the parity argument should state that sigma(n) is odd only if all prime exponents are even, which would make n a perfect square, impossible for n congruent to 5 mod 6.
- [Section 2, Corollary 3 and Conjecture 1] Corollary 3 lists six values 3, 4, 6, 8, 12, 24, while Conjecture 1 defines B = {1, 3, 4, 6, 8, 12, 24} and says "only six cases"; the set has seven elements, so the count is inconsistent.
- [Section 3.1, reference [7]] The reference to de Bruijn's 1951 paper concerns the number of prime factors of a single integer, not the asymptotic formula omega(n!) ~ pi(n) ~ n/log n; a standard textbook citation for the factorial estimate would be appropriate.
- [Section 2, Coprimality graph] The "Coprimality Graph" is not defined or explained, and the claim that the graph demonstrates coprimality between the six expressions is not backed by a formal statement or proof.
- [End of paper] The Turkish poem at the end appears unrelated to the mathematical content and should be removed or explicitly justified as part of the paper's exposition.
Circularity Check
Theorem 1's proof assumes the Twin Prime Conjecture and then the paper presents Theorem 1 as 'indirect support' for that same conjecture; the asymptotic section repeats the loop by assuming Hardy-Littlewood to corroborate the same conclusion.
-
other
[Section 1, Theorem 1 proof and following remark]
"If all primes in (n+1,2n] were of the form 6k+1, it would mean that primes of the form 6k−1 become rare, contradicting the Twin Prime Conjecture. ... Therefore, our assumption is incorrect, proving that for sufficiently large n, the Catalan number Cn must have a prime factor of the form 6k−1. This result not only extends our understanding of Catalan numbers but also provides indirect support for the Twin Prime Conjecture."
The proof's only reason to reject the possibility that every prime in (n+1,2n] is 6k+1 is an appeal to the unproved Twin Prime Conjecture; without that conjecture, nothing rules out such intervals. Thus Theorem 1 is derived from TPC, not from independent facts. Immediately after the proof, the paper says the theorem 'provides indirect support for the Twin Prime Conjecture' and eliminates a potential counterexample. The supposed support for TPC is therefore the very premise on which the theorem's proof depends: TPC implies Theorem 1, and Theorem 1 is then offered as evidence for TPC. Moreover, the proof contradicts only the assumption of infinitely many exceptions, so even the conditional argument does not establish the stated 'for n>6' conclusion.
-
other
[Section 3.3, 'Expected Number of Twin Prime Pairs in Cn' and summary]
"Using the Hardy-Littlewood twin prime conjecture, the density of twin primes up to x is given by: 2C2x/(log x)^2, where C2 ≈ 0.66016 is the twin prime constant. Applying this to Cn, the expected number of twin prime pairs among its prime factors is ∼ C2n/(log n)^2. Since this remains positive for arbitrarily large n, twin prime factors should persist infinitely often in Cn. ... Thus, the refined asymptotic formula for Cn strengthens our argument without altering the key conclusions."
The asymptotic section does not independently verify the theorem; it assumes the Hardy-Littlewood conjecture, which implies the Twin Prime Conjecture, and then concludes that twin prime factors 'should persist infinitely often in Cn.' This conclusion is described as strengthening the key conclusions of the paper. So the apparent asymptotic corroboration is obtained from a conjecture that already contains the desired infinitude of twin primes. The result is circular corroboration of the TPC theme of Theorem 1, not a derivation from established facts.
full rationale
The paper's central derivation is not self-contained. Theorem 1 requires the assertion that every interval (n+1,2n] contains a prime congruent to 5 mod 6, and the proof supports that assertion only by invoking the Twin Prime Conjecture. Since TPC is unproved and far stronger than the needed interval statement, Theorem 1 is conditional. The paper then uses Theorem 1 as 'indirect support' for TPC, making the claimed support circular: the theorem's proof is the only evidence offered, and it already assumes TPC. The Hardy-Littlewood-based asymptotic section repeats the pattern by assuming a conjecture that implies TPC and using the resulting conclusion to 'strengthen' the same argument. These are genuine circular-support loops, not mere citation issues. Separately, the paper contains non-circular mathematical gaps—the contradiction hypothesis treats only infinitely many exceptions rather than the theorem's 'for n>6' claim, Corollary 4 does not address prime exponents, and the ω(Cn) estimates subtract ω-values without accounting for cancellations in the quotient—but those are correctness problems rather than circularity.
Assumptions & free parameters
free parameters (1)
- Leading constant 2 in omega(C_n) about 2n/log n =
2
assumptions (5)
- ad hoc to paper Twin Prime Conjecture (infinitely many twin primes)
- ad hoc to paper Hardy-Littlewood twin prime conjecture
- standard math Erdos's theorem that central binomial coefficients are divisible by all primes in (n, 2n]
- standard math Dirichlet's theorem on primes in arithmetic progressions
- domain assumption de Bruijn's theorem on prime factors of factorial-like sequences
Cite this review
Pith. "Pith review of Notes on Divisibility of Catalan Numbers." pith.science (2026). https://pith.science/paper/TE23KRE7
@misc{pith2026250204619,
author = {Pith},
title = {Pith review of: Notes on Divisibility of Catalan Numbers},
year = {2026},
howpublished = {\url{https://pith.science/paper/TE23KRE7}},
note = {Machine review of arXiv:2502.04619}
}
read the original abstract
We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1, derive sufficient criteria for divisibility of \sigma(C_n), and explore asymptotic estimates for the growth of \sigma(C_n) using de Bruijn's theorem. These results provide new insights into the arithmetic structure of Catalan numbers.
Reference graph
Works this paper leans on
-
[1]
R Alter and K Kubota Prime and Prime power divisibility of Catalan numbers . JCT
-
[2]
T. M. Apostol Introduction to Analytic Number Theory . Springer
-
[3]
Erd¨ osOn some divisibility properties of ( 2n n )
P. Erd¨ osOn some divisibility properties of ( 2n n ) . Canadian Mathematical Bulletin
-
[4]
G.H. Hardy and J.E. Littlewood, ”Some Problems of ’Partitio Numero rum’ III: On the Expression of a Number as a Sum of Primes,” Acta Mathematica, Vol. 44, 1923, pp . 1–70
work page 1923
-
[5]
N. J. A. Sloane. OEIS. www.OEIS.org
-
[6]
T Koshy Catalan numbers with applications
-
[7]
de Bruijn, ”The Asymptotic Number of Prime Factors of an In teger,” Nederl
N.G. de Bruijn, ”The Asymptotic Number of Prime Factors of an In teger,” Nederl. Akad. Wetensch. Proc. Ser. A. 54 = Indag. Math. 13 (1951), 50–60. Ekme˘ ge, a¸ ska ve ¨ omre K¨ ufeleriyle h¨ ukmeden Ci˘ gerleri k¨ u¸ c¨ uk, elleri b¨ uy¨ uk Nefesleri yetmez avu¸ clarına ˙Ilkokul ¸ ca˘ gında hepsi Kenar ¸ cocukları Kar altındadır A. Arif 7
work page 1951
Reviewed August 8, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.