Skip to content / Đến nội dung
ThichHocToan.com

BEBRAS 2026 Grade 3-4 Round 2 Ext

Question 1

The beaver uses two balls of yarn to knit one shirt, or one ball to knit one scarf, as shown.

Question illustration

With two blue balls and four yellow balls of yarn, which set of products can the beaver make?
  1. 2 yellow shirts and 2 blue scarves
  2. 2 blue shirts and 4 yellow scarves
  3. 2 blue scarves and 4 yellow shirts
  4. 2 yellow shirts and 2 blue shirts

Question 2

Sticky rice cake is often cut with strings rather than a knife because the cake is sticky. These pictures show one-string cutting.

Question illustration

Several strings may also be used, but must be pulled in the right order so they do not catch on each other. In the two-string example, pull the white string before the grey string; reversing that order traps the grey string.

Question illustration

In what order should the four strings below be pulled?

Question illustration
  1. ABDC
  2. BCAD
  3. CDBA
  4. DACB

Question 3

Alice and Bob are spies. They use the alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ and encrypt each letter by replacing it with the next letter; Z becomes A. The examples are HELLO→IFMMP and CALL ZARA→DBMM ABSB.

Question illustration

Bob wants to send CHOCOLATE. Which encrypted message should he send?

Question illustration
  1. DIPDPMBUG
  2. DIPDPNBUF
  3. DIPDPMBUF
  4. DGPDPMBUF

Question 4

The map shows beaver cities and bus links. Each number is the fare for travelling along that link.

Question illustration

What is the least total fare for travelling from city A to city F?
  1. 30 units
  2. 33 units
  3. 36 units
  4. 39 units

Question 5

A robot embroiders carpets using four coded patterns: 00 horizontal lines, 11 dots, 01 diagonal lines, 10 vertical lines.

Question illustration

It follows each row from left to right, and rows from top to bottom. The program is:
- Row 1: 00-10-10-10-01-10-10-10-00
- Row 2: 10-01-10-01-01-01-10-01-10
- Row 3: 01-11-01-01-11-01-01-11-01
- Row 4: 10-01-10-01-01-01-10-01-10
- Row 5: 00-10-10-10-01-10-10-10-00

Which carpet results?

Question illustration
  1. Carpet A
  2. Carpet B
  3. Carpet C
  4. Carpet D

Question 6

Bitaro chooses a number of sticks according to which of three bulbs are lit. The examples show the rule.

Question illustration

How many sticks will he hold for the following bulb pattern?

Question illustration
  1. 2
  2. 5
  3. 6
  4. 7

Question 7

Alex’s treasure map uses these symbols: tent=start, grass=meadow, grey peaks=rocky mountain, blue=lake, chest=treasure.

Question illustration

Starting at the tent, reach the treasure while never entering a lake and entering at least one mountain cell. Each move goes one cell vertically or horizontally. Which instruction sequence is valid?

Question illustration
  1. ↑↑↑↑→→→→
  2. ↑→→↑→↑←←↑→→→
  3. →→→→↑↑↑↑
  4. ↑→↑→↑→↑←←→→→

Question 8

Saro is inviting 150 guests. Every day Saro writes exactly 15 invitations and gives them to the beaver at the end of that day. Early the next morning the beaver begins delivering; because of the long distances, it can deliver only 10 invitations per day. How many have been delivered by the end of day 9?
  1. 70
  2. 80
  3. 90
  4. 100

Question 9

Rescue calls are served by urgency: high before medium before low. Calls at the same urgency are served in the order received. Six calls arrive in this order:

1. Broken traffic lights (low)
2. Broken arm (medium)
3. Heart attack (high)
4. House fire (high)
5. Broken leg (medium)
6. Leaking pipe (low)

In what order will rescue vehicles be dispatched?
  1. Heart attack, house fire, broken arm, broken leg, broken traffic lights, leaking pipe
  2. Heart attack, house fire, broken leg, broken arm, broken traffic lights, leaking pipe
  3. House fire, heart attack, broken arm, broken leg, broken traffic lights, leaking pipe
  4. House fire, heart attack, broken leg, broken arm, broken traffic lights, leaking pipe

Question 10

A faulty robot must reach the repair station marked with a star.

Question illustration

It always turns right if a right-hand path exists; otherwise it goes straight. It never turns left. Without help it may take a wrong path and get stuck, as shown.

Question illustration

Walls can be added to block wrong turns; the example places the first wall.

Question illustration

What is the minimum total number of such walls needed?
  1. 3
  2. 5
  3. 6
  4. 7

Question 11

Bob has four tubes, each holding at most two round sweets. The first three are full and the fourth is empty. Colours are blue (X), red (Đ), yellow (V); the source uses letters on grey circles. Bob wants each colour grouped in its own tube.

Question illustration

A move D(i-j) transfers the top sweet of tube i to tube j, which must have space. These two independent examples explain D(1-2) and D(3-4).

Question illustration



Question illustration

Which move sequence sorts the original sweets?
  1. D(1-4), D(3-1), D(3-4), D(2-3)
  2. D(3-4), D(2-4), D(1-3), D(1-2)
  3. D(2-4), D(3-2), D(1-3), D(1-4)
  4. D(2-4), D(1-2), D(3-1), D(1-4)

Question 12

A sewing machine stitches through button holes in the order of an input number string. For example, 2143 draws the illustrated thread on a four-hole button.

Question illustration

Which number string produces the following thread pattern on a six-hole button?

Question illustration
  1. 1243653
  2. 2413656
  3. 36534212
  4. 41243653

Question 13

A robot knows five flower types from this table.

Question illustration

In English, each row lists petals; leaves; colour; scent; stem:
- Tulip: 6; long and smooth; red/yellow; mild; smooth.
- Daisy: 10-20; medium-sized; white/yellow; mild; thin.
- Rose: 10-20; small and pointed; red/pink; strong; thorny.
- Camellia: 10-20; medium-sized; pink; mild; thin.
- Marigold: more than 20; large and round; yellow/orange; strong; smooth.

The beaver grows one of these types. Each question asks about one feature, and the beaver answers accurately. What is the minimum number of questions that guarantees identifying the type?

Editorial convention: a colour answer gives the actual observed colour of the individual flower, not the entire list of possible colours printed for its type.
  1. 1
  2. 2
  3. 3
  4. 4

Question 14

Each jumping board has eight cells with a number and a left/right arrow. Choose a starting cell, then jump the indicated number of cells in its arrow direction. Continue until landing on 0 or leaving the board. Add the number of every visited cell, including the start, to the score. Highest total wins. The example players score 1 and 4.

Question illustration

Five players start on the two boards below. Who wins?

Question illustration
  1. A
  2. B
  3. C
  4. D or E

Question 15

Nam and Mai bake a cube-shaped birthday cake. They cover every face except the bottom with white chocolate. Then they divide each edge into ten equal parts and cut the cake into small cubes as shown.

Question illustration

How many small cubes have exactly two chocolate-covered faces?
  1. 96
  2. 40
  3. 84
  4. 68