# Search by Topic

#### Resources tagged with Combinations similar to A-maze-ing:

Filter by: Content type:
Stage:
Challenge level:

### There are 104 results

Broad Topics > Decision Mathematics and Combinatorics > Combinations

### Brailler

##### Stage: 3 Challenge Level:

The machine I use to produce Braille messages is faulty and one of the pins that makes a raised dot is not working. I typed a short message in Braille. Can you work out what it really says?

### Pattern of Islands

##### Stage: 3 Challenge Level:

In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...

### Flight of the Flibbins

##### Stage: 3 Challenge Level:

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. . . .

##### Stage: 3 Challenge Level:

In a league of 5 football teams which play in a round robin tournament show that it is possible for all five teams to be league leaders.

### Hamilton's Puzzle

##### Stage: 2 Challenge Level:

I start my journey in Rio de Janeiro and visit all the cities as Hamilton described, passing through Canberra before Madrid, and then returning to Rio. What route could I have taken?

### Elf Suits

##### Stage: 2 Challenge Level:

If these elves wear a different outfit every day for as many days as possible, how many days can their fun last?

### Small Change

##### Stage: 3 Challenge Level:

In how many ways can a pound (value 100 pence) be changed into some combination of 1, 2, 5, 10, 20 and 50 pence coins?

### Calendar Cubes

##### Stage: 2 Challenge Level:

Make a pair of cubes that can be moved to show all the days of the month from the 1st to the 31st.

### Delia's Routes

##### Stage: 2 Challenge Level:

A little mouse called Delia lives in a hole in the bottom of a tree.....How many days will it be before Delia has to take the same route again?

### Home City

##### Stage: 2 Challenge Level:

Use the clues to work out which cities Mohamed, Sheng, Tanya and Bharat live in.

### Team Scream

##### Stage: 2 Challenge Level:

Seven friends went to a fun fair with lots of scary rides. They decided to pair up for rides until each friend had ridden once with each of the others. What was the total number rides?

### Flagging

##### Stage: 3 Challenge Level:

How many tricolour flags are possible with 5 available colours such that two adjacent stripes must NOT be the same colour. What about 256 colours?

### Button-up Some More

##### Stage: 2 Challenge Level:

How many ways can you find to do up all four buttons on my coat? How about if I had five buttons? Six ...?

### Polo Square

##### Stage: 2 Challenge Level:

Arrange eight of the numbers between 1 and 9 in the Polo Square below so that each side adds to the same total.

### Cuisenaire Environment

##### Stage: 1 and 2 Challenge Level:

An environment which simulates working with Cuisenaire rods.

### Chocs, Mints, Jellies

##### Stage: 2 Challenge Level:

In a bowl there are 4 Chocolates, 3 Jellies and 5 Mints. Find a way to share the sweets between the three children so they each get the kind they like. Is there more than one way to do it?

##### Stage: 2 Challenge Level:

Lolla bought a balloon at the circus. She gave the clown six coins to pay for it. What could Lolla have paid for the balloon?

### More and More Buckets

##### Stage: 2 Challenge Level:

In this challenge, buckets come in five different sizes. If you choose some buckets, can you investigate the different ways in which they can be filled?

### Two Egg Timers

##### Stage: 2 Challenge Level:

You have two egg timers. One takes 4 minutes exactly to empty and the other takes 7 minutes. What times in whole minutes can you measure and how?

### Those Tea Cups

##### Stage: 2 Challenge Level:

Place the 16 different combinations of cup/saucer in this 4 by 4 arrangement so that no row or column contains more than one cup or saucer of the same colour.

### Ice Cream

##### Stage: 2 Challenge Level:

You cannot choose a selection of ice cream flavours that includes totally what someone has already chosen. Have a go and find all the different ways in which seven children can have ice cream.

### Bean Bags for Bernard's Bag

##### Stage: 2 Challenge Level:

How could you put eight beanbags in the hoops so that there are four in the blue hoop, five in the red and six in the yellow? Can you find all the ways of doing this?

### Sweets in a Box

##### Stage: 2 Challenge Level:

How many different shaped boxes can you design for 36 sweets in one layer? Can you arrange the sweets so that no sweets of the same colour are next to each other in any direction?

### Halloween Investigation

##### Stage: 2 Challenge Level:

Ana and Ross looked in a trunk in the attic. They found old cloaks and gowns, hats and masks. How many possible costumes could they make?

### Colour Building

##### Stage: 3 Challenge Level:

Using only the red and white rods, how many different ways are there to make up the other colours of rod?

### Six Is the Sum

##### Stage: 2 Challenge Level:

What do the digits in the number fifteen add up to? How many other numbers have digits with the same total but no zeros?

### Chocoholics

##### Stage: 2 Challenge Level:

