Search by Topic

Resources tagged with Visualising similar to Difference Sudoku:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 187 results

Broad Topics > Using, Applying and Reasoning about Mathematics > Visualising

problem icon

Ding Dong Bell

Stage: 3, 4 and 5

The reader is invited to investigate changes (or permutations) in the ringing of church bells, illustrated by braid diagrams showing the order in which the bells are rung.

problem icon

Tourism

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.

problem icon

Marbles in a Box

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

How many winning lines can you make in a three-dimensional version of noughts and crosses?

problem icon

Fermat's Poser

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Find the point whose sum of distances from the vertices (corners) of a given triangle is a minimum.

problem icon

Cuboids

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Find a cuboid (with edges of integer values) that has a surface area of exactly 100 square units. Is there more than one? Can you find them all?

problem icon

Instant Insanity

Stage: 3, 4 and 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Given the nets of 4 cubes with the faces coloured in 4 colours, build a tower so that on each vertical wall no colour is repeated, that is all 4 colours appear.

problem icon

Introducing NRICH TWILGO

Stage: 1, 2, 3, 4 and 5 Challenge Level: Challenge Level:1

We're excited about this new program for drawing beautiful mathematical designs. Can you work out how we made our first few pictures and, even better, share your most elegant solutions with us?

problem icon

One Out One Under

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Imagine a stack of numbered cards with one on top. Discard the top, put the next card to the bottom and repeat continuously. Can you predict the last card?

problem icon

Shady Symmetry

Stage: 3 Challenge Level: Challenge Level:1

How many different symmetrical shapes can you make by shading triangles or squares?

problem icon

Reflecting Squarely

Stage: 3 Challenge Level: Challenge Level:1

In how many ways can you fit all three pieces together to make shapes with line symmetry?

problem icon

Flight of the Flibbins

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Blue Flibbins are so jealous of their red partners that they will not leave them on their own with any other bue Flibbin. What is the quickest way of getting the five pairs of Flibbins safely to. . . .

problem icon

Triangles to Tetrahedra

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Imagine you have an unlimited number of four types of triangle. How many different tetrahedra can you make?

problem icon

