REVIEW 3 major objections 4 minor 1 cited by
Redefining Euler-Rabinowitsch Polynomials with Heegner Number Based Quadratic Formulation
T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read The paper claims that a two-parameter quadratic family built from Heegner numbers can be tuned to produce a high density of primes, with the density estimate resting on the Bateman-Horn conjecture.
desk verdict The abstract's polynomial is not integer-valued for two of the Heegner numbers, so as stated the family cannot generate primes—that's a disqualifying flaw unless the full text restricts H. 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 central object is the polynomial family $f_{Z,k,H}(n)=n^2-(2Zk-1)n+\frac{(2Zk-1)^2+H}{4}$, with $H$ a Heegner number (one of the nine integers whose imaginary quadratic field has class number one) and $Zk$ a nonnegative integer. The parameter $Zk$ moves the vertex and tunes the constant term, while $H$ enters the discriminant-like structure that ties the family to Euler-Rabinowitsch polynomials. The quantitative engine is the Bateman-Horn conjecture, which supplies a predicted asymptotic density of primes for such polynomials; prime-counting functions are then used to compare or optimize the parameter choices.
What would settle it
Take a fixed large Heegner number such as $H=163$, compute the actual prime counts of $f_{Z,k,H}(n)$ for increasing ranges of $n$ and a sweep of $Zk$, and compare the limiting trend to the Bateman-Horn prediction; a systematic shortfall, or an optimized $(Z,k)$ whose observed density does not beat generic quadratics, would refute the central claim.
Extended reading notes
Core claim
The central claim is that $f_{Z,k,H}(n)=n^2-(2Zk-1)n+\frac{(2Zk-1)^2+H}{4}$ is a prime-generating quadratic whose behavior can be controlled by the pair $(Z,k)$ while $H$ ranges over the Heegner numbers. The paper states that through specific substitutions this form is closely related to the Euler-Rabinowitsch polynomials, so it both recovers known prime-rich quadratics and adds extra tuning freedom. Using the Bateman-Horn conjecture and prime-counting functions, the paper asserts that the family can be optimized to generate a high density of primes, and takes this as evidence that Heegner numbers have a concrete impact on the distribution of primes in quadratic sequences.
Load-bearing premise
The density estimate depends on the Bateman-Horn conjecture, an unproved statement about how often a polynomial takes prime values, and if that conjecture fails for this family the claimed high prime density is not supported.
Editorial extensions
If this is right
- The family is claimed to contain or reproduce the classical Euler-Rabinowitsch behavior, so its prime-rich runs extend a long-studied phenomenon rather than appearing in isolation.
- If Bateman-Horn applies, choosing different Heegner numbers and different $(Z,k)$ pairs gives a way to tune a quadratic to produce primes with higher density than generic quadratics.
- The analysis suggests that Heegner numbers, not just the discriminant, affect how long a quadratic can avoid composite values.
- A reliable tunable quadratic would offer a simple source of structured primes, which the paper suggests could matter for cryptography and signal processing.
Reading between the lines
- Inference: the parametrization may turn out to be a reparameterization of the Euler-Rabinowitsch family, in which case the claimed high density would be a known property in new clothing rather than a genuinely new phenomenon.
- Inference: even with no proof of Bateman-Horn, a finite numerical sweep over $Zk$ and $H$ could test whether certain Heegner numbers consistently yield longer prime runs than others, giving a partial check of the paper's heuristic claim.
- Inference: for cryptographic use the primes would need to be large and effectively unpredictable, and a simple quadratic sequence rarely offers both; the paper's abstract does not address that gap.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript (or the abstract under review) introduces a family of quadratic polynomials f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + ((2Zk-1)^2 + H)/4, where Zk is a nonnegative integer and H is claimed to be a Heegner number. The author asserts a close relationship to Euler-Rabinowitsch polynomials and claims, on the basis of the Bateman-Horn conjecture and prime-counting functions, that the family can be optimized to generate a high density of primes. The abstract offers no derivation, no explicit optimization procedure, and no numerical evidence; the only technical content is the family definition and the heuristic appeal to Bateman-Horn.
Significance. If the central construction is corrected and the claimed density results are established, the family could provide a unifying framework for known prime-generating quadratics and a systematic way to search for record-holding polynomials. The connection to Heegner numbers is a plausible source of algebraic structure. However, the abstract as written is internally inconsistent because the polynomial is not integer-valued for two of the nine Heegner numbers, and no evidence is supplied for the optimization claim. The significance of the contribution therefore cannot be assessed from the current manuscript.
major comments (3)
- [Abstract, definition of f_{Z,k,H}] The family as defined in the abstract is not integer-valued for all Heegner numbers H. For every integer Zk, B = 2Zk - 1 is odd, so B^2 ≡ 1 mod 4. Consequently the constant term (B^2 + H)/4 is an integer only when H ≡ 3 mod 4. Since the Heegner numbers include 1 and 2, the choices H = 1 and H = 2 give f(n) = n^2 - n + 1/2 and f(n) = n^2 - n + 3/4, respectively, which are not integers for any integer n and therefore cannot generate primes. The statement that H belongs to the set of Heegner numbers must be restricted to H ≡ 3 mod 4, or the definition must be modified, and all subsequent density computations must be redone for the admissible set.
- [Abstract, Bateman-Horn claim] The abstract claims that the Bateman-Horn conjecture and prime-counting functions are used to 'demonstrate' that the family can be optimized to generate a high density of primes. No details of this demonstration appear in the text provided. The reader cannot verify that the Bateman-Horn constant has been computed for this family, that the optimization over Zk and H has actually been performed, or what the resulting density is. If the full paper contains these computations, they must be made explicit; if not, the word 'demonstrate' is too strong and should be replaced by 'suggest' or 'provide heuristic evidence for.'
- [Abstract, novelty and relation to Euler-Rabinowitsch polynomials] The abstract states that the form is 'closely related to the Euler-Rabinowitsch polynomials through specific substitutions.' Since Euler-Rabinowitsch polynomials of the form n^2 + n + A are already known to be prime-rich when A is a Heegner number (or related to the class number), the present family may simply be a reparameterization of the same objects. The abstract does not specify the substitution or explain how the two-parameter family provides new algebraic tuning that is not already captured by the classical Euler-Rabinowitsch form. Please state the precise relation and identify which aspect of the construction is genuinely new.
minor comments (4)
- [Abstract, notation] The notation 'Zk' is unusual; presumably it denotes a single symbol such as Z_k or z_k. Please clarify whether it is a product Z·k or a single parameter, and use standard subscript notation.
- [Abstract, terminology] The term 'Heegner number' should be defined or referenced, as not all readers of analytic number theory will be familiar with the list {1, 2, 3, 7, 11, 19, 43, 67, 163} and its connection to class number one.
- [Abstract, quantitative claim] The phrase 'high density of primes' is not quantified. The abstract should specify the expected number of primes for n ≤ N or, at a minimum, state the leading constant from the Bateman-Horn conjecture so that the claimed optimization can be evaluated.
- [Abstract, applications] The statement that the work has 'potential applications in cryptography and signal processing' is unsupported by any argument or known mechanism. Unless the full paper supplies a concrete connection, this sentence should be removed or substantially softened.
Circularity Check
The novel family is a shifted Euler-Rabinowitsch polynomial; the claimed high prime density is inherited from the Heegner input rather than independently derived.
-
renaming known result
[Abstract (definition of f_{Z,k,H} and claimed relation to Euler-Rabinowitsch polynomials)]
"This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This form is closely related to the Euler-Rabinowitsch polynomials through specific substitutions."
Put B=2Zk-1. Then f(n)=n^2-Bn+(B^2+H)/4 = (n-(B+1)/2)^2 + (n-(B+1)/2) + (H+1)/4, which is exactly the Euler-Rabinowitsch polynomial x^2+x+(H+1)/4 evaluated at x=n-(B+1)/2. Since the substitution is only an integer shift, the set of values, and hence the primality behavior, is identical to the classical Euler-Rabinowitsch polynomial for the same Heegner discriminant. Thus the 'novel class' is a reparametrization of the known prime-rich Euler-Rabinowitsch polynomials; the paper's claimed demonstration of high prime density is the classical Rabinowitsch/Heegner result restated in new coordinates, not a derived prediction. The abstract's own admission of the substitutional connection confirms that the central claim reduces by construction to a known result.
full rationale
The assessment is based on the abstract and the displayed formula, since no full text is available. The central object f_{Z,k,H}(n) is, under the substitution x=n-(B+1)/2 with B=2Zk-1, exactly the Euler-Rabinowitsch polynomial x^2+x+(H+1)/4. Integer shifts do not change the set of prime values, so the entire family is a reindexing of the classical polynomials whose discriminants are Heegner numbers. Consequently, the abstract's conclusion that the family can be optimized to yield a high density of primes is not an independent derivation: the Heegner condition on H already encodes the prime-rich Euler-Rabinowitsch cases, and the Bateman-Horn calculation for the shifted polynomial is the same as for the unshifted one. This is a clear renaming/restatement of a known result rather than a genuinely new prediction. No self-citation is involved. A separate, non-circularity issue is that for H=1 and H=2 the displayed constant term is non-integral for odd B, so the polynomial cannot generate integer primes under the stated domain; this is a correctness concern but does not change the circularity score. The score of 6 reflects that the central claim reduces by construction to a known result, while the underlying mathematics (Rabinowitsch, class-number connection, Bateman-Horn) is external and real rather than fabricated.
Assumptions & free parameters
free parameters (2)
- Zk
- H =
Heegner numbers (e.g., 7, 11, 19, 43, 67, 163)
assumptions (2)
- domain assumption Bateman-Horn conjecture
- domain assumption Heegner numbers correspond to imaginary quadratic fields with class number one
Cite this review
Pith. "Pith review of Redefining Euler-Rabinowitsch Polynomials with Heegner Number Based Quadratic Formulation." pith.science (2026). https://pith.science/paper/ELQIN45I
@misc{pith2026250802821,
author = {Pith},
title = {Pith review of: Redefining Euler-Rabinowitsch Polynomials with Heegner Number Based Quadratic Formulation},
year = {2026},
howpublished = {\url{https://pith.science/paper/ELQIN45I}},
note = {Machine review of arXiv:2508.02821}
}
abstract
This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This form is closely related to the Euler-Rabinowitsch polynomials through specific substitutions. The structure enables algebraic tuning for prime-rich outputs and provides deeper insight into the impact of Heegner numbers on prime distribution. Using tools such as the Bateman-Horn conjecture and prime-counting functions, we demonstrate that this family can be optimized to generate a high density of primes. This work offers new directions for research in analytic number theory and potential applications in cryptography and signal processing.
Forward citations
Cited by 1 Pith paper
-
Elucidating the Role of Feature Normalization in IJEPA
The abstract proposes replacing layer normalization with DynTanh in IJEPA to preserve token energy and reports improved ImageNet and depth metrics, but the full text is a different paper.
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.