 | Charles Smith - Algebra - 1888 - 680 pages
...that in the ordinary scale a number is divisible by 9 if the sum of its digits be divisible by 9, and by 3 if the sum of its digits is divisible by 3. N - S is a multiple of 9 ; hence, if S be a multiple of 9, so also is N ; and, if S be a multiple of... | |
 | Charles Austin Hobbs - Arithmetic - 1889 - 366 pages
...tests can be used: (1) A number is divisible by 2 if its right-hand figure is zero or an even digit. (2) A number is divisible by 3 if the sum of its digits is divisible by 3. For example, in 741, 7 + 4 + 1 = 12, which is divisible by 3 ; hence 741 is divisible by 3. (3) A number... | |
 | George Albert Wentworth - Arithmetic - 1889 - 676 pages
...number is divisible by 8 (2s) if the number denoted by the last three digits is divisible by 8. 4. A number is divisible by 3 if the sum of its digits is divisible by 8. 5. A number is divisible by 9 (32) if the sum of its diffus is divisible by 9. 6. A number is divisible... | |
 | Seymour Eaton - Arithmetic - 1889 - 248 pages
...common multiple of two or more numbers is the least number that u exactly divisible by each of them. Any number is divisible by 3 if the sum of its digits is divisible by 3. Any number is divisible by 4 if it end with two or more ciphers, or if the number expressed by its... | |
 | John Edward King - Business mathematics - 1891 - 254 pages
...etc., respectively. Any number is divisible by 4 when the two right-hand digits are divisible by 4. Any number is divisible by 3 if the sum of its digits is divisible by 3. 131. To aid the pupil in determining the prime factors of a composite number the following table is... | |
 | John Fenner Brown - Arithmetic - 1892 - 184 pages
...9. 9 is divisible by 3. Any number of 9's are divisible by 3. So, from the previous demonstration, A number is divisible by 3 if the sum of its digits is divisible by 3. 28146 is divisible by 3, for the sum of its digits is 21, a number divisible by 3. 1342 is not divisible... | |
 | Seymour Eaton - 1892 - 252 pages
...multiple of two or more numbers is the least number that is exactly divisible by each of them. Any number is divisible by 3 if the sum of its digits is divisible by S. Any number is divisible by 4 if it end with two or more ciphers, or if the number expressed by its... | |
 | 1893 - 252 pages
...etc., respectively. Any number is divisible by 4 when the two right-hand digits are divisible by 4. Any number is divisible by 3 if the sum of its digits is divisible by 3. 131. To aid the pupil in determining the prime factors of a composite number the following table is... | |
 | Webster Wells - Arithmetic - 1893 - 360 pages
...hence, V. Any number is divisible by 10 if its last digit is 0. Thus, 3790 is divisible by 10. VI. Any number is divisible by 3 if the sum of its digits is divisible by 3. Thus, 582 is divisible by 3, because the sum of its digits, 15, is divisible by 3. VII. Any number... | |
 | Eugene L. Dubbs - Arithmetic - 1893 - 244 pages
...the Iy. CM of 8, 12, and 16. Any number is divisible by 2 if it ends with o, or 2, 4, 6, or 8. Any number is divisible by 3 if the sum of its digits is divisible by 3. Thus, 357 is divisible by 3, because 3+5+7, or 15, is divisible by 3. Any number is divisible by 4... | |
| |
A number is divisible by 3 if the sum of its digits is divisible by 3• A number is divisible by 9 if the sum of its digits is divisible by 9. 
