Is Every Integer in the Decimal System Divisible by 5?

[Prathep]

I need some help proving this statement.

Prove that a positive integer is divisible by 5 if and only if it's last digit is either
0 or 5.

Thanks

 

[Prathep]

I need some help proving this statement.

Homework Statement

Prove that a positive integer is divisible by 5 if and only if it's last digit is either
0 or 5.

Homework Equations

The Attempt at a Solution

 

[CompuChip]

One way is easy. Suppose n is a positive integer that ends in 0 or 5. Then we can write
n = 10k + 5\epsilon
with k a positive integer and \epsilon = 0 or 1. For example,
1234985135 = 123498513 * 10 + 5. Then obviously n / 5 = k + \epsilon which is a positive integer again.

Also this approach should give you a clue for the other direction (suppose n is divisible by 5, then you can write it as 5k for some positive integer k. Now what can you say about k?)

 

[CompuChip]

Let's continue the conversation https://www.physicsforums.com/showthread.php?t=198173, so we don't have to double post as well.

 

[HallsofIvy]

Better yet, I've merged the two threads- into this one since the problem doesn't seem to me to have a lot to do with "Computer Science and Technology"!

 

[al-mahed]

every integer in the decimal system can be written as follows:

z = a_0 + a_1*10 + a_2*10^2 + ... + a_n*10^n

as 10 is the product of 2 and 5 ==> 5 | 10

for n > 0 all terms have 0 as the last digit

if z is a number with last digit = 0, then a_0 = 0 ==> 5 | z

else a_0 = 5 and also this implies 5 | z