Is Every Integer in the Decimal System Divisible by 5?

  • Context: High School 
  • Thread starter Thread starter Prathep
  • Start date Start date
  • Tags Tags
    Divisibility Proof
Click For Summary

Discussion Overview

The discussion revolves around the divisibility of positive integers by 5, specifically focusing on the condition that a positive integer is divisible by 5 if and only if its last digit is either 0 or 5. The scope includes mathematical reasoning and proofs related to this property of integers in the decimal system.

Discussion Character

  • Mathematical reasoning
  • Homework-related

Main Points Raised

  • Some participants propose that a positive integer ending in 0 or 5 can be expressed in the form n = 10k + 5ε, where k is a positive integer and ε is either 0 or 1, suggesting this implies divisibility by 5.
  • Others argue that if n is divisible by 5, it can be expressed as 5k for some positive integer k, prompting a consideration of the implications for the last digit of n.
  • A participant presents a general representation of integers in the decimal system, indicating that since 10 is the product of 2 and 5, all terms with n > 0 have 0 as the last digit, leading to the conclusion that if the last digit is 0, then z is divisible by 5.
  • Another point raised is that if the last digit is 5, it also implies that z is divisible by 5.

Areas of Agreement / Disagreement

Participants generally agree on the condition for divisibility by 5 related to the last digit being 0 or 5, but the discussion includes various approaches and reasoning, indicating that multiple perspectives and methods of proof are present.

Contextual Notes

Some assumptions about the representation of integers and the implications of divisibility are discussed, but these are not fully resolved within the thread.

Prathep
Messages
7
Reaction score
0
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
 
Physics news on Phys.org
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

 
One way is easy. Suppose n is a positive integer that ends in 0 or 5. Then we can write
[tex]n = 10k + 5\epsilon[/tex]
with k a positive integer and [itex]\epsilon[/itex] = 0 or 1. For example,
1234985135 = 123498513 * 10 + 5. Then obviously [itex]n / 5 = k + \epsilon[/itex] 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?)
 
Let's continue the conversation https://www.physicsforums.com/showthread.php?t=198173, so we don't have to double post as well.
 
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"!
 
every integer in the decimal system can be written as follows:

[tex]z = a_0 + a_1*10 + a_2*10^2 + ... + a_n*10^n[/tex]

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 [tex]a_0 = 0[/tex] ==> 5 | z

else [tex]a_0 = 5[/tex] and also this implies 5 | z
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
5K
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
48
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K