Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or

show password
Forgot Password?

Don't have an account?  Sign up 
Sign up using Clever
or

Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.


Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Prime Numbers

YGK These Statements About Prime Numbers

QuestionAnswer
The principle that every integer >1 has a unique prime factorization Fundamental theorem of arithmetic
The theorem stating there are infinitely many prime numbers Euclid’s theorem
Theorem stating \(a^{p}\equiv a\quad (\mod p)\) for prime \(p\) Fermat’s little theorem
Composite numbers that function as "false positives" for Fermat’s little theorem Carmichael numbers
The generalization of Fermat’s little theorem for composite numbers Euler’s theorem
Theorem stating \((p-1)!\equiv -1\quad (\mod p)\) if and only if \(p\) is prime Wilson’s theorem
Theorem linking even perfect numbers to Mersenne primes Euclid–Euler theorem
A prime number of the form \(2^{p}-1\) Mersenne prime
Theorem stating \(\pi (n)\) is approximately \(n/\ln n\) Prime number theorem
Cryptosystem based on the difficulty of factoring large prime products RSA algorithm
Primes of the form \(2p+1\), where \(p\) is also prime Safe primes
Mathematician who first studied primes of the form \(2p+1\) Sophie Germain
Claim that every even integer > 2 is the sum of two primes Strong Goldbach conjecture
Claim that every odd integer > 5 is the sum of three primes Weak Goldbach conjecture
Mathematician who proved the weak Goldbach conjecture in 2013 Harald Helfgott
Claim that all non-trivial zeros of the zeta function have real part 1/2 Riemann hypothesis
Author of “On the Number of Primes Less Than a Given Magnitude” Bernhard Riemann
Claim that there are infinitely many pairs of primes with a gap of 2 Twin prime conjecture
Mathematician who first proved a finite bound on infinitely occurring prime gaps Yitang Zhang
Created by: ahumanbeing
Popular Quiz Bowl sets

 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards