整除问题（Divisibility problem）.docVIP

整除问题（Divisibility problem） The mathematical problem is divided into fourteen modules, one of which is the computational problem. The problem of divisibility is one of the properties of the numbers in the computational problem. In the civil service examination, the divisibility of numbers is widely used in computing, and in the same time, in the travel, engineering and other problems, divisibility is needed. Divisibility problems generally only test two aspects, candidates only need to firmly grasp the two aspects, you can easily solve such problems. The core point ---------------------------------------------------------------------------------------------------------------- 1, questions introduction The divisibility of numbers; widely used in mathematical operations. In general, the subject will give the known condition that a N number can be divisible by the number of M and solve the N number. 2, core knowledge If a, B, C as integer, B = 0, and a / b=c, said a is divisible by B (or B divisible by a). The number of a divided by the number of B (b = 0), taking is an integer or a finite decimal without remainder, called the a B can be removed (or B divides a). Divisibility is one of the divisible. (1) the nature of divisibility A, if the number a and the number B are divisible by the number C at the same time, then a + B can be divisible by the number C. If 36 and 54 can be divisible by 9 at the same time, they can be divisible by 9 by 90 and 18 by difference. B, if the number a can be divided by the number B and the number C at the same time, then the number a can be divisible by the minimum common multiple of the number B and the number C. If 63 can be divided by 3 and 7 at the same time, 63 can be divisible by the lowest common multiple 21 of 3 and 7. C, if the number a can be divisible by the number B, and C is an arbitrary integer, then the product AC can be divisible by the number B. Such as: 58 can be divisible by 29, then 58 multiplied by the product of any i