Cube Paths

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Given a 2 by 2 by 2 skeletal cube with one route `down' the cube. How many routes are there from A to B?

problem icon

Picturing Triangle Numbers

Stage: 3 Challenge Level: Challenge Level:1

Triangle numbers can be represented by a triangular array of squares. What do you notice about the sum of identical triangle numbers?

problem icon

How Many Dice?

Stage: 3 Challenge Level: Challenge Level:1

A standard die has the numbers 1, 2 and 3 are opposite 6, 5 and 4 respectively so that opposite faces add to 7? If you make standard dice by writing 1, 2, 3, 4, 5, 6 on blank cubes you will find. . . .

problem icon

Isosceles Triangles

Stage: 3 Challenge Level: Challenge Level:1

Draw some isosceles triangles with an area of $9$cm$^2$ and a vertex at (20,20). If all the vertices must have whole number coordinates, how many is it possible to draw?

problem icon

Konigsberg Plus

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.

problem icon

Sprouts

Stage: 2, 3, 4 and 5 Challenge Level: Challenge Level:2 Challenge Level:2

A game for 2 people. Take turns joining two dots, until your opponent is unable to move.

problem icon

Cubes Within Cubes Revisited

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Imagine starting with one yellow cube and covering it all over with a single layer of red cubes, and then covering that cube with a layer of blue cubes. How many red and blue cubes would you need?

problem icon

Eight Hidden Squares

Stage: 2 and 3 Challenge Level: Challenge Level:2 Challenge Level:2

On the graph there are 28 marked points. These points all mark the vertices (corners) of eight hidden squares. Can you find the eight hidden squares?

problem icon

Christmas Chocolates

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

How could Penny, Tom and Matthew work out how many chocolates there are in different sized boxes?

problem icon

Seven Squares

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Watch these videos to see how Phoebe, Alice and Luke chose to draw 7 squares. How would they draw 100?

problem icon

Bands and Bridges: Bringing Topology Back

Stage: 2 and 3

Lyndon Baker describes how the Mobius strip and Euler's law can introduce pupils to the idea of topology.

problem icon

Dice, Routes and Pathways

Stage: 1, 2 and 3

This article for teachers discusses examples of problems in which there is no obvious method but in which children can be encouraged to think deeply about the context and extend their ability to. . . .

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?

problem icon

The Spider and the Fly

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

A spider is sitting in the middle of one of the smallest walls in a room and a fly is resting beside the window. What is the shortest distance the spider would have to crawl to catch the fly?

problem icon

Wari

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

This is a simple version of an ancient game played all over the world. It is also called Mancala. What tactics will increase your chances of winning?

problem icon

On the Edge

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

If you move the tiles around, can you make squares with different coloured edges?

problem icon

Frogs

Stage: 3 Challenge Level: Challenge Level:1

How many moves does it take to swap over some red and blue frogs? Do you have a method?

problem icon

Königsberg

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?

problem icon

Squares in Rectangles

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

A 2 by 3 rectangle contains 8 squares and a 3 by 4 rectangle contains 20 squares. What size rectangle(s) contain(s) exactly 100 squares? Can you find them all?

problem icon

Chess

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

What would be the smallest number of moves needed to move a Knight from a chess set from one corner to the opposite corner of a 99 by 99 square board?

problem icon

Problem Solving, Using and Applying and Functional Mathematics

Stage: 1, 2, 3, 4 and 5 Challenge Level: Challenge Level:1

Problem solving is at the heart of the NRICH site. All the problems give learners opportunities to learn, develop or use mathematical concepts and skills. Read here for more information.

problem icon

Euromaths

Stage: 3 Challenge Level: Challenge Level:1

How many ways can you write the word EUROMATHS by starting at the top left hand corner and taking the next letter by stepping one step down or one step to the right in a 5x5 array?

problem icon

Penta Colour

Stage: 4 Challenge Level: Challenge Level:1

In how many different ways can I colour the five edges of a pentagon red, blue and green so that no two adjacent edges are the same colour?

problem icon

Sliding Puzzle

Stage: 1, 2, 3 and 4 Challenge Level: Challenge Level:1

The aim of the game is to slide the green square from the top right hand corner to the bottom left hand corner in the least number of moves.

problem icon

Floating in Space

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Two angles ABC and PQR are floating in a box so that AB//PQ and BC//QR. Prove that the two angles are equal.

problem icon

Square It

Stage: 3 and 4 Challenge Level: Challenge Level:1

Players take it in turns to choose a dot on the grid. The winner is the first to have four dots that can be joined to form a square.

problem icon

Dissect

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

It is possible to dissect any square into smaller squares. What is the minimum number of squares a 13 by 13 square can be dissected into?

problem icon

Tic Tac Toe

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In the game of Noughts and Crosses there are 8 distinct winning lines. How many distinct winning lines are there in a game played on a 3 by 3 by 3 board, with 27 cells?

problem icon

Is There a Theorem?

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Draw a square. A second square of the same size slides around the first always maintaining contact and keeping the same orientation. How far does the dot travel?

problem icon

Jam

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

A game for 2 players

problem icon

Sliced

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

An irregular tetrahedron has two opposite sides the same length a and the line joining their midpoints is perpendicular to these two edges and is of length b. What is the volume of the tetrahedron?

problem icon

Contact

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

A circular plate rolls in contact with the sides of a rectangular tray. How much of its circumference comes into contact with the sides of the tray when it rolls around one circuit?

problem icon

Diagonal Dodge

Stage: 2 and 3 Challenge Level: Challenge Level:1

A game for 2 players. Can be played online. One player has 1 red counter, the other has 4 blue. The red counter needs to reach the other side, and the blue needs to trap the red.

problem icon

Khun Phaen Escapes to Freedom

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Slide the pieces to move Khun Phaen past all the guards into the position on the right from which he can escape to freedom.

problem icon

Inside Out

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

There are 27 small cubes in a 3 x 3 x 3 cube, 54 faces being visible at any one time. Is it possible to reorganise these cubes so that by dipping the large cube into a pot of paint three times you. . . .

problem icon

Tetrahedra Tester

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

An irregular tetrahedron is composed of four different triangles. Can such a tetrahedron be constructed where the side lengths are 4, 5, 6, 7, 8 and 9 units of length?

problem icon

Linkage

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Four rods, two of length a and two of length b, are linked to form a kite. The linkage is moveable so that the angles change. What is the maximum area of the kite?

problem icon

Tied Up

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In a right angled triangular field, three animals are tethered to posts at the midpoint of each side. Each rope is just long enough to allow the animal to reach two adjacent vertices. Only one animal. . . .