Numsprite數靈精Play free
中文

Maths olympiad question · P1–P2★ Easy

Most and least: olympiad question 1

An easy question on most and least for P1–P2, with a step-by-step solution, diagrams and the answer. Finding the most and the least appears in the Hua Xia Cup from the P1 and P2 first rounds to the P6 papers.

The question

Ming has 3 digit cards:

4, 8, 6.

He picks 2 of them to make a 2-digit number, each card used once.

What is the smallest number he can make?

Show the hints (2)
  1. Hint 1: Higher places matter more. For the smallest number, which card goes in the highest place?
  2. Hint 2: For the smallest, which 2 cards should he pick? From the highest place down, each place takes the smallest card left.

Worked solution

Have a go first, then read the solution step by step.

  1. 1.For the smallest, use the 2 smallest cards: the highest place gets 4, then 6.
  2. 2.The smallest number is 46.
  3. ⚠️Common mistake: using big cards and only putting them in increasing order. For the smallest, first pick the 2 smallest cards.

Answer: 46

Play more like this in Numsprite (unlimited questions, instant marking) →A free maths game: every level free from Easy to Expert (★ to ★★★★), unlimited questions, no download