DBpedia 2015-10

Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hexagonal_tortoise_problem> ?p ?o }

Showing triples 1 to 38 of 38 with 100 triples per page.

Hexagonal_tortoise_problem abstract "The hexagonal tortoise problem (Korean: 지수귀문도, Chinese: 地數龜文圖, a.k.a. jisuguimundo, jisugwimundo) was invented by Korean aristocrat and mathematician Seok-jeong Choi, who lived from 1646 to 1715. It is a mathematical problem that involves a hexagonal lattice, like the hexagonal pattern on some tortoises' shells, to the (N) vertices of which must be assigned integers (from 1 to N) in such a way that the sum of all integers at the vertices of each hexagon is the same. The problem has apparent similarities to a magic square although it is a vertex-magic format rather than an edge-magic form or the more typical rows-of-cells form.His book, Gu-Su-Ryak, contains many interesting mathematical discoveries. Below is his original magic hexagonal tortoise pattern. All the sums of six numbers of each hexagon are the same number, 93. The magic sum varies if the numbers 1 through 30 are rearranged. For example, the magic sum could be 77 through 109.File:Hexagonal-tortoise-problem.png".
Hexagonal_tortoise_problem thumbnail Hexagonal-tortoise-problem.png?width=300.
Hexagonal_tortoise_problem wikiPageID "30467835".
Hexagonal_tortoise_problem wikiPageLength "1730".
Hexagonal_tortoise_problem wikiPageOutDegree "6".
Hexagonal_tortoise_problem wikiPageRevisionID "582193541".
Hexagonal_tortoise_problem wikiPageWikiLink Category:Recreational_mathematics.
Hexagonal_tortoise_problem wikiPageWikiLink Gu-Su-Ryak.
Hexagonal_tortoise_problem wikiPageWikiLink Magic_square.
Hexagonal_tortoise_problem wikiPageWikiLink Seok-jeong_Choi.
Hexagonal_tortoise_problem wikiPageWikiLink Vertex_(geometry).
Hexagonal_tortoise_problem wikiPageWikiLink File:Hexagonal-tortoise-problem.png.
Hexagonal_tortoise_problem wikiPageWikiLinkText "Hexagonal tortoise problem".
Hexagonal_tortoise_problem wikiPageWikiLinkText "hexagonal tortoise problem".
Hexagonal_tortoise_problem colwidth "20".
Hexagonal_tortoise_problem hasPhotoCollection Hexagonal_tortoise_problem.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Cite_conference.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Lang-ko.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Lang-zh.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Numtheory-stub.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Refbegin.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Refend.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Reflist.
Hexagonal_tortoise_problem wikiPageUsesTemplate Template:Sfn.
Hexagonal_tortoise_problem subject Category:Recreational_mathematics.
Hexagonal_tortoise_problem type Article.
Hexagonal_tortoise_problem type Article.
Hexagonal_tortoise_problem type Field.
Hexagonal_tortoise_problem comment "The hexagonal tortoise problem (Korean: 지수귀문도, Chinese: 地數龜文圖, a.k.a. jisuguimundo, jisugwimundo) was invented by Korean aristocrat and mathematician Seok-jeong Choi, who lived from 1646 to 1715. It is a mathematical problem that involves a hexagonal lattice, like the hexagonal pattern on some tortoises' shells, to the (N) vertices of which must be assigned integers (from 1 to N) in such a way that the sum of all integers at the vertices of each hexagon is the same.".
Hexagonal_tortoise_problem label "Hexagonal tortoise problem".
Hexagonal_tortoise_problem sameAs 지수귀문도.
Hexagonal_tortoise_problem sameAs Jisugwimundo.
Hexagonal_tortoise_problem sameAs m.0g5q2ms.
Hexagonal_tortoise_problem sameAs Q11272615.
Hexagonal_tortoise_problem sameAs Q11272615.
Hexagonal_tortoise_problem wasDerivedFrom Hexagonal_tortoise_problem?oldid=582193541.
Hexagonal_tortoise_problem depiction Hexagonal-tortoise-problem.png.
Hexagonal_tortoise_problem isPrimaryTopicOf Hexagonal_tortoise_problem.