language:

Find link is a tool written by Edward Betts.Longer titles found: Sophie Germain's theorem (view), Sophie Germain Counter Mode (view), Sophie Germain Prize (view), Safe and Sophie Germain primes (view), Lycée Sophie Germain (view)

searching for Sophie Germain 65 found (211 total)

alternate case: sophie Germain

5000 (number)
(1,220 words)
[view diff]
exact match in snippet
view article

thousand is the largest isogrammic numeral in the English language. 5003 – Sophie Germain prime 5020 – amicable number with 5564 5021 – super-prime, twin prime7000 (number) (911 words) [view diff] exact match in snippet view article

number 7043 – Sophie Germain prime 7056 = 842 7057 – cuban prime of the form x = y + 1, super-prime 7073 – Leyland number 7079 – Sophie Germain prime, safe6000 (number) (1,280 words) [view diff] exact match in snippet view article

6101 – Sophie Germain prime 6105 – triangular number 6113 – Sophie Germain prime, super-prime 6121 – prime of the form 2p-1 6131 – Sophie Germain prime9000 (number) (810 words) [view diff] exact match in snippet view article

centered octagonal number 9029 – Sophie Germain prime 9041 – super-prime 9045 – triangular number 9059 – Sophie Germain prime 9072 – decagonal number 90774000 (number) (1,598 words) [view diff] exact match in snippet view article

square and n-queens problem for n = 20. 4013 – balanced prime 4019 – Sophie Germain prime 4027 – super-prime 4028 – sum of the first 45 primes 4030 – third8000 (number) (944 words) [view diff] exact match in snippet view article

8059 – super-prime 8069 – Sophie Germain prime 8093 – Sophie Germain prime 8100 = 902 8101 – super-prime 8111 – Sophie Germain prime 8117 – super-prime2000 (number) (3,397 words) [view diff] exact match in snippet view article

numerals (MM). 2001 – sphenic number 2002 – palindromic number 2003 – Sophie Germain prime and the smallest prime number in the 2000s 2005 – A vertically3000 (number) (1,793 words) [view diff] exact match in snippet view article

Singmaster's conjecture) 3019 – super-prime, happy prime 3023 – 84th Sophie Germain prime, 51st safe prime 3025 = 552, sum of the cubes of the first ten743 (number) (137 words) [view diff] exact match in snippet view article

number following 742 and preceding 744. It is a prime number. 743 is a Sophie Germain prime, because 2 × 743 + 1 = 1487 is also prime. There are exactly 7431000 (number) (4,609 words) [view diff] exact match in snippet view article

30, 35, 40, 45, 50, 55, 60, 65, 70, 75 (and 202 other bases). 1013 – Sophie Germain prime, centered square number, Mertens function zero 1014 – Mertens233 (number) (236 words) [view diff] exact match in snippet view article

number following 232 and preceding 234. 233 is a prime number, 233 is a Sophie Germain prime, a Pillai prime, and a Ramanujan prime. It is a Fibonacci number911 (number) (142 words) [view diff] exact match in snippet view article

the integer following 910 and preceding 912. It is a prime number, a Sophie Germain prime and the sum of three consecutive primes (293 + 307 + 311). ItDickson's conjecture (288 words) [view diff] exact match in snippet view article find links to article

twin primes (n and 2 + n are primes), and there are infinitely many Sophie Germain primes (n and 1 + 2n are primes). Dickson's conjecture is further extendedList of mathematical identities (152 words) [view diff] exact match in snippet view article find links to article

identity Pfister's sixteen-square identity Sherman–Morrison formula Sophie Germain identity Sun's curious identity Sylvester's determinant identity Vandermonde'sPrimeGrid (1,824 words) [view diff] exact match in snippet view article find links to article

manual project. TPS has since been completed, while the search for Sophie Germain primes continues. In the summer of 2007, the Cullen and Woodall primePollard's p − 1 algorithm (1,220 words) [view diff] exact match in snippet view article find links to article

concept of safe primes, being primes for which p − 1 is two times a Sophie Germain prime q and thus minimally smooth. These primes are sometimes construed179 (number) (206 words) [view diff] exact match in snippet view article

prime, as it is one more than two times the prime 89. It is also a Sophie Germain prime, as the prime 359 is one more than two times 179. It is only the359 (number) (109 words) [view diff] exact match in snippet view article

preceding 360. 359 is the 72nd prime number. 359 is a Sophie Germain prime: 2(359)+1=719 (also a Sophie Germain prime.) 359 is also the international callingHarvey Dubner (213 words) [view diff] exact match in snippet view article find links to article

special forms: repunits, prime Fibonacci and Lucas numbers, twin primes, Sophie Germain primes, Belphegor's prime, and primes in arithmetic progression. In251 (number) (326 words) [view diff] exact match in snippet view article

natural number between 250 and 252. It is also a prime number. 251 is: a Sophie Germain prime. the sum of three consecutive primes (79 + 83 + 89) and seven53 (number) (523 words) [view diff] exact match in snippet view article

