How can you show that n^3+5n is divisible by 6 by mathematical

induction?
1

Answer Follow Request More

7 Answers

Vijay Mankar (विजय मानकर)

Answered September 4, 2020 · Upvoted by Hrishikesh Kulkarni, M.S Information Technology & Mathematics,
University of Mumbai (2007)

PMI

Let P (n) = n
3
+ 5n

Lets check for n = 1

3
P (1) = 1 + 5 × 1 = 6

So, 6 ∣ P (1)

Now, we will assume it's true for n = k,

6 ∣ P (k)

And will prove it for n = k + 1, by induction

3
P (k + 1) = (k + 1) + 5(k + 1)

3
= k + 1 + 3k(k + 1) + 5k + 5

3
= k + 5k + 3k(k + 1) + 6
Open in App

1 P (k) 5

So we need to prove for 3k(k + 1)

One of the factor of this term is 3 and multiplied by two cosecutive numbers which websites it to be even
(divisible by 2 )

So, 6 ∣ P (k + 1)

QED ■

1.4K views · View 4 upvotes · View shares

4 4
 Add a comment...

Mohammad Afzaal Butt, B.Sc Mathematics & Physics, Islamia College Gujranwala (1977)
Answered June 8, 2020

The result is true for n = 1

3 3
n + 5n = 1 + 5(1) = 6 6|6

Let the result be true for n = k, that is 

3
6|(k + 5k)

We need to prove that the result is also true for n= k + 1, that is

3
6|(k + 1) + 5(k + 1)

3
(k + 1) + 5(k + 1)

3 2
= k + 3k + 3k + 1 + 5k + 5

3 2
= (k + 5k) + (3k + 3k + 6)

3
= (k + 5k) + 3k(k + 1) + 6

3
by our assumption  6|k + 5k

k(k + 1)

is a product of two consecutive integers and is divisible by 2

⟹ 6|3k(k + 1)

3
⟹ 6|(k + 5k) + 3k(k + 1) + 6

3
3
⟹ 6|(k + 1) + 5(k + 1)

∴ the result is also true for n = k + 1. Hence by the principle of

mathematical induction the result is true for all n

+
∈ Z

Let n is a negative integer and let n = -m where m is a positive integer.

3 3 3
n + 5n = (−m) + 5(−m) = −(m + 5m)

3 3
∵ 6|m + 5m ⟹ 6| − (m + 5k)

∴ The result is true for all n ∈ Z.

2.8K views · View 3 upvotes

 Add a comment...

Martin Cohen, B.A. from University of California, Los Angeles

1
Answered June 8, 2020 · Upvoted by Brian Wyman, Ph.D. Mathematics, University of Michigan (2010)

For fun, here's a proof without induction.

n^3+5n = n^3-n+6n = (n-1)n(n+1)+6n.

Since (n-1)n(n+1) is the product of 3 consecutive integers, it is divisible by 6, so the sum is divisible by 6.

In general, the product of n consecutive integers is divisible by n!.

422 views · View 1 upvote

Add a comment...

Related Questions (More Answers Below)

How can I prove n

3
− n is divisible by 6, using induction?
23,794 Views

How can you prove by induction that 7^n+ 4^n + 1 is divisible by 6, for n = 1, 2, 3, …?
18,593 Views

How do I prove that $n^3 + 5n$ is always divisible by 6; $n \in \N$?

4,254 Views

Ask new question

Douglas Porter, B Sc Mathematics, The Open University (2011)

Answered June 8, 2020

First of all, is it true for n = 1? Yes, when n = 1 then f(n) = 6 which divides by 6.

Next, assume it is true for n = k. So assume k³ + 5k divides by 6.

Then what happens with n = k + 1? We have (k + 1)³ + 5(k + 1), which expanded becomes k³ + 3k² + 3k + 1
+ 5k + 5 . Rearranging, this is k³ + 5k + 3k² + 3k + 6. By assumption, k³ + 5k divides by 6 so we need to
show that 3k² + 3k + 6 does. This is straightforward: we can rewrite it as 3k(k + 1) + 6, and whether k is odd
or even, k(k + 1) is even so 3k(k + 1) divides by 6.

Therefore if f(k) divides by 6, f(k+1) does, and since f(1) does, f(2) does, so f(3) does, so f(4) does…

Hence proven by induction.

640 views
 Add a comment...

Michiel Bogaert, Unable to carry all the maths books he studied

Answered June 8, 2020

it’s true for n=0

lets suppose it’s true for k, now lets look at k+1

(k+1)³+5(k+1) = k³+3k²+3k+1 +5k +5

now considering we know k³+5k is divisible by 6 all we need to prove is that

3k²+3k+6 is divisible by 6, or

3k²+3k is divisible by 6, or

k²+k is divisible by 2.

Now, consider, that the square of an even number is even and the square of an odd number is odd:

(2p)²=4p² = 2(2p²)

(2p+1)² = 4p²+4p+1 = 2(2p²+2p)+1

so, k² + k is the sum of 2 even, or 2 odd numbers

in both cases the answer is even; and thus divisible by 2

Q.E.D.
2.4K views

Add a comment...

Lukas Schmidinger, I have passed some math courses in university.

Answered June 8, 2020

How can you show that n^3+5n is divisible by 6 by mathematical induction?

I think you want to proof it for the case that n ∈ N

Ok base case 0
3
+ 5(0) = 0 and 0 is divisible by 6

