- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Prove that one of any three consecutive positive integers must be divisible by 3.

To do:

We have to prove that one of any three consecutive positive integers must be divisible by 3.

Solution:

Let $a = n, b = n + 1$ and $c =n + 2$

Order triplet is $(a, b, c) = (n, n + 1, n + 2)$

where, $n$ is any positive integer

At $n = 1$

$(a, b, c) = (1, 1 + 1, 1 + 2)$

$= (1, 2, 3)$

At $n = 2$

$(a, b, c) = (2, 2 + 1, 2 + 2)$

$= (2, 3, 4)$

At $n = 3$

$(a, b,c) = (3, 3 + 1, 3 + 2)$

$= (3,4,5)$

At $n =4$

$(a,b, c) =(4, 4 + 1, 4 +2)$

$= (4, 5, 6)$

At $n = 5$

$(a, b,c) = (5, 5 + 1, 5 +2)$

$= (5,6,7)$

At $n = 6$

$(a,b, c) = (6, 6 + 1, 6 + 2)$

$= (6,7,8)$

At $n = 7$

$(a, b,c) = (7, 7 +1, 7 + 2)$

$= (7,8,9)$

At $n = 8$

$(a, b,c) = (8,8+ 1, 8+ 2)$

$= (8,9,10)$

We observe that each triplet consists of one and only one number which is a multiple of 3.

Hence, one of any three consecutive positive integers must be divisible by 3.

- Related Questions & Answers
- Number of Groups of Sizes Two Or Three Divisible By 3 in C++
- Check if a number can be written as sum of three consecutive integers in C++
- Golang Program to print all integers between a range that aren't divisible by either 2 or 3
- Count of m digit integers that are divisible by an integer n in C++
- Find minimum sum such that one of every three consecutive elements is taken in C++
- Greatest Sum Divisible by Three in C++
- Check if any permutation of a number is divisible by 3 and is Palindromic in Python
- Python Program to Print all Integers that are not Divisible by Either 2 or 3 and Lie between 1 and 50
- Number of digits to be removed to make a number divisible by 3 in C++
- Possible cuts of a number such that maximum parts are divisible by 3 in C++
- Find permutation of n which is divisible by 3 but not divisible by 6 in C++
- Elements of an array that are not divisible by any element of another array in C++
- Number of substrings divisible by 8 and not by 3 in C++
- Minimum value that divides one number and divisible by other in C++
- Maximum subsequence sum such that no three are consecutive
- Can one's pride be positive too?