Problem #PRU-30738

Problems Methods Divisibility Divisibility rules Algebraic methods Proof by exhaustion Divisibility tests for 2 and 4 Number Theory

Problem

How many different four-digit numbers, divisible by 4, can be made up of the digits 1, 2, 3 and 4,

a) if each number can occur only once?

b) if each number can occur several times?