About: Fermat quotient     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FFermat_quotient

In number theory, the Fermat quotient of an integer a with respect to an odd prime p is defined as: or . This article is about the former. For the latter see p-derivation. The quotient is named after Pierre de Fermat. If the base a is coprime to the exponent p then Fermat's little theorem says that qp(a) will be an integer. If the base a is also a generator of the multiplicative group of integers modulo p, then qp(a) will be a cyclic number, and p will be a full reptend prime.

AttributesValues
rdfs:label
  • Fermat quotient
  • Частное Ферма
rdfs:comment
  • In number theory, the Fermat quotient of an integer a with respect to an odd prime p is defined as: or . This article is about the former. For the latter see p-derivation. The quotient is named after Pierre de Fermat. If the base a is coprime to the exponent p then Fermat's little theorem says that qp(a) will be an integer. If the base a is also a generator of the multiplicative group of integers modulo p, then qp(a) will be a cyclic number, and p will be a full reptend prime.
  • В теории чисел частным Ферма для целого a ≥ 2 по простой базе p называется дробь Если a взаимно просто с p, то малая теорема Ферма утверждает, что qp(a) будет целым. Частное названо в честь Пьера Ферма.
foaf:isPrimaryTopicOf
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In number theory, the Fermat quotient of an integer a with respect to an odd prime p is defined as: or . This article is about the former. For the latter see p-derivation. The quotient is named after Pierre de Fermat. If the base a is coprime to the exponent p then Fermat's little theorem says that qp(a) will be an integer. If the base a is also a generator of the multiplicative group of integers modulo p, then qp(a) will be a cyclic number, and p will be a full reptend prime.
  • В теории чисел частным Ферма для целого a ≥ 2 по простой базе p называется дробь Если a взаимно просто с p, то малая теорема Ферма утверждает, что qp(a) будет целым. Частное названо в честь Пьера Ферма.
prov:wasDerivedFrom
page length (characters) of wiki page
is foaf:primaryTopic of
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git51 as of Sep 16 2020


Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3319 as of Dec 29 2020, on Linux (x86_64-centos_6-linux-glibc2.12), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2021 OpenLink Software