{"title":"关于囚徒问题的无限版本","authors":"Attila Losonczi","doi":"arxiv-2409.09064","DOIUrl":null,"url":null,"abstract":"We investigate some versions of the famous 100 prisoner problem for the\ninfinite case, where there are infinitely many prisoners and infinitely many\nboxes with labels. In this case, many questions can be asked about the\nadmissible steps of the prisoners, the constraints they have to follow and also\nabout the releasing conditions. We will present and analyze many cases. In the\ninfinite case, the solutions and methods require mainly analysis rather than\ncombinatorics.","PeriodicalId":501502,"journal":{"name":"arXiv - MATH - General Mathematics","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On infinite versions of the prisoner problem\",\"authors\":\"Attila Losonczi\",\"doi\":\"arxiv-2409.09064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate some versions of the famous 100 prisoner problem for the\\ninfinite case, where there are infinitely many prisoners and infinitely many\\nboxes with labels. In this case, many questions can be asked about the\\nadmissible steps of the prisoners, the constraints they have to follow and also\\nabout the releasing conditions. We will present and analyze many cases. In the\\ninfinite case, the solutions and methods require mainly analysis rather than\\ncombinatorics.\",\"PeriodicalId\":501502,\"journal\":{\"name\":\"arXiv - MATH - General Mathematics\",\"volume\":\"6 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - General Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.09064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - General Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.09064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We investigate some versions of the famous 100 prisoner problem for the
infinite case, where there are infinitely many prisoners and infinitely many
boxes with labels. In this case, many questions can be asked about the
admissible steps of the prisoners, the constraints they have to follow and also
about the releasing conditions. We will present and analyze many cases. In the
infinite case, the solutions and methods require mainly analysis rather than
combinatorics.