Answer:
One integer A is divisible by another integer B,
if after dividing them, A ÷ B, the remainder is zero.
4,320 is divisible by 10, if there is an integer 'n' such that 4,320 = 'n' × 10.
Notice that dividing our numbers leaves no remainder:
4,320 ÷ 10 = 432 + 0;
So, 4,320 = 432 × 10;
=> 4,320 is divisible by 10.
10 is called a divisor (a factor) of 4,320.
10 | 4,320
The shorthand notation A | B means A divides B.
4,320 is a multiple of 10.
Note that this is also the first step of the Euclidean Algorithm, where the division of the numbers stops when a remainder equal to zero is reported.
4,320 is divisible by 10:
10 | 4,320
Step-by-step explanation:
