{"title":"希尔伯特的第三个问题","authors":"D. Erman","doi":"10.1090/mbk/121/68","DOIUrl":null,"url":null,"abstract":"for 21 Mar 2013 In 1900 David Hilbert proposed a famous list of 23 open problems. The third problem asked: Given two polyhedra of equal volume, can you always cut the first one into finitely many pieces (with scissors) and reassemble the pieces to form the second? This problem was the first of these problems to be solved, by Hilbert's own student Max Dehn. The answer was \" no \". I will discuss a modern, simplified version of Dehn's proof.","PeriodicalId":423691,"journal":{"name":"100 Years of Math Milestones","volume":"743 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hilbert’s third problem\",\"authors\":\"D. Erman\",\"doi\":\"10.1090/mbk/121/68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"for 21 Mar 2013 In 1900 David Hilbert proposed a famous list of 23 open problems. The third problem asked: Given two polyhedra of equal volume, can you always cut the first one into finitely many pieces (with scissors) and reassemble the pieces to form the second? This problem was the first of these problems to be solved, by Hilbert's own student Max Dehn. The answer was \\\" no \\\". I will discuss a modern, simplified version of Dehn's proof.\",\"PeriodicalId\":423691,\"journal\":{\"name\":\"100 Years of Math Milestones\",\"volume\":\"743 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"100 Years of Math Milestones\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/mbk/121/68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"100 Years of Math Milestones","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/mbk/121/68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
for 21 Mar 2013 In 1900 David Hilbert proposed a famous list of 23 open problems. The third problem asked: Given two polyhedra of equal volume, can you always cut the first one into finitely many pieces (with scissors) and reassemble the pieces to form the second? This problem was the first of these problems to be solved, by Hilbert's own student Max Dehn. The answer was " no ". I will discuss a modern, simplified version of Dehn's proof.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
