Scribd
Upload
52 views6 pages

Bai 9

Uploaded by

minhdat090912
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views6 pages

Bai 9

Uploaded by

minhdat090912
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

HongKong International Mathematical Olympiad 2024

FINAL ROUND / VÒNG QUỐC TẾ


A. LESSON 9: ROUTING PROBLEM / BÀI TOÁN ĐƯỜNG ĐI

I. GENERAL METHOD / PHƯƠNG PHÁP CHUNG


Use the additional rule
II. EXAMPLE:
Example 1: If Tom goes from point A to point B, each step can only move up or move
right. How many way(s) is/ are there?
B

A
Câu hỏi:Nếu Tom đi từ đểmAđến điểm B, mỗi bước chỉ có thể đi lên trên hoặc đi sang phảỉ. Hỏi
có bao nhiêu cách đi?

Hướng dẫn: Ở mỗi điểm ta ghi các số, thể hiện số cách đi từ điểmAđến điểm đó

Vì chỉ có thể di chuyển lên trên hoặc sang phải nên các số ghi ở cạnh bên trái và cạnh
dưới cùng đều chỉ là 1
Số cách đi từ A đến các điểmđược tính bằng số cách đi từ 2 điểm liền bên trái và liền
bên dưới nó cộng lại

Vậy từ A đến B có tổng cộng 6 cách đi thỏa mãn.

III. PROBLEMS
Problem 1: If Tom goes from point A to point B, each step can only move up or move
right. How many way(s) is/ are there?
B
1

FERMAT Education: Số 6A1 tiểu khu Ngọc Khánh, Ba Đình, Hà Nội - 0917830455 / 0961603003
Website: olympic.fermat.edu.vn - Email: Olympic@fermat.edu.vn
HongKong International Mathematical Olympiad 2024

Problem 2: If Tom goes from point A to point B, each step can only move up or move
right. How many way(s) is/ are there?
B

Problem 3: If Tom goes from point A to point B, each step can only move up or move
right. How many way(s) is/ are there?

Problem 4: Lucy goes from point B to point A. Each step she can only move down or
move left. How many ways are there?

FERMAT Education: Số 6A1 tiểu khu Ngọc Khánh, Ba Đình, Hà Nội - 0917830455 / 0961603003
Website: olympic.fermat.edu.vn - Email: Olympic@fermat.edu.vn
HongKong International Mathematical Olympiad 2024

Problem 5: If Alice goes from point A to point B, each step can only move up or move
right along the line. How many ways are there?

Problem 6: Alice goes from point A to point B. She can only move up or move right
along the line. How many ways are there?

Problem 7: Andy goes from point B to point A. He can only move down or move left
along the line. How many ways are there?

B. STAIRCASE PROBLEM / BÀI TOÁN CẦU THANG


I. GENERAL METHOD / PHƯƠNG PHÁP CHUNG
Use the additional rule
II. EXAMPLE:
Example 2: A flight of stairs has 5 steps. David can go up for 1 step or 2 steps each time.
How many way(s) is / are there for David to go up the stairs?
3

FERMAT Education: Số 6A1 tiểu khu Ngọc Khánh, Ba Đình, Hà Nội - 0917830455 / 0961603003
Website: olympic.fermat.edu.vn - Email: Olympic@fermat.edu.vn
HongKong International Mathematical Olympiad 2024

Câu hỏi: Cầu thang có 5 bậc thang. David có thể bước mỗi bước lên 1 hoặc 2 bậc. Hỏi có bao
nhiêu cách để David đi lên hết cầu thang?
Hướng dẫn:

Gọi S(n) là số cách đi lên bậc n


Ta có S(1) = 1, S(2) = 2
S(3) = S(1) + S(2) = 1 + 2 = 3
S(4) = S(2) + S(3) = 2+ 3 =5
S(5) = S(a) + S(3) = 3 + 5 = 8
III. PROBLEMS
Problem 8: A flight of stairs has 9 steps. David can go up for 1 step or 2 steps each time.
How many way(s) is / are there for David to go?

Problem 9: A flight of stairs has 9 steps. David can go up for 1 step or 2 steps each time.
The 4th step cannot be stepped on as it is destroyed. How many way(s) is / are there
for David to go up the stairs?

Problem 10: A flight of stairs has 9 steps. David can go up for 1 step, 2 steps or 3 steps
each time. How many way(s) is / are there for David to go up the stairs?

Problem 11: A flight of stairs has 10 steps. David can go up for 1 step, 2 steps, or 3 steps
at a time. How many ways are there for David to go up the stairs?

Problem 12: A flight of stairs has 11 steps. Peter can go up for 1 step or 3 steps each
time. How many way(s) is / are there for Peter to go up the stairs?

Problem 13: A flight of stairs has 12 steps. Andy can go up for 1 step, 2 steps or 3 steps
each time. The 5th step and the 9th step cannot be stepped on as it is destroyed. How
many way(s) is / are there for Andy to go up the stairs?
4

FERMAT Education: Số 6A1 tiểu khu Ngọc Khánh, Ba Đình, Hà Nội - 0917830455 / 0961603003
Website: olympic.fermat.edu.vn - Email: Olympic@fermat.edu.vn
HongKong International Mathematical Olympiad 2024

HOMEWORK
Problem 14: If Tom goes from point A to point B, each step can only move up or move
right. How many way(s) is/ are there?

Problem 15: Andy goes from point A to point B. Each step he can only move up or
move right. How many ways are there?

Problem 16: Andy goes from point A to point B. Each step he can only move up or
move right. How many ways are there?

FERMAT Education: Số 6A1 tiểu khu Ngọc Khánh, Ba Đình, Hà Nội - 0917830455 / 0961603003
Website: olympic.fermat.edu.vn - Email: Olympic@fermat.edu.vn
HongKong International Mathematical Olympiad 2024

Problem 17: If Andy goes from point A to point B, each step can only move up or move
right along the line. How many way(s) is / are there?

Problem 18: Alice goes from point A to point B. Each step, she can only move up or
move right. How many ways are there if she must pass through the point O?

Problem 19: A flight of stairs has 7 steps. David can go up for 1 step or 2 steps each
time. How many way(s) is / are there for David to go up the stairs?

Problem 20: A flight of stairs has 10 steps. David can go up for 1 step or 2 steps at a
time. How many ways are there for David to go up the stairs?

Problem 21: A flight of stairs has 11 steps. David can go up for 1 step or 2 steps each
time. The 4th step cannot be stepped on as it is destroyed. How many way(s) is / are
there for David to go up the stairs?

Problem 22: A flight of stairs has 12 steps. Andy can go up for 1 step, 2 steps or 3 steps
each time. The 7th step and the 9th step cannot be stepped on as it is destroyed. How
many way(s) is / are there for Andy to go up the stairs?
6

FERMAT Education: Số 6A1 tiểu khu Ngọc Khánh, Ba Đình, Hà Nội - 0917830455 / 0961603003
Website: olympic.fermat.edu.vn - Email: Olympic@fermat.edu.vn

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy