You can do this by finding all of the prime factors of every number less than or equal to 12, then multiplying them by the largest number of times that they occur in any given number, and then multiplying them all together
1 = 1
2 = 2
3 = 3
4 = 2 * 2
5 = 5
6 = 2 * 3
7 = 7
8 = 2 * 2 * 2
9 = 3 * 3
10 = 2 * 5
11 = 11
12 = 3 * 2 * 2
So we need to multiply out:
1 * 2 * 2 * 2 * 3 * 3 * 5 * 7 * 11 = 27720
but you could go down to points.
2520
13
100015
There can be no such number. Suppose n is a number that is divisible by k numbers. Suppose p is any integer greater than 1. Then n*p is a number that is divisible by at least k+2 numbers.In this way it is always possible to find another number that is divisible by more numbers.
To find if a number is divisible by 5, the digit in the ones place has to be 0 or 5.
2520
13
100015
There can be no such number. Suppose n is a number that is divisible by k numbers. Suppose p is any integer greater than 1. Then n*p is a number that is divisible by at least k+2 numbers.In this way it is always possible to find another number that is divisible by more numbers.
If the last two digits of a number are divisible by 4, the whole number is divisible by 4.
nothing it is divisible by nothing well at least i couldn't find anything i could divided it by to give me a whole number so if anyone differs please do tell =)
To find if a number is divisible by 5, the digit in the ones place has to be 0 or 5.
Divide it by 11. If the answer is a whole number, it's divisible.
If the last number is divisible by 4 then the whole number is divisable by 4
Do the division and if the remainder is 0 then the number is divisible by the something and if not it isn't.
No. To find whether the number is divisible by 3, you add each digits and if it's equal to 9 then it's divisible by 3 because 9 is divisible by 3. 9 + 8 + 2 = 19, 1 + 9 = 10... so it's not divisible by 3.
To find out if a number is divisible by 8 the number must be divisible by 2 and 4!