arXiv (All)
open access
Parallel Searching Method for Verifying Finiteness of Prime Numbers Presented as Specific Linear Combinations of Factorials
As a new approach to search a counterexample of variants of Kurepa's conjecture, we investigate a parallel searching method of prime numbers $p$ satisfying \begin{eqnarray*} \sum_{k=0}^{p-1} c_k k! \equiv 0 \pmod{p} \end{eqnarray*} for a given integer sequence $(c_k)_{k=0}^{\infty}$. As an applicati
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Solution to the Erdos problem on distinct residues of factorials#926015
- Probabilistic algorithm for testing primality#490237
- The Superiority of Hilbert Arithmetic for Prime Number Theory: I Goldbach's conjecture proved in Hilbert arithmetic#86810
- The ab2 Conjecture -Vô Conjecture 5 series 4 (VC5S4)#204081
- On finite $β$-expansions for the set of natural numbers#1110106
Record · ID 1076461
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive