Guess a Number-with Lying (Q3325513)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3856871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Guess a Number-with Lying |
scientific article; zbMATH DE number 3856871 |
Statements
Guess a Number-with Lying (English)
0 references
1984
0 references
0.8730592727661133
0 references
0.8729206919670105
0 references
0.8562910556793213
0 references
A semiexpository account of the problem, proposed by S. M. Ulam, of determining an integer x, 1\(\leq x\leq n\), by asking questions of the form ''Is \(x\leq a?''\) when the Responder is allowed to lie at most one time. If \(n\sim 2^ k/(k+1)\) then roughly k questions suffice.
0 references