George and Jim want to buy a chocolate bar. George needs 2p more and Jim need 50p more to buy it. How much is the chocolate bar?

### Tiles on a Patio

##### Stage: 2 Challenge Level:

How many ways can you find of tiling the square patio, using square tiles of different sizes?

### Six Times Five

##### Stage: 3 Challenge Level:

How many six digit numbers are there which DO NOT contain a 5?

### Clocked

##### Stage: 3 Challenge Level:

Is it possible to rearrange the numbers 1,2......12 around a clock face in such a way that every two numbers in adjacent positions differ by any of 3, 4 or 5 hours?

### Man Food

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

Sam displays cans in 3 triangular stacks. With the same number he could make one large triangular stack or stack them all in a square based pyramid. How many cans are there how were they arranged?

### Semaphore Signals

##### Stage: 2 Challenge Level:

Semaphore is a way to signal the alphabet using two flags. You might want to send a message that contains more than just letters. How many other symbols could you send using this code?

### Last Biscuit

##### Stage: 3 and 4 Challenge Level:

A game that demands a logical approach using systematic working to deduce a winning strategy

### Wag Worms

##### Stage: 2 Challenge Level:

When intergalactic Wag Worms are born they look just like a cube. Each year they grow another cube in any direction. Find all the shapes that five-year-old Wag Worms can be.

### The Puzzling Sweet Shop

##### Stage: 2 Challenge Level:

There were chews for 2p, mini eggs for 3p, Chocko bars for 5p and lollypops for 7p in the sweet shop. What could each of the children buy with their money?

### Penta Primes

##### Stage: 2 Challenge Level:

Using all ten cards from 0 to 9, rearrange them to make five prime numbers. Can you find any other ways of doing it?

### Butterfly Cards

##### Stage: 2 Challenge Level:

Four children were sharing a set of twenty-four butterfly cards. Are there any cards they all want? Are there any that none of them want?

### Finding Fifteen

##### Stage: 2 Challenge Level:

Tim had nine cards each with a different number from 1 to 9 on it. How could he have put them into three piles so that the total in each pile was 15?

### Sam Again

##### Stage: 3 Challenge Level:

Here is a collection of puzzles about Sam's shop sent in by club members. Perhaps you can make up more puzzles, find formulas or find general methods.

### Calcunos

##### Stage: 2 Challenge Level:

If we had 16 light bars which digital numbers could we make? How will you know you've found them all?

### It Figures

##### Stage: 2 Challenge Level:

Suppose we allow ourselves to use three numbers less than 10 and multiply them together. How many different products can you find? How do you know you've got them all?

### Street Party

##### Stage: 2 Challenge Level:

The challenge here is to find as many routes as you can for a fence to go so that this town is divided up into two halves, each with 8 blocks.

### Plates of Biscuits

##### Stage: 2 Challenge Level:

Can you rearrange the biscuits on the plates so that the three biscuits on each plate are all different and there is no plate with two biscuits the same as two biscuits on another plate?

### New House

##### Stage: 2 Challenge Level:

In this investigation, you must try to make houses using cubes. If the base must not spill over 4 squares and you have 7 cubes which stand for 7 rooms, what different designs can you come up with?

### Three by Three

##### Stage: 1 and 2 Challenge Level:

Arrange 3 red, 3 blue and 3 yellow counters into a three-by-three square grid, so that there is only one of each colour in every row and every column

### Three Way Mix Up

##### Stage: 1 and 2 Challenge Level:

Jack has nine tiles. He put them together to make a square so that two tiles of the same colour were not beside each other. Can you find another way to do it?

### Prison Cells

##### Stage: 2 Challenge Level:

There are 78 prisoners in a square cell block of twelve cells. The clever prison warder arranged them so there were 25 along each wall of the prison block. How did he do it?

### Train Carriages

##### Stage: 1 and 2 Challenge Level:

Suppose there is a train with 24 carriages which are going to be put together to make up some new trains. Can you find all the ways that this can be done?

### Octa Space

##### Stage: 2 Challenge Level:

In the planet system of Octa the planets are arranged in the shape of an octahedron. How many different routes could be taken to get from Planet A to Planet Zargon?

### On Target

##### Stage: 2 Challenge Level:

You have 5 darts and your target score is 44. How many different ways could you score 44?
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://nrich.maths.org/public/leg.php?code=-39&cl=2&cldcmpid=2474", "fetch_time": 1495654918000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-22/segments/1495463607860.7/warc/CC-MAIN-20170524192431-20170524212431-00101.warc.gz", "warc_record_offset": 263266085, "warc_record_length": 10555, "token_count": 2374, "char_count": 10105, "score": 3.5, "int_score": 4, "crawl": "CC-MAIN-2017-22", "snapshot_type": "longest", "language": "en", "language_score": 0.9024466872215271, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00019-of-00064.parquet"}