You have worked out a secret code with a friend. Every letter in the alphabet can be represented by a binary value.
We are used to writing numbers in base ten, using 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. Eg. 75 means 7 tens and five units. This article explains how numbers can be written in any number base.
Explore the factors of the numbers which are written as 10101 in different number bases. Prove that the numbers 10201, 11011 and 10101 are composite in any base.
Ask a friend to choose a number between 1 and 63. By identifying which of the six cards contains the number they are thinking of it is easy to tell them what the number is.
There are two forms of counting on Vuvv - Zios count in base 3 and Zepts count in base 7. One day four of these creatures, two Zios and two Zepts, sat on the summit of a hill to count the legs of. . . .
Have you seen this way of doing multiplication ?
The number 3723(in base 10) is written as 123 in another base. What is that base?
Using balancing scales what is the least number of weights needed to weigh all integer masses from 1 to 1000? Placing some of the weights in the same pan as the object how many are needed?
This article for the young and old talks about the origins of our number system and the important role zero has to play in it.
This investigation is about happy numbers in the World of the Octopus where all numbers are written in base 8 .Octi the octopus counts.
A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.
Can you create a Latin Square from multiples of a six digit number?
How can Agent X transmit data on a faulty line and be sure that her message will get through?
A collection of games on the NIM theme
This investigation is about happy numbers in the World of the Octopus where all numbers are written in base 8 ... Find all the fixed points and cycles for the happy number sequences in base 8.
Find b where 3723(base 10) = 123(base b).
Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The loser is the player who takes the last counter.
Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The winner is the player to take the last counter.
A garrison of 600 men has just enough bread ... but, with the news that the enemy was planning an attack... How many ounces of bread a day must each man in the garrison be allowed, to hold out 45. . . .