The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word " pseudoprime " in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas pseudoprimes, extra strong Lucas pseudoprimes and Perrin pseudoprimes. Though these tests represent a wealth of ideas,… (More)
We investigate the problem of finding integers k such that appending any number of copies of the base-ten digit d to k yields a composite number. In particular, we prove that there exist infinitely many integers co-prime to all digits such that repeatedly appending any digit yields a composite number.
Mathematics is the queen of sciences and number theory is the queen of mathematics. But why is it computer science? It turns out to be critical for cryptography!