A simple solution to Ulam's liar game with one lie

Simple item page
dc.creatorOsthus, Deryk
dc.creatorWatkinson, Rachel
dc.date2007-05-09
dc.date.accessioned2026-07-07T08:00:18Z
dc.date.available2026-07-07T08:00:18Z
dc.descriptionUlam asked for the maximum number of questions required to determine an integer between one and one million by asking questions whose answer is `Yes' or `No' and where one untruthful answer is allowed. Pelc showed that the number of questions required is 25. Here we give a simple proof of this result.
dc.identifierhttps://arxiv.org/abs/0705.1220
dc.identifierhttp://arxiv.org/abs/0705.1220
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128640
dc.subjectCombinatorics
dc.subject94B99
dc.titleA simple solution to Ulam's liar game with one lie
dc.typetext

Files

Collections

arXiv