{"paper":{"title":"Primality Test for Numbers of the Form Ap^n+w","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chang Lv, Yingpu Deng","submitted_at":"2013-06-19T14:16:00Z","abstract_excerpt":"We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\\equiv1\\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\\log_2(M)$ for fixed $p$ and $A$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4562","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}