Since \(2 \cdot 7^{m}+3 \cdot 5^{m}-5\) is divisible by \(24\), we have only to prove that \(12 \cdot 7^{m}+12 \cdot 5^{m}\) is divisible by \(24\).

\(12 \cdot 7^{m}+12 \cdot 5^{m}=12(7^{m}+5^{m})\) which is divisible by \(24\) since \(7^{m}\) and \(5^{m}\) are both odd numbers and their sum is an even number.

Hence \(2 \cdot 7^{n}+3 \cdot 5^{n}-5\) is divisible by \(24\) for all integers \(n>0\).

I'm surprised that you don't know Induction. You should read the wiki and be familiar with it. This is a standard problem in divisibility by induction.

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestStep \(1\): when \(n=1\), we have \(2 \cdot 7^{n}+3 \cdot 5^{n}-5=2 \cdot 7+3 \cdot 5 -5=24\) which is divisible by \(24\).

Step \(2\): Assume this to be true for \(n=m\). Then \(2 \cdot 7^{m}+3 \cdot 5^{m}-5\) is divisible by \(24\).

Step \(3\): Now, \(2 \cdot 7^{m+1}+3 \cdot 5^{m+1}-5\)

\(=2 \cdot 7^{m} \times 7+ 3 \cdot 5^{m} \times 5-5\)

\(=14 \cdot 7^{m}+15 \cdot 5^{m}-5\)

\(=2 \cdot 7^{m}+3 \cdot 5^{m}-5+12 \cdot 7^{m}+12 \cdot 5^{m}\)

Since \(2 \cdot 7^{m}+3 \cdot 5^{m}-5\) is divisible by \(24\), we have only to prove that \(12 \cdot 7^{m}+12 \cdot 5^{m}\) is divisible by \(24\).

\(12 \cdot 7^{m}+12 \cdot 5^{m}=12(7^{m}+5^{m})\) which is divisible by \(24\) since \(7^{m}\) and \(5^{m}\) are both odd numbers and their sum is an even number.

Hence \(2 \cdot 7^{n}+3 \cdot 5^{n}-5\) is divisible by \(24\) for all integers \(n>0\).

Log in to reply

Excellent, thank you genius!

Log in to reply

Your Welcome :)

Log in to reply

Hint: Show that it is true for n=1. Then show that if the statement is true for any arbitrary positive integer m, then it is true for m+1.

Log in to reply

That's an obvious hint lol xD

Log in to reply

Can you show the m+1 step? This is where I'm getting stuck at.

Log in to reply

Only tool (with me ):MATHEMATICAL INDUCTION

Log in to reply

I'm surprised that you don't know Induction. You should read the wiki and be familiar with it. This is a standard problem in divisibility by induction.

Log in to reply

Lol, I assumed powers of \(5\) to be even by mistake, and thus couldn't get the result!

Log in to reply

This is true only for n equals 1. It is not true for numbers bigger than 1.

Log in to reply

@ Mohamed Sultan - You are wrong. Go back and try it for n = 2, 3, and 4, for instance.

Log in to reply