feat(NumberTheory): decide, #eval and norm_num for Carmichael numbers - #43965
YaelDillies wants to merge 1 commit into
Conversation
…umbers Provide both an efficient decidability instance and a `norm_num` extension to decide whether a given literal is a Carmichael number. This lets us prove that 561 is the smallest Carmichael number "in a computationally efficient manner". Generated by Claude Opus in several rounds of review to optimise various parts of the algorithms and make sure that the decidability instance works for both `#eval` and `decide`. I haven't made much of an effort to clean the proofs (existing proofs internal to `norm_num` read like garbage to me anyway). From FormalConjectures Assisted-by: Claude Opus 5.1
PR summary a12253a4c6Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
!bench |
|
Benchmark results for a12253a against f61f3ed are in. No significant results found. @SnirBroshi
Small changes (2🟥)
|
Provide both an efficient decidability instance and a
norm_numextension to decide whether a given literal is a Carmichael number.This lets us prove that 561 is the smallest Carmichael number "in a computationally efficient manner".
Generated by Claude Opus in several rounds of review to optimise various parts of the algorithms and make sure that the decidability instance works for both
#evalanddecide. I haven't made much of an effort to clean the proofs (existing proofs internal tonorm_numread like garbage to me anyway).From FormalConjectures
Assisted-by: Claude Opus 5.1