Science Quiz / Mathematical Theorems

Random Science or Math Quiz

Can you name the mathematical theorems?

Quiz not verified by Sporcle

How to PlayForced Order
Also try: 30 Second Math II
Challenge
Share
Tweet
Embed
Score 0/16 Timer 16:00
DescriptionTheorem
If p is prime, then a^p is congruent to a (mod p)
If G is a finite group and H is a subgroup of G, then the order of H divides the order of G
A polynomial f(x) has a factor (x-k) if and only if f(k) = 0
The equation x^n+y^n=z^n has no nontrivial integer solutions when n > 2
Every non-self-intersecting closed curve in the plane divides the plane into a distinct inside and outside
For all real numbers x and y, |x+y| is less than or equal to |x| + |y|
Every sufficiently large even integer can be written either as the sum of two primes, or as the sum of a prime and a semiprime
The number of primes less than n is asymptotic to n/(ln n)
DescriptionTheorem
Every simply connected, closed 3-manifold is homeomorphic to the 3-sphere
There is no general solution in radicals to polynomial equations of degree 5 or higher
Every natural number greater than 1 either is prime or can be expressed uniquely (up to order) as a product of primes.
If n is a natural number greater than 1, there exists a prime p such that n < p < 2n
If a real-valued function f is continuous on [a,b] and differentiable on (a,b) and f(a) = f(b), there exists c in (a,b) such that f'(c) = 0
If a real-valued function f is continuous on the interval [a,b], then f assumes a maximum and minimum value on that interval
If a and b are the lengths of the legs of a right triangle and c is the length of the hypotenuse, then a^2+b^2=c^2
There exist arbitrarily long arithmetic sequences of primes

You're not logged in!

Compare scores with friends on all Sporcle quizzes.
Sign Up with Email
OR
Log In

You Might Also Like...

Show Comments

Extras


Your Account Isn't Verified!

In order to create a playlist on Sporcle, you need to verify the email address you used during registration. Go to your Sporcle Settings to finish the process.