About: Elementary proof

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

About: Elementary proof Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:TelevisionShow, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FElementary_proof

In mathematics, an elementary proof is a mathematical proof that only uses basic techniques. More specifically, the term is used in number theory to refer to proofs that make no use of complex analysis. Historically, it was once thought that certain theorems, like the prime number theorem, could only be proved by invoking "higher" mathematical theorems or techniques. However, as time progresses, many of these results have also been subsequently reproven using only elementary techniques.

Attributes	Values
rdf:type	yago:WikicatMathematicalProofs yago:Abstraction100002137 yago:Argument106648724 yago:Communication100033020 yago:Evidence106643408 yago:Indication106797169 yago:MathematicalProof106647864 yago:Proof106647614 television show
rdfs:label	Prueba elemental (es) Elementary proof (en)
rdfs:comment	In mathematics, an elementary proof is a mathematical proof that only uses basic techniques. More specifically, the term is used in number theory to refer to proofs that make no use of complex analysis. Historically, it was once thought that certain theorems, like the prime number theorem, could only be proved by invoking "higher" mathematical theorems or techniques. However, as time progresses, many of these results have also been subsequently reproven using only elementary techniques. (en) En matemáticas, una prueba elemental es un demostración que solo usa técnicas básicas. Más específicamente, el término se utiliza en teoría de números para referirse a pruebas que no hacen uso de análisis complejo. Durante algún tiempo se pensó que ciertos teoremas, como el teorema de los números primos, solo podían probarse usando matemáticas "superiores". Sin embargo, con el tiempo, muchos de estos resultados han sido reprobados utilizando solo técnicas elementales. (es)
dcterms:subject	Mathematical proofs Elementary mathematics
Wikipage page ID	9318685 (xsd:integer)
Wikipage revision ID	1108316366 (xsd:integer)
Link from a Wikipage to another Wikipage	Prime number theorem Annals of Mathematics Paul Erdős Peano axioms Riemann hypothesis Wiles's proof of Fermat's Last Theorem Complex analysis Analytic function Mathematical induction Mathematics Mathematical object G. H. Hardy Conjecture Theorem Harvey Friedman Fermat's Last Theorem Number theory Mathematical proof Jacques Hadamard Mathematical proofs Tetration Atle Selberg Elementary mathematics Axiom Integer Root of a function Charles Jean de la Vallée-Poussin Riemann's zeta function Mathematical jargon
sameAs	Elementary proof Elementary proof Elementary proof Elementary proof Elementary proof Elementary proof Elementary proof Elementary proof
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Main dbt:Quote dbt:Reflist dbt:Mathematical_logic
has abstract	En matemáticas, una prueba elemental es un demostración que solo usa técnicas básicas. Más específicamente, el término se utiliza en teoría de números para referirse a pruebas que no hacen uso de análisis complejo. Durante algún tiempo se pensó que ciertos teoremas, como el teorema de los números primos, solo podían probarse usando matemáticas "superiores". Sin embargo, con el tiempo, muchos de estos resultados han sido reprobados utilizando solo técnicas elementales. Aunque el significado no siempre se ha definido con precisión, el término se utiliza comúnmente en la jerga matemática. Una prueba elemental no es necesariamente simple, en el sentido de ser fácil de entender: algunas pruebas elementales pueden ser bastante complicadas. (es) In mathematics, an elementary proof is a mathematical proof that only uses basic techniques. More specifically, the term is used in number theory to refer to proofs that make no use of complex analysis. Historically, it was once thought that certain theorems, like the prime number theorem, could only be proved by invoking "higher" mathematical theorems or techniques. However, as time progresses, many of these results have also been subsequently reproven using only elementary techniques. While there is generally no consensus as to what counts as elementary, the term is nevertheless a common part of the mathematical jargon. An elementary proof is not necessarily simple, in the sense of being easy to understand or trivial. In fact, some elementary proofs can be quite complicated — and this is especially true when a statement of notable importance is involved. (en)
gold:hypernym	Proof
prov:wasDerivedFrom	wikipedia-en:Elementary_proof?oldid=1108316366&ns=0
page length (characters) of wiki page	5538 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Elementary_proof
is Link from a Wikipage to another Wikipage of	Prime number theorem Elementary Number Theory, Group Theory and Ramanujan Graphs David Hilbert List of mathematical jargon Paul Erdős Elementary Elementary Proof Proof of Bertrand's postulate 0.999... Combinatorial proof Édouard Lucas Mathematics Made Difficult Banach–Alaoglu theorem Number theory Dirichlet's theorem on arithmetic progressions Atle Selberg Cannonball problem Synthetic geometry
is Wikipage redirect of	Elementary Proof
is Wikipage disambiguates of	Elementary
is foaf:primaryTopic of	wikipedia-en:Elementary_proof

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 (62 GB total memory, 46 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software