This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Büchi's_problem
rdf:type
yago:Part113809207 yago:Word106286395 yago:Form106290637 yago:Relation100031921 yago:WikicatQuadraticForms yago:Abstraction100002137 yago:LanguageUnit106284225 dbo:Disease
rdfs:label
Büchi's problem
rdfs:comment
In number theory, Büchi's problem, also known as the n squares' problem, is an open problem named after the Swiss mathematician Julius Richard Büchi. It asks whether there is a positive integer M such that every sequence of M or more integer squares, whose second difference is constant and equal to 2, is necessarily a sequence of squares of the form (x + i)2, i = 1, 2, ..., M,... for some integer x. In 1983, observed that Büchi's problem is equivalent to the following: Does there exist a positive integer M such that, for all integers x and a, the quantity (x + n)2 + a cannot be a square for more than M consecutive values of n, unless a = 0?
dcterms:subject
dbc:Squares_in_number_theory dbc:Unsolved_problems_in_mathematics dbc:Quadratic_forms dbc:Number_theory
dbo:wikiPageID
24471842
dbo:wikiPageRevisionID
1108571964
dbo:wikiPageWikiLink
dbc:Unsolved_problems_in_mathematics dbr:Decidability_(logic) dbr:Number_theory dbr:Leonard_Lipshitz dbr:Bombieri–Lang_conjecture dbr:First-order_logic dbr:Saunders_Mac_Lane dbr:Yuri_Matiyasevich dbc:Squares_in_number_theory dbc:Quadratic_forms dbr:Paul_Vojta dbr:Julius_Richard_Büchi dbc:Number_theory dbr:Douglas_Hensley dbr:Hilbert's_tenth_problem dbr:Quadratic_form
owl:sameAs
wikidata:Q5005256 freebase:m.080bcnc n16:4e4yq
dbp:wikiPageUsesTemplate
dbt:Unsolved dbt:Short_description
dbo:abstract
In number theory, Büchi's problem, also known as the n squares' problem, is an open problem named after the Swiss mathematician Julius Richard Büchi. It asks whether there is a positive integer M such that every sequence of M or more integer squares, whose second difference is constant and equal to 2, is necessarily a sequence of squares of the form (x + i)2, i = 1, 2, ..., M,... for some integer x. In 1983, observed that Büchi's problem is equivalent to the following: Does there exist a positive integer M such that, for all integers x and a, the quantity (x + n)2 + a cannot be a square for more than M consecutive values of n, unless a = 0?
gold:hypernym
dbr:Problem
prov:wasDerivedFrom
wikipedia-en:Büchi's_problem?oldid=1108571964&ns=0
dbo:wikiPageLength
5428
foaf:isPrimaryTopicOf
wikipedia-en:Büchi's_problem