Search by Topic

Resources tagged with Number theory similar to Old Nuts:

Filter by: Content type:
Stage:
Challenge level:

There are 23 results

Broad Topics > Numbers and the Number System > Number theory

The Public Key

Stage: 5 Challenge Level:

Find 180 to the power 59 (mod 391) to crack the code. To find the secret number with a calculator we work with small numbers like 59 and 391 but very big numbers are used in the real world for this.

Data Chunks

Stage: 4 Challenge Level:

Data is sent in chunks of two different sizes - a yellow chunk has 5 characters and a blue chunk has 9 characters. A data slot of size 31 cannot be exactly filled with a combination of yellow and. . . .

Really Mr. Bond

Stage: 4 Challenge Level:

115^2 = (110 x 120) + 25, that is 13225 895^2 = (890 x 900) + 25, that is 801025 Can you explain what is happening and generalise?

Mod 7

Stage: 5 Challenge Level:

Find the remainder when 3^{2001} is divided by 7.

Novemberish

Stage: 4 Challenge Level:

a) A four digit number (in base 10) aabb is a perfect square. Discuss ways of systematically finding this number. (b) Prove that 11^{10}-1 is divisible by 100.

Sums of Squares and Sums of Cubes

Stage: 5

An account of methods for finding whether or not a number can be written as the sum of two or more squares or as the sum of two or more cubes.

Number Rules - OK

Stage: 4 Challenge Level:

Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...

More Sums of Squares

Stage: 5

Tom writes about expressing numbers as the sums of three squares.

Modulus Arithmetic and a Solution to Differences

Stage: 5

Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.

Whole Number Dynamics III

Stage: 4 and 5

In this third of five articles we prove that whatever whole number we start with for the Happy Number sequence we will always end up with some set of numbers being repeated over and over again.

Whole Number Dynamics V

Stage: 4 and 5

The final of five articles which containe the proof of why the sequence introduced in article IV either reaches the fixed point 0 or the sequence enters a repeating cycle of four values.

Pythagorean Golden Means

Stage: 5 Challenge Level:

Show that the arithmetic mean, geometric mean and harmonic mean of a and b can be the lengths of the sides of a right-angles triangle if and only if a = bx^3, where x is the Golden Ratio.

An Introduction to Number Theory

Stage: 5

An introduction to some beautiful results of Number Theory

Whole Number Dynamics II

Stage: 4 and 5

This article extends the discussions in "Whole number dynamics I". Continuing the proof that, for all starting points, the Happy Number sequence goes into a loop or homes in on a fixed point.

2^n -n Numbers

Stage: 5

Yatir from Israel wrote this article on numbers that can be written as $2^n-n$ where n is a positive integer.

There's a Limit

Stage: 4 and 5 Challenge Level:

Explore the continued fraction: 2+3/(2+3/(2+3/2+...)) What do you notice when successive terms are taken? What happens to the terms if the fraction goes on indefinitely?

Never Prime

Stage: 4 Challenge Level:

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.

Always Perfect

Stage: 4 Challenge Level:

Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.

About Pythagorean Golden Means

Stage: 5

What is the relationship between the arithmetic, geometric and harmonic means of two numbers, the sides of a right angled triangle and the Golden Ratio?

Euler's Squares

Stage: 4 Challenge Level:

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square...

Diophantine N-tuples

Stage: 4 Challenge Level:

Can you explain why a sequence of operations always gives you perfect squares?

Ordered Sums

Stage: 4 Challenge Level:

Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .

A Little Light Thinking

Stage: 4 Challenge Level:

Here is a machine with four coloured lights. Can you make two lights switch on at once? Three lights? All four lights?