Unsolved problems in number theory | Classes of prime numbers

Safe and Sophie Germain primes

In number theory, a prime number p is a Sophie Germain prime if 2p + 1 is also prime. The number 2p + 1 associated with a Sophie Germain prime is called a safe prime. For example, 11 is a Sophie Germain prime and 2 × 11 + 1 = 23 is its associated safe prime. Sophie Germain primes are named after French mathematician Sophie Germain, who used them in her investigations of Fermat's Last Theorem. Sophie Germain primes and safe primes have applications in public key cryptography and primality testing. It has been conjectured that there are infinitely many Sophie Germain primes, but this remains unproven. (Wikipedia).

Video thumbnail

Sophie Germain - Mathematics for the Modern Age #SoME2

Sophie Germain (1776-1831) was a French mathematician who made huge contributions to physics with her foundational work on elasticity theory, revolutionised mathematics with her work on calculus and… gave Schrödinger the tools he needed to formulate his wave equation for quantum mechanics!

From playlist Summer of Math Exposition 2 videos

Video thumbnail

#MegaFavNumbers - The Largest Sophie Germain Prime

This video is part of the #MegaFavNumbers project. Much of the information was taken from Simon Singh's book: Fermat's Last Theorem. Steve Mould's video on Chladni Figures https://www.youtube.com/watch?v=CR_XL192wXw #MegaFavNumbers playlist https://www.youtube.com/playlist?list=PLar4u0

From playlist MegaFavNumbers

Video thumbnail

Magnets and Antigravity!!!

Physics (la physique)

From playlist physics

Video thumbnail

Je suis Sophie Germain, femme et mathématicienne

Découvrez la vie de Sophie Germain (1776-1831) à travers ce film réalisé à l'occasion de la sortie de la bande-dessinée "Les Audaces de Sophie Germain" (E. Tartaglini - A. Fillipini - A. Ferrari, éditions Petit à petit, Docu-BD, 2021). Retrouvez également ce film et des posters à travers

From playlist Les audaces de Sophie Germain

Video thumbnail

CTNT 2020 - Computations in Number Theory (by Alvaro Lozano-Robledo) - Lecture 2

The Connecticut Summer School in Number Theory (CTNT) is a summer school in number theory for advanced undergraduate and beginning graduate students, to be followed by a research conference. For more information and resources please visit: https://ctnt-summer.math.uconn.edu/

From playlist CTNT 2020 - Computations in Number Theory Research

Video thumbnail

Fermat's Last Theorem - The Theorem and Its Proof: An Exploration of Issues and Ideas [1993]

supplement to the video: http://www.msri.org/realvideo/ln/msri/1993/outreach/fermat/1/banner/01.html Date: July 28, 1993 (08:00 AM PDT - 09:00 AM PDT) Fermat's Last Theorem July 28, 1993, Robert Osserman, Lenore Blum, Karl Rubin, Ken Ribet, John Conway, and Lee Dembart. Musical interlude

From playlist Number Theory

Video thumbnail

CTNT 2020 - A virtual tour of SageMath

This video is part of a series of videos on "Computations in Number Theory Research" that are offered as a mini-course during CTNT 2020. In this video, we take a virtual tour of SageMath, the open software in Mathematics paying special attention to its number theory capabilities. Please cl

From playlist CTNT 2020 - Computations in Number Theory Research

Video thumbnail

4.) Quiz #1

From playlist Open Q&A

Related pages

PrimeGrid | Order (group theory) | Sophie Germain Counter Mode | Integer factorization | AKS primality test | Finite field | Full reptend prime | G. H. Hardy | Primitive root modulo n | Infinite set | Quadratic residue | Conjecture | Group (mathematics) | Fermat's Last Theorem | Number | Discrete logarithm records | Strong prime | Congruence relation | Dickson's conjecture | Mathematical proof | Twin prime conjecture | Pollard's p − 1 algorithm | Twin prime | Diffie–Hellman key exchange | Cryptography | RSA (cryptosystem) | Schinzel's hypothesis H | Mersenne number | Composite number | Galois/Counter Mode | Bateman–Horn conjecture | Natural number | Pocklington primality test | Mersenne prime | Modulo operation | Discrete logarithm | Sophie Germain | Cunningham chain | Number theory | Integer sequence | Lucas–Lehmer–Riesel test | Twin Prime Search | Prime number | Least common multiple | Subgroup | Parity (mathematics) | Leonhard Euler | Modular arithmetic