I don't completely understand the question, but there's a trick: A number is divisible by 3 if and only if the sum of its digits is divisible by 3. This should guide you to an answer.
A very unique number; it is divisible by each single digit number except 5 and 7.
To be divisible by both 4 and 9 a number must be a multiple of the Least Common Factor of 4 and 9. The LCM is 36. The first 3 digit number in each hundred that is a multiple of 36 are as follows :- 108, 216, 324, 432, 504, 612, 720, 828 and 900.
To discover whether a number is divisible by 7, double the last digit of the number, and subtract it from the rest of the number. If the result is either 0 or divisible by 7, then the number is divisible by 7. For example:672 - last digit is 2, double 2 to make 4, subtract from 67 equals 63, 63/7 = 9, therefore, 672 is divisible by 7.Dividing by 7 (2 Tests)Take the last digit in a number.Double and subtract the last digit in your number from the rest of the digits.Repeat the process for larger numbers.Example: 357 (Double the 7 to get 14. Subtract 14 from 35 to get 21 which is divisible by 7 and we can now say that 357 is divisible by 7. NEXT TESTTake the number and multiply each digit beginning on the right hand side (ones) by 1, 3, 2, 6, 4, 5. Repeat this sequence as necessaryAdd the products.If the sum is divisible by 7 - so is your number.Example: Is 2016 divisible by 7?6(1) + 1(3) + 0(2) + 2(6) = 2121 is divisible by 7 and we can now say that 2016 is also divisible by 7.
48. Assuming no digit can be used more than once, the two digit numbers divisible by 4 are: 16, 36, 48, 56, 64, 68, 84, 96 8 of them. For any number to be divisible by 4, only the last two digits need be divisible by 4; so for three digit numbers, each of the two digit numbers above can be preceded by any of the remaining 5 digits and still be divisible by 4. → 5 x 8 = 40 three digit numbers are divisible by 4 → 40 + 8 = 48 two or three digit numbers made up of the digits {1, 3, 4, 5, 6, 8, 9} are divisible by 4. If repeats are allowed, there are an extra 2 two digit numbers (44 and 88) and each of the two digit numbers can be preceded by any of the 7 digits, making a total of 7 x 10 + 10 = 80 two and three digits numbers divisible by 4 make up of digits from the given set.
There are 2000 possible five digit numbers that can be formed from the digits 02345 that are divisible by 2 or 5 or both. To be divisible by 2, the last digit must be even, namely 0, 2 or 4 (in the digits allowed). To be divisible by 5, the last digit must be 0 or 5. Thus to be divisible by 2 or 5 or both, the last digit must be 0, 2, 4 or 5 (a choice of 4). Presuming that a 5 digit number must be at least 10000, then: For the first digit there is a choice of 4 digits (2345); for each of these there is a choice of 5 digits (02345) for the second, making a total so far of 4 x 5 numbers; for each of these choices for the first and second digits there is a choice of 5 digits (02345) for the third digit making the total so far (4 x 5) x 5 numbers; for each of these choices for the first three digits there is a choice of 5 digits (02345) for the fourth digit making the total so far (4 x 5 x 5) x 5 numbers; for each of these choices for the first four digits there is a choice of 4 digits (0245 - as discussed above) for the last digit, giving a total of (4 x 5 x 5 x 5) x 4 numbers. So the total number of five digit numbers so formed is: number = 4 x 5 x 5 x 5 x 4 = 2000.
A very unique number; it is divisible by each single digit number except 5 and 7.
This is a weekly question posted by Columbus State University. See http://www.colstate.edu/mathcontest/problem.php?CategoryID=3&LinkID=CurrentPlease do not answer this question as this person is too lazy to figure it out themselves.
A delectable number has nine digits, using the numbers 1-9 once in each digit. The first digit of a delectable number must be divisible by one. The first and second digits must be divisible by two, the first through third must be divisible by three, etc. There has only been one delectable number discovered: 381654729.
If the sum of each digit of a number is divisible by three ((1 + 1 + 1 + 0)/3 = 1) and it gives an integer, and the number is divisible by 2 (1110/2 = 555) and also gives an integer, then the number is divisible by 6.So, yes.
To be divisible by both 4 and 9 a number must be a multiple of the Least Common Factor of 4 and 9. The LCM is 36. The first 3 digit number in each hundred that is a multiple of 36 are as follows :- 108, 216, 324, 432, 504, 612, 720, 828 and 900.
14
0
There are 5 numbers which can make the 3 digit numbers in this example. Therefore each digit in the 3 digit number has 5 choices of which number can be placed there. Therefore number of 3 digit numbers = 5 x 5 x 5 = 125
0
To be divisible by 2 the last digit must be even, ie one of {0, 2, 4, 6, 8}; The last digit is 0, which is one of these so 330 is divisible by 2. To be divisible by 3, sum the digits of the number and if this sum is divisible by 3, then the original number is divisible by 3. As the test can be repeated on the sum, repeat the summing until a single digit remains; only if this number is one of {3, 6, 9} is the original number divisible by 3. 330→ 3 + 3 + 0 = 6 6 is one of {3, 6,9} so 330 is divisible by 3. To be divisible by 5, the last digit must be one of {0, 5}. The last digit is 0 which is one of {0, 5} so 330 is divisible by 5. There is no real check for 7 which is not much slower than just dividing by 7 to see if there is no remainder. One check: Write the digits in blocks of 3 starting from the right hand end (like you would for reading the number): in each block of 3 add twice the first digit to three times the second digit to the third digit. Alternately subtract and add the blocks starting from the right hand end of the number. If the result is divisible by 7, then so is the original number. 330 → 2×3 + 3×3 + 0 = 15 15 is not divisible by 7, so 330 is not divisible by 7. To be divisible by 11, alternately subtract and add the digits of the number from the right hand end; only if this sum is divisible by 11 (or is 0) is the original number divisible by 11. 330 → 0 - 3 + 3 = 0 0 is 0, so 330 is divisible by 11. Therefore 330 is divisible by 2, 3, 5, 11 But not divisible by 7.
To discover whether a number is divisible by 7, double the last digit of the number, and subtract it from the rest of the number. If the result is either 0 or divisible by 7, then the number is divisible by 7. For example:672 - last digit is 2, double 2 to make 4, subtract from 67 equals 63, 63/7 = 9, therefore, 672 is divisible by 7.Dividing by 7 (2 Tests)Take the last digit in a number.Double and subtract the last digit in your number from the rest of the digits.Repeat the process for larger numbers.Example: 357 (Double the 7 to get 14. Subtract 14 from 35 to get 21 which is divisible by 7 and we can now say that 357 is divisible by 7. NEXT TESTTake the number and multiply each digit beginning on the right hand side (ones) by 1, 3, 2, 6, 4, 5. Repeat this sequence as necessaryAdd the products.If the sum is divisible by 7 - so is your number.Example: Is 2016 divisible by 7?6(1) + 1(3) + 0(2) + 2(6) = 2121 is divisible by 7 and we can now say that 2016 is also divisible by 7.
To be divisible by both 4 and 9 a number must be a multiple of the Least Common Factor of 4 and 9. The LCM is 36. The first 3 digit number in each hundred that is a multiple of 36 are as follows :- 108, 216, 324, 432, 504, 612, 720, 828 and 900.