2000 character limit reached
Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications
Published 12 Nov 2007 in cs.CR | (0711.1856v2)
Abstract: This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested for ternary representation with similar results. Some applications of this result to cryptography are discussed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.