{"schema_version":"ocme-site-results-v1","locale":"zh-Hant","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-fermat-little-theorem"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-fermat-little-theorem-01","title":{"zh-Hant":"模7的Fermat證書與合數邊界","en":"Fermat modulo 7 and a composite boundary"},"summary":{"zh-Hant":"(−2)^6≡1 mod7；倍數7只可用a^7≡a版本；通過測試不證質數。","en":"(-2)^6 is congruent to 1 modulo 7; for multiples of 7, only the congruence a^7≡a modulo 7 applies; passing a Fermat test does not prove primality."},"mko_ids":["mko-fermat-little-theorem"]}],"title":"概念推導導讀"}