About: Jordan's totient function

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Jordan's totient function Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

Let be a positive integer. In number theory, Jordan's totient function of a positive integer equals the number of -tuples of positive integers that are less than or equal to and that together with form a coprime set of integers. Jordan's totient function a generalization of Euler's totient function, which is given by . The function is named after Camille Jordan.

Attributes	Values
rdfs:label	Jordan's totient function (en)
rdfs:comment	Let be a positive integer. In number theory, Jordan's totient function of a positive integer equals the number of -tuples of positive integers that are less than or equal to and that together with form a coprime set of integers. Jordan's totient function a generalization of Euler's totient function, which is given by . The function is named after Camille Jordan. (en)
sameAs	Jordan's totient function Jordan's totient function
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Cite_web dbt:OEIS2C dbt:Reflist dbt:Totient
Subject	Modular arithmetic Multiplicative functions
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Jordan's_totient_function?oldid=1054065293&ns=0
Wikipage page ID	19486387 (xsd:integer)
page length (characters) of wiki page	5781 (xsd:nonNegativeInteger)
Wikipage revision ID	1054065293 (xsd:integer)
Link from a Wikipage to another Wikipage	Möbius inversion formula Number theory American Mathematical Society Average order of an arithmetic function Tuple Camille Jordan General linear group Generating function Modular arithmetic Multiplicative functions Dirichlet convolution Dedekind psi function Springer Science+Business Media Coprime integers History of the Theory of Numbers On-Line Encyclopedia of Integer Sequences Special linear group Graduate Texts in Mathematics Symplectic group Euler's totient function Multiplicative function History of numbers
has abstract	Let be a positive integer. In number theory, Jordan's totient function of a positive integer equals the number of -tuples of positive integers that are less than or equal to and that together with form a coprime set of integers. Jordan's totient function a generalization of Euler's totient function, which is given by . The function is named after Camille Jordan. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Jordan's_totient_function
is Wikipage redirect of	Jordan totient function
is Link from a Wikipage to another Wikipage of	Arithmetic function Camille Jordan Dirichlet convolution Dirichlet series Dedekind psi function Lambert series Euler's totient function Jordan totient function
is known for of	Camille Jordan
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Jordan's_totient_function

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software