Phi of n is bounded by n minus the square root of n if n is
If n is "highly" this, then there is another number between n and 2n that is also "highly" this type of number. Phi of n is bounded by n minus the square root of n if n is one of these numbers and phi is the totient function. If n is one of these, then n minus one factorial is not congruent to negative one, mod n, by Wilson's theorem. If there is a number n between 1 and x such that n to the x is not congruent to n mod x, then x is one of these numbers. Since Carmichael numbers are this type of number, the converse of Fermat's Little Theorem does not hold. For 10 points, name this type of number that has positive divisors other than one and itself and is thus not prime.
If n is "highly" this, then there is another number between n and 2n that is also "highly" this type of number.
highly composite numbers