Install
Search focused Mathematics content
Indexes tuned to notation
4Mathematics is a search engine built specifically for Mathematics. It combines multiple indexes, algorithms, and AI systems to return results that respect mathematical notation, proofs, and domain context. Use the site to find research papers, lecture notes, definitions, software, and products related to mathematics. Results are filtered and ranked to reduce noise common to general-purpose search engines and to surface authoritative mathematical content. Part of the 4SEARCH network of topic specific search engines.
Zero knowlege proof of compositeness
10+ hour, 4+ min ago (521+ words) A zero knowledge proof (ZKP) answers a question without revealing anything more than answer. For example, a digital signature proves your possession of a private key without revealing that key. You can think of Fermat's primality test as a zero knowledge proof. For example, I can convince you that the following number is composite without telling you what its factors are. Fermat's little theorem'says that if'n'is a prime and'b'is not a multiple of'n, then A number'b such that bn1" 1 (mod'n) is a proof that'n is not prime, i.e. n is composite. So, for example,'b = 2 is a proof that'n above is composite. This can be verified very quickly using Python: I tried the smallest possible base [1] and it worked. In general you may have to try a few bases. And for a few rare numbers (Carmichael numbers) you won't be able to…...