Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5005256> ?p ?o }
Showing triples 1 to 16 of
16
with 100 triples per page.
- Q5005256 subject Q7217289.
- Q5005256 subject Q8613711.
- Q5005256 abstract "Büchi's problem, also known as the n squares' problem, is an open problem from number theory 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, Douglas Hensley 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?".
- Q5005256 wikiPageWikiLink Q12479.
- Q5005256 wikiPageWikiLink Q140045.
- Q5005256 wikiPageWikiLink Q4055684.
- Q5005256 wikiPageWikiLink Q430001.
- Q5005256 wikiPageWikiLink Q441223.
- Q5005256 wikiPageWikiLink Q707119.
- Q5005256 wikiPageWikiLink Q7217289.
- Q5005256 wikiPageWikiLink Q736753.
- Q5005256 wikiPageWikiLink Q8613711.
- Q5005256 wikiPageWikiLink Q92672.
- Q5005256 wikiPageWikiLink Q986147.
- Q5005256 comment "Büchi's problem, also known as the n squares' problem, is an open problem from number theory 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.".
- Q5005256 label "Büchi's problem".