Nico is learning to drive. He knows how to turn right but has not yet learned how to turn left. What is the smallest number of right turns he could make to travel from P to Q, moving first in the direction shown?
A. 3
B. 4
C. 6
D. 8
E. 10
B. 4
Since Nico can only turn right, he cannot approach Q from the right as to do so would require a left turn. Therefore he must approach Q from below on the diagram. Hence he will be facing in the same direction as he originally faced. As he can only turn right, he must make a minimum of four right turns to end up facing in the same direction as he started. The route indicated on the diagram below shows that he can reach Q making four right turns. Hence the smallest number of right turns he could make is four.

Preparing for the Junior Maths Challenge?
Join a free weekly live lesson where I solve real JMC-style problems, explain key methods, and share what to focus on in your weekly practice.
You can join live or watch the replay - everyone is welcome.
📅 Every Tuesday
⏰ 18:30–19:30 (UK time)
💻 Live session (link sent by email)

This course guides you through the fundamentals of Python programming using an interactive Python library known as Turtle.

This course encompasses a range of Geometry topics such as coordinate and spatial geometry, introductory trigonometry, angles, parallel lines, congruent and similar triangles, polygons, circles, the Pythagorean Theorem, and more. Emphasis will be placed on reinforcing Algebra skills and enhancing critical thinking through problem-solving in both mathematical and real-world contexts.

Ask about our courses and offerings, and we will help you choose what works best for you.