Prove the 'rule of 9': an integer is divisible by 9 if and only if the sum of its integers is divisible by 9.

Rule of 9 : an integer is divisible by 9 if and only if the sum of its integers is divisible by 9.

Proof :

Let us consider a number x such that,

Where, are the the digits of the number x,

So, we can write,

Let,

Since, a number is in the form of , where k is an positive integer, is always divisible by 9,

⇒ are divisible by 9.

⇒ x-S is divisible by 9,

⇒ If S is divisible by 9 ⇒ x must divisible by 9,

Or if x is divisible by 9 ⇒ S must divisible by 9.

Hence, proved...

i would say the third one.

step-by-step explanation: liner would mean in a line and the only one that doesn't look like it's even thinking about forming a line would be the third one

h/o/e/s mad

step-by-step explanation:

si si si