Fundamental Drill#2

Determine whether the statements below are true or false.

Statement 1:

If the digit 8 8 is added at the end of a positive integer divisible by 8 8 , the new number must be divisible by 8 8 too.

Statement 2:

If a positive integer divisible by 8 8 and ends with digit 8 8 has its end digit removed. The remaining number must be divisible by 8 8 too.

Note: The original number should not be single-digit.

Give your answer according to the respective order of the statements.

You can try more of my fundamental problems here .

True,False False,True Both are true. Both are false.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Donglin Loo
Jun 20, 2018

Relevant wiki: Modular Arithmetic

Statement 1: \textbf{Statement 1:}

Let the original number be x x

x x is divisible by 8 8

x 0 ( m o d 8 ) \therefore x\equiv0(mod8)

10 x 0 ( m o d 8 ) \Rightarrow 10x\equiv0(mod8)

10 x + 8 0 ( m 0 d 8 ) \Rightarrow 10x+8\equiv0(m0d8)

10 x + 8 10x+8 is divisible by 8 8

\therefore the new number formed must be divisible by 8 8 .

\therefore Statement 1 \textbf{Statement 1} is t r u e \boxed{true}

Statement 2: \textbf{Statement 2:}

Let the original number be 10 y + 8 10y+8 .

10 y + 8 10y+8 is divisible by 8 8 .

10 y + 8 0 ( m o d 8 ) \therefore 10y+8\equiv0(mod8)

10 y 0 ( m o d 8 ) \Rightarrow 10y\equiv0(mod8)

But \textbf{But}

this does not indicate that y y must be 0 ( m o d 8 ) \equiv0(mod8)

For example, when y = 4 y=4

10 y = 40 0 ( m o d 8 ) 10y=40\equiv0(mod8)

But y y is not divisible by 8 8

\therefore Statement 2 \textbf{Statement 2} is f a l s e \boxed{false}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...