Fifty-three is the 16th prime number. It is also an Eisenstein prime, and a Sophie Germain prime. The sum of the first 53 primes is 5830, which is divisible by83 (number) (494 words) [view diff] exact match in snippet view article

following 79 (of which it is also a cousin prime) and preceding 89. a Sophie Germain prime. a safe prime. a Chen prime. an Eisenstein prime with no imaginary113 (number) (428 words) [view diff] exact match in snippet view article

preceding 127), so it can only be divided by one and itself. 113 is a Sophie Germain prime, a Chen prime and a Proth prime as it is a prime number of the600 (number) (2,365 words) [view diff] exact match in snippet view article

Harshad number, number of acres in a square mile 641= prime number, Sophie Germain prime, factor of 4294967297 (the smallest nonprime Fermat number), Chen131 (number) (538 words) [view diff] exact match in snippet view article

thirty-one) is the natural number following 130 and preceding 132. 131 is a Sophie Germain prime, an irregular prime, the second 3-digit palindromic prime, and173 (number) (553 words) [view diff] exact match in snippet view article

number. a balanced prime. an Eisenstein prime with no imaginary part. a Sophie Germain prime. an inconsummate number. the sum of 2 squares: 22 + 132. the sum29 (number) (826 words) [view diff] exact match in snippet view article

thirty-one, which is also a primorial prime. Twenty-nine is also the sixth Sophie Germain prime. 29 is the sum of three consecutive squares, 22 + 32 + 42. 29List of number theory topics (938 words) [view diff] exact match in snippet view article find links to article

Brun's constant Cousin prime Prime triplet Prime quadruplet Sexy prime Sophie Germain prime Cunningham chain Goldbach's conjecture Goldbach's weak conjecture700 (number) (2,504 words) [view diff] exact match in snippet view article

