Skip to main content

Beginning Activity Beginning Activity 2: The Remainder When Dividing by 9

If a and b are integers with b>0, then from the Division Algorithm, we know that there exist unique integers q and r such that

a=bq+r and 0r<b.

In this activity, we are interested in the remainder r. Notice that r=abq. So, given a and b, if we can calculate q, then we can calculate r.

We can use the “int” function on a calculator to calculate q. [The “int” function is the “greatest integer function.” If x is a real number, then int(x) is the greatest integer that is less than or equal to x.]

So, in the context of the Division Algorithm, q=int(ab). Consequently,

r=abint(ab).

If n is a positive integer, we will let s(n) denote the sum of the digits of n. For example, if n=731, then

s(731)=7+3+1=11.

For each of the following values of n, calculate

  • The remainder when n is divided by 9, and

  • The value of s(n) and the remainder when s(n) is divided by 9.

1.

n=498

2.

n=7319

3.

n=4672

4.

n=9845

5.

n=51381

6.

n=305877

What do you observe?