The alleged proof of gcd(F_n, (n+1)!)=2 collapses because F_n is simply the Kurepa factorial and the key lemma is the conjecture itself.
Journal of Combinatorial Theory, Series A102(1), 63–87 (2003)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Partition Functions and Kurepa Decomposition I: Algebraic computation and some physical Applications
The alleged proof of gcd(F_n, (n+1)!)=2 collapses because F_n is simply the Kurepa factorial and the key lemma is the conjecture itself.