Brooklyn, NY and Bronx, NY 719 = prime number, factorial prime (6! − 1), Sophie Germain prime, safe prime, sum of seven consecutive primes (89 + 97 + 101 +Repdigit (1,696 words) [view diff] exact match in snippet view article find links to article

previous conjecture, Resta, Marcus, Grantham, and Graves found examples of Sophie Germain primes that are Brazilian, the first one is 28792661 = 1111173. The23 (number) (2,073 words) [view diff] exact match in snippet view article

the third base-10 repunit prime exponent after 2 and 19. The fifth Sophie Germain prime and the fourth safe prime, 23 is the next to last member of the281 (number) (116 words) [view diff] exact match in snippet view article

281 is the 60th prime, twin prime with 283, Sophie Germain prime, sum of the first fourteen primes, sum of seven consecutive primes (29 + 31 + 37 + 41227 (number) (323 words) [view diff] exact match in snippet view article

a safe prime, as dividing it by two and rounding down produces the Sophie Germain prime 113. It is also a regular prime, a Pillai prime, a Stern prime239 (number) (490 words) [view diff] exact match in snippet view article

forms a pair of twin primes; hence, it is also a Chen prime. 239 is a Sophie Germain prime and a Newman–Shanks–Williams prime. It is an Eisenstein prime41 (number) (682 words) [view diff] exact match in snippet view article

12th supersingular prime a Newman–Shanks–Williams prime. the smallest Sophie Germain prime to start a Cunningham chain of the first kind of three terms,400 (number) (4,046 words) [view diff] exact match in snippet view article

Protocol status code for "Teapot" as an April Fools' joke. A prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part, highly cototient30,000 (609 words) [view diff] exact match in snippet view article find links to article

primorial 30203 – safe prime 30240 – harmonic divisor number 30323 – Sophie Germain prime and safe prime 30420 – pentagonal pyramidal number 30694 – open191 (number) (680 words) [view diff] exact match in snippet view article

10 Part of a prime quadruplet of four primes: 191, 193, 197, and 199 Sophie Germain prime Strong prime Twin prime that differs from another prime number89 (number) (592 words) [view diff] exact match in snippet view article

83 and preceding 97. a Chen prime. a Pythagorean prime. the smallest Sophie Germain prime to start a Cunningham chain of the first kind of six terms, {891776 in philosophy (28 words) [view diff] exact match in snippet view article find links to article

Wealth of Nations (1776) Thomas Paine, Common Sense (1776) United States Declaration of Independence Sophie Germain August 25 - David Hume (born 1711)2 (1,333 words) [view diff] exact match in snippet view article find links to article

and three are the only two consecutive prime numbers. 2 is the first Sophie Germain prime, the first factorial prime, the first Lucas prime, and the first11 (number) (2,941 words) [view diff] exact match in snippet view article

octiamonds can be folded to form a regular octahedron. 11 is the fourth Sophie Germain prime, the third safe prime, the fourth Lucas prime, the first repunit800 (number) (2,151 words) [view diff] exact match in snippet view article

3 × 269 808 = 23 × 101, strobogrammatic number 809 = prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part 810 = 2 ×900 (number) (2,581 words) [view diff] exact match in snippet view article

Group Identifiers for books published in Finland 953 = prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part, centered43,112,609 (408 words) [view diff] exact match in snippet view article find links to article

GF(2) found in 2016. and were the four largest in 2011. 43,112,609 is a Sophie Germain prime, the largest of only eight known Mersenne prime indexes to have290 (number) (280 words) [view diff] exact match in snippet view article

to π {\displaystyle \pi } , repdigit in base 8 (444). 293 is prime, Sophie Germain prime, Chen prime, Irregular prime, Eisenstein prime with no imaginary500 (number) (3,727 words) [view diff] exact match in snippet view article

(113 + 127 + 131 + 137). 509 is: a prime number. a Sophie Germain prime, smallest Sophie Germain prime to start a 4-term Cunningham chain of the first26th European Film Awards (132 words) [view diff] exact match in snippet view article find links to article

Bakhtiari Kaveh Bakhtiari Elisa Garbar, Heinz Dill, Olivier Charvet, Sophie Germain The Missing Picture L'image manquante Rithy Panh Rithy Panh Catherine1816 (2,037 words) [view diff] exact match in snippet view article find links to article

1854 (E. Walker, 1849) p321 Louis L. Bucciarelli and Nancy Dworsky, Sophie Germain: An Essay in the History of the Theory of Elasticity (Springer, 2012)100,000,000 (962 words) [view diff] exact match in snippet view article find links to article

repunit, square root of 12345678987654321 111,111,113 – Chen prime, Sophie Germain prime, cousin prime. 113,379,904 = 106482 = 4843 = 226 115,856,201 =3 (3,007 words) [view diff] exact match in snippet view article find links to article

Fermat prime (22n + 1). the first Mersenne prime (2n − 1). the second Sophie Germain prime. the second Mersenne prime exponent. the second factorial primeOrders of magnitude (numbers) (9,233 words) [view diff] exact match in snippet view article

Mathematics: 18,543,637,900,515 × 2666,667 − 1 is a 200,701-digit Sophie Germain prime; the largest known as of April 2012[update]. Mathematics: approximatelyCompleting the square (2,864 words) [view diff] no match in snippet view article find links to article

{\displaystyle x^{4}+4a^{4}=(x^{2}+2ax+2a^{2})(x^{2}-2ax+2a^{2})} (Also known as Sophie-Germain Identity). Narasimhan, Revathi (2008). Precalculus: Building ConceptsClosing the Gap: The Quest to Understand Prime Numbers (619 words) [view diff] exact match in snippet view article find links to article

the existence and uniqueness of prime factorizations, almost primes, Sophie Germain primes, Pythagorean triples, and Szemerédi's theorem and its connections5 (6,206 words) [view diff] exact match in snippet view article find links to article

constructible with compass and an unmarked straightedge. Five is the third Sophie Germain prime, the first safe prime, the third Catalan number, and the thirdPrimality test (3,706 words) [view diff] exact match in snippet view article find links to article

of their paper), which can be further reduced to Õ((log n)6) if the Sophie Germain conjecture is true. Subsequently, Lenstra and Pomerance presented aAKS primality test (2,441 words) [view diff] exact match in snippet view article find links to article

rather loose; a widely-held conjecture about the distribution of the Sophie Germain primes would, if true, immediately cut the worst case down to O ~ (Rader's FFT algorithm (1,166 words) [view diff] exact match in snippet view article find links to article

actually require O(N2) time[dubious – discuss]. Such Nj are called Sophie Germain primes, and such a sequence of them is called a Cunningham chain ofSecure Remote Password protocol (2,528 words) [view diff] exact match in snippet view article find links to article

and N = 2q + 1 are chosen such that both are prime (which makes q a Sophie Germain prime and N a safe prime). N must be large enough so that computingPerfect number (4,476 words) [view diff] exact match in snippet view article find links to article

yield a remainder of 1 when divided by 11. Furthermore, whenever p is a Sophie Germain prime—that is, 2p + 1 is also prime—and 2p + 1 is congruent to 1 orDiffie–Hellman key exchange (4,233 words) [view diff] exact match in snippet view article find links to article

of the Pohlig–Hellman algorithm to obtain a or b. For this reason, a Sophie Germain prime q is sometimes used to calculate p = 2q + 1, called a safe primeList of integer sequences (14 words) [view diff] exact match in snippet view article find links to article

3511} Primes p {\displaystyle p} satisfying 2p−1 ≡ 1 (mod p2). A005384 Sophie Germain primes {2, 3, 5, 11, 23, 29, 41, 53, 83, 89, ...} A prime number p suchBunyakovsky conjecture (1,937 words) [view diff] exact match in snippet view article find links to article

polynomials are x {\displaystyle x} and x + 6 {\displaystyle x+6} ), Sophie Germain primes (when k = 2 {\displaystyle k=2} , and the two polynomials areList of distributed computing projects (4,695 words) [view diff] exact match in snippet view article find links to article

Cullen-Woodall primes, Proth prime, prime Sierpinski numbers, and Sophie Germain primes. Subprojects also include Seventeen or Bust, and the Riesel problemHélène Brion (2,611 words) [view diff] exact match in snippet view article find links to article

with her grandmother. She studied at the Ecole Primaire Supérieure Sophie Germain in Paris to become a teacher. Unions had been authorized in 1884, but