prime product
41Twin prime conjecture — The twin prime conjecture is a famous unsolved problem in number theory that involves prime numbers. It states:: There are infinitely many primes p such that p + 2 is also prime. Such a pair of prime numbers is called a prime twin. The conjecture …
42Splitting of prime ideals in Galois extensions — In mathematics, the interplay between the Galois group G of a Galois extension L of a number field K, and the way the prime ideals P of the ring of integers OK factorise as products of prime ideals of OL, provides one of the richest parts of… …
43Cartesian product of graphs — In graph theory, the cartesian product G ◻ H of graphs G and H is a graph such that * the vertex set of G ◻ H is the cartesian product V(G) × V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G ◻ H if and only if either ** u = v and …
44Optimus Prime — Dieser Artikel behandelt die Action Figuren Transformers, die Artikel zu den gleichnamigen Verfilmungen finden sich unter Transformers (Film) und Transformers – Der Kampf um Cybertron. Die Transformers (jap. トランスフォーマー, Toransufōmā, dt.… …
45Euler product — In number theory, an Euler product is an infinite product expansion, indexed by prime numbers p , of a Dirichlet series. The name arose from the case of the Riemann zeta function, where such a product representation was proved by Euler.In general …
46Pierpont prime — A Pierpont prime is a prime number of the form:2^u 3^v + 1,for some nonnegative integers u and v . They are named after the mathematician James Pierpont.It is possible to prove that if v = 0 and u > 0, then u must be a power of 2, making the… …
47Twin prime — A twin prime is a prime number that differs from another prime number by two. Except for the pair (2, 3), this is the smallest possible difference between two primes. Some examples of twin prime pairs are (3, 5), (5, 7), (11, 13), (17, 19), (29,… …
48Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… …
49Strong prime — In mathematics, a strong prime is a prime number with certain special properties. The definitions of strong primes are different in cryptography and number theory. Definition in cryptography In cryptography, a prime number p is strong if the… …
50Wieferich prime — In number theory, a Wieferich prime is a prime number p such that p 2 divides 2 p − 1 − 1; compare this with Fermat s little theorem, which states that every odd prime p divides 2 p − 1 − 1. Wieferich primes were first described by Arthur… …
