mod c form centrelink
Primality Proving 3.3: Combined Tests - The Prime Pages
U(n+1) ≡ 0 (mod n), and; gcd(U((n+1)/p), n) = 1. Pocklington's theorem tells us that if (I) is true, then each prime factor q of n has the form k·F1+1.
Learn more
MARC 21 to MODS 3.7 Mapping - DRAFT
MARC 21 Mapping to MODS Version 3.7 (Metadata Object Description Schema: MODS) ... 007/00 code f, <form authority="marccategory">tactile material.
Learn more