
Supplementary code and data for the paper "The Lucas Prime Criterion: A Deterministic Test for Primality of Lucas Numbers". This repository contains Python and CUDA implementations for verifying the criterion, along with pre-computed verification results for primes p < 100,000. The criterion enables verification that L_5466311 (1,142,281 digits) is prime in 14.31 GPU-hours.
Extended verification to p < 150,000 (13,803 primes) confirmed zero counterexamples. Detailed per-prime results for p < 100,000 are included in verification_results_100k.csv.
computational mathematics, number theory, primality testing, Lucas numbers
computational mathematics, number theory, primality testing, Lucas numbers
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
