About: Erdős–Fuchs theorem

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

About: Erdős–Fuchs theorem Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Theorem106752293, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FErd%C5%91s%E2%80%93Fuchs_theorem&invfp=IFP_OFF&sas=SAME_AS_OFF

In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of elements of a given additive basis, stating that the average order of this number cannot be too close to being a linear function. The theorem is named after Paul Erdős and Wolfgang Heinrich Johannes Fuchs, who published it in 1956.

Attributes	Values
rdf:type	yago:WikicatTheoremsInCombinatorics yago:WikicatTheoremsInNumberTheory yago:Abstraction100002137 yago:Communication100033020 yago:Message106598915 yago:Proposition106750804 yago:Statement106722453 yago:Theorem106752293
rdfs:label	Erdős–Fuchs theorem (en) Théorème d'Erdős-Fuchs (fr) Teorema de Erdős–Fuchs (pt)
rdfs:comment	In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of elements of a given additive basis, stating that the average order of this number cannot be too close to being a linear function. The theorem is named after Paul Erdős and Wolfgang Heinrich Johannes Fuchs, who published it in 1956. (en) Le théorème d'Erdős-Fuchs, en théorie combinatoire des nombres, a pour objet le nombre de façons de représenter un entier naturel n comme somme de deux éléments d'un ensemble donné. Il établit que la moyenne de Cesàro de cette fonction de n ne peut pas tendre « très vite » vers une constante non nulle. (fr) Em matemática, na área de teoria aditiva dos números, o Teorema de Erdős–Fuchs é um teorema sobre o número de formas que um número pode ser representado como a soma de dois elementos de um determinado conjunto, afirmando que a ordem média desse número não pode ser muito próximo de uma função linear. O nome deste teorema vem de Paul Erdős e Wolfgang Heinrich Johannes Fuchs, que publicaram sua prova em 1956. (pt)
dcterms:subject	Theorems in number theory Theorems in combinatorics Paul Erdős
Wikipage page ID	18543655 (xsd:integer)
Wikipage revision ID	1087229425 (xsd:integer)
Link from a Wikipage to another Wikipage	Pál Turán Bob Vaughan Hugh Lowell Montgomery Paul Erdős Paul T. Bateman Theorems in number theory Mathematics G. H. Hardy Concave function Convex function Erdős–Turán conjecture on additive bases Slowly varying function Additive basis Additive number theory Theorems in combinatorics Linear function Erdős–Tetali theorem András Sárközy Graduate Texts in Mathematics Paul Erdős Square number Natural number Wolfgang Heinrich Johannes Fuchs Springer-Verlag dbr:Gábor_Horváth_(mathematician)
sameAs	Erdős–Fuchs theorem Erdős–Fuchs theorem Erdős–Fuchs theorem Erdős–Fuchs theorem Erdős–Fuchs theorem Erdős–Fuchs theorem
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Reflist dbt:Short_description
has abstract	In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of elements of a given additive basis, stating that the average order of this number cannot be too close to being a linear function. The theorem is named after Paul Erdős and Wolfgang Heinrich Johannes Fuchs, who published it in 1956. (en) Le théorème d'Erdős-Fuchs, en théorie combinatoire des nombres, a pour objet le nombre de façons de représenter un entier naturel n comme somme de deux éléments d'un ensemble donné. Il établit que la moyenne de Cesàro de cette fonction de n ne peut pas tendre « très vite » vers une constante non nulle. (fr) Em matemática, na área de teoria aditiva dos números, o Teorema de Erdős–Fuchs é um teorema sobre o número de formas que um número pode ser representado como a soma de dois elementos de um determinado conjunto, afirmando que a ordem média desse número não pode ser muito próximo de uma função linear. O nome deste teorema vem de Paul Erdős e Wolfgang Heinrich Johannes Fuchs, que publicaram sua prova em 1956. (pt)
gold:hypernym	Statement
prov:wasDerivedFrom	wikipedia-en:Erdős–Fuchs_theorem?oldid=1087229425&ns=0
page length (characters) of wiki page	10112 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Erdős–Fuchs_theorem
is Link from a Wikipage to another Wikipage of	Additive basis Jur Hronec Erdős–Tetali theorem Erdos–Fuchs theorem Erdős-Fuchs theorem Hans-Egon Richert Imre Z. Ruzsa Klaus Roth Wolfgang Heinrich Johannes Fuchs Sequences (book) List of things named after Paul Erdős Erdos-Fuchs theorem
is Wikipage redirect of	Erdos–Fuchs theorem Erdős-Fuchs theorem Erdos-Fuchs theorem
is foaf:primaryTopic of	wikipedia-en:Erdős–Fuchs_theorem

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software