Both are written as exponentiation modulo a composite number, and both are related to the problem of prime factorization.
42.
No known composite numbers satisfy Wolstenholme's theorem and it is conjectured that there are none ( see below ).
43.
As there are arbitrarily long runs of composite numbers, there are therefore also arbitrarily long runs of composite Fibonacci numbers.
44.
Its complement is to determine whether a number is a composite number ( a number which is not prime ).
45.
A property that is shared by a large proportion of numbers, such as being a composite number, is not interesting.
46.
The requirement for at least 23090 composite numbers between the 11 primes makes it appear extremely hard to find a CPAP-11.
47.
It is a program that is used to rapidly presieve a set of candidate numbers, removing those that are definitely composite numbers.
48.
Likewise, the integers 2 and 3 are not composite numbers because each of them can only be divided by one and itself.
49.
Saying that the sequence of exponents is non-increasing is equivalent to saying that a highly composite number is a product of primorials.
50.
Tonelli Shanks cannot be used for composite moduli; finding square roots modulo composite numbers is a computational problem equivalent to integer factorization.
