---
title: A participant conceals an integer between 1 and 64 inclusive and res… — Olympiad: thinking like a machine, Beb… · tree and pragmatics
description: A participant conceals an integer between 1 and 64 inclusive and responds only "yes" or "no". Ascertain the least number of questions which is always sufficient. Exam question 1 of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI course of Mova's primary school, with the d
---

<!-- md -->
[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e1/)

<!-- crumbs -->
[home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [questions](https://md.mova.elamur.ai/free/en/corpora/questions/) / [AI](https://md.mova.elamur.ai/free/en/corpora/questions/ai/) / [Olympiad: thinking like a machine, Beb…](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/) / e1

# Exam question 1 · Olympiad: thinking like a machine, Bebras puzzles ★★★

<!-- .ven lang=en -->
A participant conceals an integer between 1 and 64 inclusive and responds only "yes" or "no". Ascertain the least number of questions which is always sufficient.

<!-- .vintro -->
**Mova's choice:** option 1 · **The right answer:** option 3 · wrong ✗ · **Who acts:** participant, you, questions · **What happens:** conceal, respond, ascertain, be · **To what, where:** integer, 1, no, least number

<!-- .vabout -->
This is exam question 1 of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI course of Mova's primary school, asked in stiff, formal language. The page gives the question's syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause, then the 4 options as the student saw them, each with its tree and pragmatics. Every text is parsed by Mova itself. How the student answered it, with the score of every option and why: [the test at school](https://md.mova.elamur.ai/free/en/school-run/ai/31-olympiad-thinking-like-a-machine/#e1).

## The question {#question}

<!-- .note -->
*Sentence 1:* A participant conceals an integer between 1 and 64 inclusive and responds only "yes" or "no".

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e1:1
# text = A participant conceals an integer between 1 and 64 inclusive and responds only "yes" or "no".
1	A	a	DET	DT	Definite=Ind|PronType=Art	2	det	_	_
2	participant	participant	NOUN	NN	Number=Sing	3	nsubj	_	_
3	conceals	conceal	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
4	an	a	DET	DT	Definite=Ind|PronType=Art	5	det	_	_
5	integer	integer	NOUN	NN	Number=Sing	3	obj	_	_
6	between	between	ADP	IN	_	7	case	_	_
7	1	1	NUM	CD	NumForm=Digit|NumType=Card	5	nmod	_	_
8	and	and	CCONJ	CC	_	9	cc	_	_
9	64	64	NUM	CD	NumForm=Digit|NumType=Card	7	conj	_	_
10	inclusive	inclusive	ADJ	JJ	Degree=Pos	3	xcomp	_	_
11	and	and	CCONJ	CC	_	12	cc	_	_
12	responds	respond	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	conj	_	_
13	only	only	ADV	RB	_	19	advmod	_	_
14	"	"	PUNCT	``	_	19	punct	_	SpaceAfter=No
15	yes	yes	INTJ	UH	Polarity=Pos	19	discourse	_	SpaceAfter=No
16	"	"	PUNCT	''	_	15	punct	_	_
17	or	or	CCONJ	CC	_	19	cc	_	_
18	"	"	PUNCT	``	_	19	punct	_	SpaceAfter=No
19	no	no	NOUN	NN	Number=Sing	12	obl	_	SpaceAfter=No
20	"	"	PUNCT	''	_	19	punct	_	SpaceAfter=No
21	.	.	PUNCT	.	_	3	punct	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **conceal** | present | a participant | a integer |  | 1 |  | inclusive *property* | vn concealment-16 «NP V NP PP.location»: agent=Agent integer=Patient between 1=Location |
| 2 | **respond** *speech: other* | present | a participant *not said here* | no |  |  |  |  | vn respond-113 «NP V»: agent=Agent |

<!-- .note -->
One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree.

<!-- .note -->
*Sentence 2:* Ascertain the least number of questions which is always sufficient.

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e1:2
# text = Ascertain the least number of questions which is always sufficient.
1	Ascertain	ascertain	VERB	VB	Mood=Imp|VerbForm=Fin	0	root	_	_
2	the	the	DET	DT	Definite=Def|PronType=Art	4	det	_	_
3	least	least	ADJ	JJS	Degree=Sup	4	amod	_	_
4	number	number	NOUN	NN	Number=Sing	1	obj	_	_
5	of	of	ADP	IN	_	6	case	_	_
6	questions	question	NOUN	NNS	Number=Plur	4	nmod	_	_
7	which	which	PRON	WDT	PronType=Rel	10	nsubj	_	_
8	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	10	cop	_	_
9	always	always	ADV	RB	PronType=Tot	10	advmod	_	_
10	sufficient	sufficient	ADJ	JJ	Degree=Pos	6	acl:relcl	_	SpaceAfter=No
11	.	.	PUNCT	.	_	1	punct	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **ascertain** | imperative | you *not said here* | the least number of questions |  |  |  |  | vn discover-84 «NP V NP»: agent=Agent number=Topic |
| 2 | **is** | present | questions |  |  |  |  | always, sufficient *property* | tree rules |

## The options {#options}

### Option 1 · ← Mova's choice {#o1}

<!-- .ven lang=en -->
63

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e1:o1:1
# text = 63
1	63	63	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

### Option 2 {#o2}

<!-- .ven lang=en -->
8

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e1:o2:1
# text = 8
1	8	8	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

### Option 3 · ✓ the right answer {#o3}

<!-- .ven lang=en -->
6

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e1:o3:1
# text = 6
1	6	6	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

### Option 4 {#o4}

<!-- .ven lang=en -->
32

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e1:o4:1
# text = 32
1	32	32	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

<!-- div src -->

**Text:** the tests of Mova's primary school, written for Mova (`world/data/school/`), as the course runner gave them to the student. **Trees:** Mova's own parse — the `en` model on the CPU, when the site is built — not checked by a teacher; they may be wrong. **Frames:** Mova's frames reader (`prag`), each text read on its own. Elamur Cosmic License.

<!-- /div -->

<!-- pn -->
- ← previous: [Olympiad: thinking like a machine, Beb…, test 11](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t11/)
- next →: [Olympiad: thinking like a machine, Beb…, exam 2](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e2/)
- ↑ back to [Olympiad: thinking like a machine, Bebras puzzles ★★★](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/)