Перевод: с английского на русский

с русского на английский

fermat+number

См. также в других словарях:

  • Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 …   Wikipedia

  • Fermat, Pierre de — born Aug. 17, 1601, Beaumont de Lomagne, France died Jan. 12, 1665, Castres French mathematician. Of Basque origin, Fermat studied law at Toulouse and developed interests in foreign languages, Classical literature, ancient science, and… …   Universalium

  • Fermat'sche Primzahl — Eine Fermat Zahl, benannt nach dem französischen Mathematiker Pierre de Fermat, ist eine Zahl der Form wobei n eine natürliche Zahl ist. Die ersten Fermat Zahlen sind 3, 5, 17, 257, 65537, … (Folge A000215 in OEIS) Eine Fermat Zahl, die… …   Deutsch Wikipedia

  • Fermat-Zahl — Eine Fermat Zahl, benannt nach dem französischen Mathematiker Pierre de Fermat, ist eine Zahl der Form wobei n eine nichtnegative ganze Zahl ist. Die ersten Fermat Zahlen sind 3, 5, 17, 257, 65537, … (Folge A000215 in OEIS) Eine Fermat Zahl, die… …   Deutsch Wikipedia

  • Fermat's Last Theorem — is the name of the statement in number theory that:: It is impossible to separate any power higher than the second into two like powers,or, more precisely:: If an integer n is greater than 2, then the equation a^n + b^n = c^n has no solutions in… …   Wikipedia

  • Fermat's little theorem — (not to be confused with Fermat s last theorem) states that if p is a prime number, then for any integer a , a^p a will be evenly divisible by p . This can be expressed in the notation of modular arithmetic as follows::a^p equiv a pmod{p},!A… …   Wikipedia

  • Fermat's factorization method — is based on the representation of an odd integer as the difference of two squares: :N = a^2 b^2. That difference is algebraically factorable as (a+b)(a b); if neither factor equals one, it is a proper factorization of N .Each odd number has such… …   Wikipedia

  • Fermat's spiral — (also known as a parabolic spiral) follows the equation:r = pm heta^{1/2},in polar coordinates (the more general Fermat s spiral follows r 2 = a 2 theta; .) It is a type of Archimedean spiral. [mathworld|urlname=FermatsSpiral |title=Fermat… …   Wikipedia

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • number theory — Math. the study of integers and their relation to one another. Also called theory of numbers. [1910 15] * * * Branch of mathematics concerned with properties of and relations among integers. It is a popular subject among amateur mathematicians… …   Universalium

  • Fermat primality test — The Fermat primality test is a probabilistic test to determine if a number is probably prime. ConceptFermat s little theorem states that if p is prime and 1 le a < p, then :a^{p 1} equiv 1 pmod{p}If we want to test if p is prime, then we can pick …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»