Other tags that relate to Powerful Factors
Inequalities. Indices. Expanding and factorising quadratics. Creating and manipulating expressions and formulae. Modular arithmetic. Divisibility. Mathematical reasoning & proof. Factors and multiples. Binomial Theorem. Identities.There are 28 results
Broad Topics > Numbers and the Number System > Divisibility
Modulus Arithmetic and a Solution to Dirisibly Yours
Age 16 to 18
Peter Zimmerman from Mill Hill County High School in Barnet, London gives a neat proof that: 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.
Mod 3
Age 14 to 16 Challenge Level:
Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.
Sixational
Age 14 to 18 Challenge Level:
The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .
Prime AP
Age 16 to 18 Challenge Level:
What can you say about the common difference of an AP where every term is prime?
Squaresearch
Age 14 to 16 Challenge Level:
Consider numbers of the form un = 1! + 2! + 3! +...+n!. How many such numbers are perfect squares?
Expenses
Age 14 to 16 Challenge Level:
What is the largest number which, when divided into 1905, 2587, 3951, 7020 and 8725 in turn, leaves the same remainder each time?
Divisibility Tests
Age 11 to 16
This article takes the reader through divisibility tests and how they work. An article to read with pencil and paper to hand.
Why 24?
Age 14 to 16 Challenge Level:
Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.
Dirisibly Yours
Age 16 to 18 Challenge Level:
Find and explain a short and neat proof that 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.
Multiplication Magic
Age 14 to 16 Challenge Level:
Given any 3 digit number you can use the given digits and name another number which is divisible by 37 (e.g. given 628 you say 628371 is divisible by 37 because you know that 6+3 = 2+7 = 8+1 = 9). . . .
Code to Zero
Age 16 to 18 Challenge Level:
Find all 3 digit numbers such that by adding the first digit, the square of the second and the cube of the third you get the original number, for example 1 + 3^2 + 5^3 = 135.
Big Powers
Age 11 to 16 Challenge Level:
Three people chose this as a favourite problem. It is the sort of problem that needs thinking time - but once the connection is made it gives access to many similar ideas.
Fac-finding
Age 14 to 16 Challenge Level:
Lyndon chose this as one of his favourite problems. It is accessible but needs some careful analysis of what is included and what is not. A systematic approach is really helpful.
The Chinese Remainder Theorem
Age 14 to 18
In this article we shall consider how to solve problems such as "Find all integers that leave a remainder of 1 when divided by 2, 3, and 5."
Transposition Fix
Age 14 to 16 Challenge Level:
Suppose an operator types a US Bank check code into a machine and transposes two adjacent digits will the machine pick up every error of this type? Does the same apply to ISBN numbers; will a machine. . . .
Take Three from Five
Age 14 to 16 Challenge Level:
Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?
Check Codes
Age 14 to 16 Challenge Level:
Details are given of how check codes are constructed (using modulus arithmetic for passports, bank accounts, credit cards, ISBN book numbers, and so on. A list of codes is given and you have to check. . . .
Novemberish
Age 14 to 16 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.
Odd Stones
Age 14 to 16 Challenge Level:
On a "move" a stone is removed from two of the circles and placed in the third circle. Here are five of the ways that 27 stones could be distributed.
Obviously?
Age 14 to 18 Challenge Level:
Find the values of n for which 1^n + 8^n - 3^n - 6^n is divisible by 6.
N000ughty Thoughts
Age 14 to 16 Challenge Level:
How many noughts are at the end of these giant numbers?
LCM Sudoku
Age 14 to 16 Challenge Level:
Here is a Sudoku with a difference! Use information about lowest common multiples to help you solve it.
396
Age 14 to 16 Challenge Level:
The four digits 5, 6, 7 and 8 are put at random in the spaces of the number : 3 _ 1 _ 4 _ 0 _ 9 2 Calculate the probability that the answer will be a multiple of 396.
The Knapsack Problem and Public Key Cryptography
Age 16 to 18
An example of a simple Public Key code, called the Knapsack Code is described in this article, alongside some information on its origins. A knowledge of modular arithmetic is useful.
Knapsack
Age 14 to 16 Challenge Level:
You have worked out a secret code with a friend. Every letter in the alphabet can be represented by a binary value.
Public Key Cryptography
Age 16 to 18
An introduction to the ideas of public key cryptography using small numbers to explain the process. In practice the numbers used are too large to factorise in a reasonable time.
There's Always One Isn't There
Age 14 to 16 Challenge Level:
Take any pair of numbers, say 9 and 14. Take the larger number, fourteen, and count up in 14s. Then divide each of those values by the 9, and look at the remainders.
NRICH is part of the family of activities in the Millennium Mathematics Project.