Posts tagged UKMT
Parallel (Simon Singh): Congruent Rectangles

This is a UKMT JMC (Junior Maths Challenge) question. I’ve been using it with my students, who applied to St Paul’s Girls’ School, in the recent 11+ entrance exams.

Read More
UKMT: Ladder

What is the shape of the path that the snail traces out as the ladder falls?

Read More
AoPS: A Flip Side

Every card in this deck has a number on one side and a letter on the other. The same number can appear on more than one card.

Euna places four of these cards in a row, then flips over some (maybe all) of the cards and mixes them up. The before and after state is pictured below. What number is on the other side of the A?

Read More
IMA (The Institute of Mathematics and its Applications): Three Gamblers

Is A, B or C the speaker?

@IMAmaths

Read More
UKMT : April, May and June

Can you help solve how much money April, May and June began with, before sharing equally?

Read More
AoPS: Jewellery Design

10 silver beads and 10 gold beads are arranged randomly on a necklace.

Is it always possible to make one straight line cut that divides the necklace into two pieces that each have 5 silver and 5 gold beads?

Read More
Year 8 Maths Homework: Find The Radius

Could you solve this? My year 8 daughter’s homework from last weekend. I did point her in the right direction and then she finished it off. She was very happy as she worked out how to solve it.

Last night, she asked if she could work on really hard maths over half term, to help her find maths at school easy and also to have fun (apparently). I’ve pulled out UKMT’s Intermediate Problems by Andrew Jobbings (years 9-11 Intermediate Maths Challenge questions) and a pile of Art of Problem Solving books.

Read More
UKMT (UK Mathematics Trust): [√ n]

The notation [√ n] means the integer part of the square root of n. How quickly can you solve?

Read More
UKMT: The Tower of Hanoi Maths Problem

UKMT volunteer Fraser Heywood kindly shared this video of his favourite mathematical puzzle with us. The Tower of Hanoi is a mathematical puzzle and a recursive algorithm, where the objective is to move an entire stack of disks from the source position to another position.

The three rules are:

- Only one disk can be moved at a time.

- A disk can only be moved if it is the uppermost disk on a stack.

- No larger disk may be placed on top of a smaller disk.

Read More