Search Results for ""

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

The reciprocity theorem for x^8=q (mod p).

A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...

R^n is homeomorphic to R^m iff n=m. This theorem was first proved by Brouwer.

The two-dimensional version of the ham sandwich theorem.

A Fermat pseudoprime to a base a, written psp(a), is a composite number n such that a^(n-1)=1 (mod n), i.e., it satisfies Fermat's little theorem. Sometimes the requirement ...

The Diophantine equation x^2+y^2=p can be solved for p a prime iff p=1 (mod 4) or p=2. The representation is unique except for changes of sign or rearrangements of x and y. ...

If J is a simple closed curve in R^2, the closure of one of the components of R^2-J is homeomorphic with the unit 2-ball. This theorem may be proved using the Riemann mapping ...

The bicommutant theorem is a theorem within the field of functional analysis regarding certain topological properties of function algebras. The theorem says that, given a ...

In 1638, Fermat proposed that every positive integer is a sum of at most three triangular numbers, four square numbers, five pentagonal numbers, and n n-polygonal numbers. ...