<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-24T10:14:50Z</responseDate>
  <request identifier="19936" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:19936</identifier>
        <datestamp>2024-05-29T09:43:30Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>No Tiling of the 70 × 70 Square with Consecutive Squares</dc:title>
          <dc:creator>Sgall, Jiří</dc:creator>
          <dc:creator>Balogh, János</dc:creator>
          <dc:creator>Békési, József</dc:creator>
          <dc:creator>Dósa, György</dc:creator>
          <dc:creator>Hvattum, Lars Magnus</dc:creator>
          <dc:creator>Tuza, Zsolt</dc:creator>
          <dc:subject>square packing</dc:subject>
          <dc:subject>Gardner’s problem</dc:subject>
          <dc:subject>combinatorial proof</dc:subject>
          <dc:description>The total area of the 24 squares of sizes 1,2,…,24 is equal to the area of the 70× 70 square. Can this equation be demonstrated by a tiling of the 70× 70 square with the 24 squares of sizes 1,2,…,24? The answer is "NO", no such tiling exists. This has been demonstrated by computer search. However, until now, no proof without use of computer was given. We fill this gap and give a complete combinatorial proof.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jiří Sgall and János Balogh and József Békési and György Dósa and Lars Magnus Hvattum and Zsolt Tuza</dc:contributor>
          <dc:date>2024</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 291, 12th International Conference on Fun with Algorithms (FUN 2024)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FUN.2024.28</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-199362</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.28</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
