 | James Hamblin Smith - Algebra - 1870 - 452 pages
...what scale is 5 1 1 1 73 written 572640 ? 7. Shew that a number in the Common scale is divisible : (1) by 3 if the sum of its digits is divisible by 3. (2) by 4 if the last two digits be divisible by 4. (3) by 8 if the last three digits be divisible by... | |
 | Adolf Sonnenschein - 1873 - 194 pages
...derived from the Latin digitut, a finger, the fingers being the natural counters. Learn by heart : A number is divisible by 3 if the sum of its digits is divisible by 3. NOTE. Every number divisible by 9 is divisible by 3 ; bat not every number divisible by 3 is divisible... | |
 | Malcolm MacVicar - Arithmetic - 1876 - 412 pages
...the sum of the digits is divisible by 9, the number 486 is divisible by 9 (Prop. II). PROP. XI. — Any number is divisible by 3, if the sum of its digits is divisible by 3. This proposition is shown in the same manner as Prop. X ; as 3 divides 10, 100, 1000, etc., with a... | |
 | Edward Olney - Arithmetic - 1876 - 316 pages
...ends with an odd digit. 146. 1. It is possible that a number ending in any figure is divisible by 3. 2. Any number is divisible by 3, if the sum of its digits is so divisible, and not otherwise. DEM. — 1. There is no digit that may not be produced in the right-hand... | |
 | Horatio Nelson Robinson - Arithmetic - 1877 - 250 pages
...number is divisible L By 2, if it is an even number. Thus, 20, 24, 36, and 44 are divisible by 2. 2. By 3, if the sum of its digits is divisible by 3. Thus, 135,471, and 1134 are divisible by 3. 3. By 4, if its two right-hand figures are ciphers, or... | |
 | Edwin Pliny Seaver, George Augustus Walton - Arithmetic - 1878 - 370 pages
...above, the first part is divisible by 3. The other part is equal to the sum of its digits. Hence a number is divisible by 3 if the sum of its digits is divisible by 3. 14. The Greatest Common Factor of Numbers (Art. 175). The method of finding the gcf of numbers, as... | |
 | Malcolm MacVicar - Arithmetic - 1878 - 266 pages
...the sum of the digits is divisible by 9, the number 486 is divisible by 9 (Prop. II). PROP. XI.—Any number is divisible by 3, if the sum of its digits is divisible by 3. This proposition is shown in the same manner as Prop. X ; as 3 divides 10, 100, 1000, etc., with a... | |
 | Edwin Pliny Seaver - Arithmetic - 1878 - 360 pages
...above, the first part is divisible by 3. The other part is equal to the sum of its digits. Hence a number is divisible by 3 if the sum of its digits is divisibk by S. 14. The Greatest Common Factor of Numbers (Art. 175). The method of finding the gcf... | |
 | Edwin Pliny Seaver, George Augustus Walton - Arithmetic - 1879 - 330 pages
...above, the first part is divisible by 3. The other part is equal to the sum of its digits. Hence a number is divisible by 3 if the sum of its digits is divisible by S. 14. The Greatest Common Factor of Numbers (Art. 175). The method of finding the gcf of numbers,... | |
 | George Albert Wentworth, Thomas Hill - Arithmetic - 1881 - 446 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 3. 5. A number is divisible by 9 (32) if the sum of its digits is divisible by 9. 6. A number is divisible... | |
| |
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. 