assume n
3
+ 5n is divisible by 6 now look what happens when we plug in n + 1 instead of n

3 3 2
(n + 1) + 5(n + 1) = n + 3n + 8n + 6

3 2
= n + 5n + 6 + 3n + 3n
So we need to show that 3n2 + 3n is always divisible by 6 , well that’s simple if n is even that is a given
and if n is odd than 3n2 + 3n = 3 ⋅ (n + 1) ⋅ n so we have an even number multiplied by 3 this gives 6
.

But I think it is even simpler using modulo classes :

Continue Reading
\begin{array}{|c|c|c|c|c|} \hl

Add a comment...

Eleftherios Argyropoulos, B.S. Mathematics & Physics, Northeastern University (2002)

Answered June 10, 2020

We just have to show that the expression n

3
+ 5n is divisible by 2 and 3 . We have:
3 2
n + 5n = n(n + 5) … (1)

Case 1, n is odd:

For n odd => n

2
+ 5 is even => n(n
2
+ 5) ≡ 0mod2

Case 2, n is even:

For n even => n(n

2
+ 5) is even => n(n
2
+ 5) ≡ 0mod2

For n ≡ 0mod3 => n(n

2
+ 5) ≡ 0mod3

2
n ≡ 1mod3 => (n + 5) ≡ 0mod3

For => n(n

2
+ 5) ≡ 0mod3

2
n ≡ 2mod3 => (n + 5) ≡ 0mod3

For => n(n

2
+ 5) ≡ 0mod3

Therefore, in any case we take:

2
n(n + 5) ≡ 0mod6

719 views

Add a comment...

Related Questions & Answers

How can I prove n

3
− n is divisible by 6, using induction?
 Zain Jabbar, Likes Math
Updated December 25, 2017
Originally Answered: How can I prove n^3-n is divisible by 6 using induction?
This was written before the question asked for a proof by induction. There is another great answer using
induction here: Carlos Eugenio Thompson Pinzón's answer to How can I prove n^3-n is divisible by 6, using
induction? To be divisible by 6 means to be divisible by both 2 and 3. So let's do just tha… Read More

How can you prove by induction that 7^n+ 4^n + 1 is divisible by 6, for n = 1, 2, 3, …?
Harshit Bishnoi, studied at FIITJEE Pune
Answered October 13, 2018

Let’s test the given statement for a scenario where n = 1 , 7^n + 4^n + 1 = 7^1 + 4^1 + 1 = 12 = 6(2)
Therefore we can conclude that this statement holds true for n = 1 . If we prove that this statement holds
true for 2, 3, 4, 5 and subsequently all natural numbers, our task will be accomplished. Let’s ma…Read More

How do I prove that $n^3 + 5n$ is always divisible by 6; $n \in \N$?

Satyanarayana Mudunuri, worked at ITC Limited (1979-2002)
Answered June 15, 2020

We are given n(n^2 + 5) = n((n+1)(n-1) + 6) = (n-1)n(n-1) + 6n Now 6n is always divisible by 6, so we

consider N= (n-1)n(n+1) ….. (1) If n is odd and is not divisible by 3, then (n-1) is even and either (n-1) or
(n+1) divisible by 3 or N is divisible by 2*3=6 If n is odd and is divisible by 3, then (n-… Read More

How you can prove that n^2-2 is not divisible by 5 for any positive integer?
Anusha Nagineni
Answered February 27, 2018

For a number to be divisible by 5 it should end with either 0 or 5. To get 0 as last digit of n^2-2, n^2 should
end with 2. To get 5 as last digit of n^2-2, n^2 should end with 7. Now no square of an integer ends with 2
or 7. So positive of n^2-2 is never divisble by 5. OR Squares of integers ends with 1… Read More

How do I prove that 3

2n+2
− 8n − 9 is divisible by 16 using induction?
Anton Rzhevskyi, Solved a couple math problems
Answered October 29, 2019

First of all, it is not. Let’s consider n=\frac12 3^{2\cdot\frac12+2}-8\cdot\frac12-9= 3^3-4-9= 27-13= 14 14

is not divisible by 16. But I guess you mean that it should be true for n\in\mathbb{N}. In this case we can
prove it. 1. Proof for n=1: 3^{2+2}-16-9= 81-8-9= 64=16\cdot4 2. Assuming, that 3^{(2k+2)}-8k-9\… Read More

Related Questions

How can I prove n

3
− n is divisible by 6, using induction?
23,794 Views

How can you prove by induction that 7^n+ 4^n + 1 is divisible by 6, for n = 1, 2, 3, …?
18,593 Views
 8,593 e s

How do I prove that $n^3 + 5n$ is always divisible by 6; $n \in \N$?

4,254 Views

How you can prove that n^2-2 is not divisible by 5 for any positive integer?
4,222 Views

How do I prove that 3

2n+2
− 8n − 9 is divisible by 16 using induction?
2,121 Views

How can I prove that 19 divides n−1

10 ⋅ 8 + 3
3n−1
by mathematical induction?
2,951 Views

How do you prove by mathematical induction that 2

n
> n
3
for all n ≥ 10 ?
25,206 Views

How can using mathematical induction prove that 21 divides 4

n+1
+ 5
2n−1
?
11,413 Views

How do I prove that if 2

n is divisible by 3 , then n can also be divided by 3 ?
4,293 Views

What is the mathematical induction to show that 512|8.5^n+6.3^2n-80n-14 for all n belong to N?
1,025 Views

Ask new question