Kurepa’s hypothesis asserts that for each integer the greatest
common divisor of and is . Motivated by an
equivalent formulation of this hypothesis involving derangement numbers, here
we give a formulation of Kurepa’s hypothesis in terms of divisibility of any
Kurepa’s determinant of order
by a prime . In the previous version of this article we have proposed
the strong Kurepa’s hypothesis involving a general Kurepa’s determinant
with any integer . We prove the even part'' of this hypothesis which can be considered as a generalization of Kurepa's hypothesis. However, by using a congruence for $K_n$ involving the derangement number $S_{n-1}$ with an odd integer $n\ge 9$, we find that the integer $11563=31\times 373$ is a counterexample to the odd composite part’’ of strong Kurepa’s hypothesis.
We also present some remarks, divisibility properties and computational
results closely related to the questions on Kurepa’s hypothesis involving
derangement numbers and Bell numbers.

生成讲解博客的中文版本

生成AI智能校验的中文版本