The Normalization M_n = V_n/b for Lucas Sequences: A Critical Re-examination with Corrected Claims and New Results

We examine a recent proposal to normalize the Lucas sequence of the second kind, M_n = V_n/b, where Vn belongs to the characteristic quadratic x^2 - bx - d = 0 (D = b^2 + 4d), together with the novelty claims accompanying it. Our assessment is mixed, and we report both corrections and genuinely new results. (i) The generalized Cassini identity M_(n+1) M_(n-1) - M_n^2 = (D/b2)(-d)^(n-1) is a special case of a general identity valid for every second-order recurrence and arbitrary initial conditions: X_(n+1)X_(n-1) - X_n^2 = (b X_0 X_1 + d X_0^2 - X_1^2)(-d)^(n-1). We give a three-line proof and a unified table of the resulting constants for six derived sequences N_n, M_n, and the triad Sn = N_n + M_n, R_n = _Nn - M_n, P_n = N_n M_n. (ii) The reported higher prime-term density of M-derived sequences is not reproducible for the parameter pairs stated in the source, (b,d) = (2,8) and (3,12), whose terms from N_2 onward are all even (respectively, all divisible by 3); the reported figures reproduce exactly for the classical Jacobsthal pair (1,2), for which M_n = 2^n + (-1)^n combines Mersenne-type and Fermat-type terms. We prove structural rules: Nn prime implies n prime (with a single degenerate exception when b = ±1), while Mn prime requires n prime or a power of two. Numerically we confirm the Lagarias density 2/3 for prime divisors of first-kind sequences. (iii) The binomial representation of M_n, with the factor n/(n-k) and the 1/b normalization, appears to be genuinely new and constitutes the principal surviving claim of the original work. (iv) The Pell-type identity b2 M_n^2 - D N_n^2 = 4(-d)^n is the classical identity V_n^2 - D N_n^2 = 4(-d)^n in rescaled coordinates; the worked example (b,d) = (36,1) reproduces the fundamental unit 18 + 5·√13 of Q(√13). (v) The proposed PRNG based on the linear recurrence is cryptographically insecure: two consecutive outputs suffice to reconstruct the full two-sided output stream, and the Berlekamp–Massey algorithm recovers the minimal recurrence from 2L outputs. The 'controlled periodicity of fractional terms' carries zero entropy. We recommend withdrawing all cryptographic claims. (vi) The triple convergence of the term ratio, the ratio of partial sums, and the geometric mean of ratios to √D/b is a combination of Cesàro's theorem and the Stolz–Cesàro theorem. However, the three modes converge at sharply different rates: exponentially for the first two, and only as O(1/n) for the geometric mean. We derive the explicit second-order asymptotics gmn = (√D/b) · exp(C/(n-1) + O_(n-2)), with an explicitly computable constant C = Σ_k≥2 log((1+r^k)/(1-r^k)), r = |x_2/x_1|, and verify it to four significant digits for six parameter families - a refinement that appears to be new. We conclude with a corrected novelty assessment and concrete recommendations for the underlying article.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24414938
Primary Topic
Advanced Mathematical Theories and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Normalization M_n = V_n/b for Lucas Sequences: A Critical Re-examination with Corrected Claims and New Results

Юрий Васильев
Zenodo (CERN European Organization for Nuclear Research)
Advanced Mathematical Theories and Applications
preprint

The Normalization M_n = V_n/b for Lucas Sequences: A Critical Re-examination with Corrected Claims and New Results

Юрий Васильев
preprint en

Abstract

We examine a recent proposal to normalize the Lucas sequence of the second kind, M_n = V_n/b, where Vn belongs to the characteristic quadratic x^2 - bx - d = 0 (D = b^2 + 4d), together with the novelty claims accompanying it. Our assessment is mixed, and we report both corrections and genuinely new results. (i) The generalized Cassini identity M_(n+1) M_(n-1) - M_n^2 = (D/b2)(-d)^(n-1) is a special case of a general identity valid for every second-order recurrence and arbitrary initial conditions: X_(n+1)X_(n-1) - X_n^2 = (b X_0 X_1 + d X_0^2 - X_1^2)(-d)^(n-1). We give a three-line proof and a unified table of the resulting constants for six derived sequences N_n, M_n, and the triad Sn = N_n + M_n, R_n = _Nn - M_n, P_n = N_n M_n. (ii) The reported higher prime-term density of M-derived sequences is not reproducible for the parameter pairs stated in the source, (b,d) = (2,8) and (3,12), whose terms from N_2 onward are all even (respectively, all divisible by 3); the reported figures reproduce exactly for the classical Jacobsthal pair (1,2), for which M_n = 2^n + (-1)^n combines Mersenne-type and Fermat-type terms. We prove structural rules: Nn prime implies n prime (with a single degenerate exception when b = ±1), while Mn prime requires n prime or a power of two. Numerically we confirm the Lagarias density 2/3 for prime divisors of first-kind sequences. (iii) The binomial representation of M_n, with the factor n/(n-k) and the 1/b normalization, appears to be genuinely new and constitutes the principal surviving claim of the original work. (iv) The Pell-type identity b2 M_n^2 - D N_n^2 = 4(-d)^n is the classical identity V_n^2 - D N_n^2 = 4(-d)^n in rescaled coordinates; the worked example (b,d) = (36,1) reproduces the fundamental unit 18 + 5·√13 of Q(√13). (v) The proposed PRNG based on the linear recurrence is cryptographically insecure: two consecutive outputs suffice to reconstruct the full two-sided output stream, and the Berlekamp–Massey algorithm recovers the minimal recurrence from 2L outputs. The 'controlled periodicity of fractional terms' carries zero entropy. We recommend withdrawing all cryptographic claims. (vi) The triple convergence of the term ratio, the ratio of partial sums, and the geometric mean of ratios to √D/b is a combination of Cesàro's theorem and the Stolz–Cesàro theorem. However, the three modes converge at sharply different rates: exponentially for the first two, and only as O(1/n) for the geometric mean. We derive the explicit second-order asymptotics gmn = (√D/b) · exp(C/(n-1) + O_(n-2)), with an explicitly computable constant C = Σ_k≥2 log((1+r^k)/(1-r^k)), r = |x_2/x_1|, and verify it to four significant digits for six parameter families - a refinement that appears to be new. We conclude with a corrected novelty assessment and concrete recommendations for the underlying article.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Mathematical Theories and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon