{"title":"最佳矩形包装为70平方","authors":"Brian Laverty, T. Murphy","doi":"10.2478/rmm-2018-0001","DOIUrl":null,"url":null,"abstract":"Abstract Gardner asked whether it was possible to tile/pack the squares 1×1,…, 24×24 in a 70×70 square. Arguments that it is impossible have been given by Bitner–Reingold and more recently by Korf–Mofitt–Pollack. Here we outline a simpler algorithm, which we hope could be used to give an alternative and more direct proof in the future. We also derive results of independent interest concerning such packings.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Rectangle Packing for the 70 Square\",\"authors\":\"Brian Laverty, T. Murphy\",\"doi\":\"10.2478/rmm-2018-0001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Gardner asked whether it was possible to tile/pack the squares 1×1,…, 24×24 in a 70×70 square. Arguments that it is impossible have been given by Bitner–Reingold and more recently by Korf–Mofitt–Pollack. Here we outline a simpler algorithm, which we hope could be used to give an alternative and more direct proof in the future. We also derive results of independent interest concerning such packings.\",\"PeriodicalId\":120489,\"journal\":{\"name\":\"Recreational Mathematics Magazine\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Recreational Mathematics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/rmm-2018-0001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Recreational Mathematics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/rmm-2018-0001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract Gardner asked whether it was possible to tile/pack the squares 1×1,…, 24×24 in a 70×70 square. Arguments that it is impossible have been given by Bitner–Reingold and more recently by Korf–Mofitt–Pollack. Here we outline a simpler algorithm, which we hope could be used to give an alternative and more direct proof in the future. We also derive results of independent interest concerning such packings.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
