Proving 11 is a factor of 2^(4n+3)+3(5^n)

  • Thread starter Thread starter charmedbeauty
  • Start date Start date
Click For Summary

Homework Help Overview

The problem involves proving that 11 is a factor of the expression 2^(4n+3) + 3(5^n) for non-negative integers n. The discussion centers around mathematical induction and the manipulation of the given expression.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the initial setup of the problem and the transformation of the expression into a form suitable for induction. There is confusion regarding the transition from 2^(4n+3) to 2^(4n+7) and how it relates to the right-hand side of the equation.

Discussion Status

Some participants are exploring the basis step of mathematical induction and checking its validity for specific values of n. Others are providing hints and suggestions for regrouping terms to facilitate the proof, while acknowledging the need for clarity in the manipulation of expressions.

Contextual Notes

There is mention of a potential misclassification of the problem under calculus, indicating that the participants are aware of the broader context of the discussion. The original poster expresses uncertainty about their understanding of mathematical induction, which may affect their approach.

charmedbeauty
Messages
266
Reaction score
0

Homework Statement



Theorem if n is a non-negative integer then 11 is a factor of 2^(4n+3)+3(5^n)

Basic ideas if 2^(4n+3) =11k -3(5^n) then,
2^(4n+7) =11(16k -3(5^n))-3(5^(n+1))



Homework Equations





The Attempt at a Solution



So I understand how they get the result 2^(4n+3) =11k -3(5^n)

but I have no idea how to obtain the second result, namely, 2^(4n+7) =11(16k -3(5^n))-3(5^(n+1)) ?

Im stumped I can obviously see how they have added another 2^4 but I really don't see how that produces RHS. Help!
 
Physics news on Phys.org
Mathematical induction, k \rightarrow k+1
 
Karamata said:
Mathematical induction, k \rightarrow k+1

Ok but when I do my basis step for n=1...

2^(4+3) +15 = 11k

so 2^7 +15 =11k

so 143= 11(13) which is true

so if 2^(4n+3)=11k -3(5^n)...

so 11k = 2^(4n+3) +3(5^n)

now check its true for n+1

so 2^(4(n+1)+3) =11K-3(5^(n+1))

so 2^(4n+7) = 11k-3(5^(n+1))

so subing in for 11k from above I have

2^(4n+7) = (2^(4n+3)+3(5^n))-3(5^(n+1))'

but I need to show

2^(4n+7)=11(16k-3(5^n))-3(5(n+1))

?

I have not really done any mathematical induction before I just watched a few videos, so I have probably done something wrong. Help!

so 1
 
This shouldn't be under Calculus. :wink:

Here's a hint:

2^{4(n+1) + 3} + 3.5^{n+1} = 16.2^{4n + 3} + 5.(3.5^n)

and 16 = 5 + 11. Regroup those factors! :biggrin: Try and manipulate it into something like:

p.(2^{4n + 3} + 3.5^n) + 11q

where p and q are integers or integral expressions that I'll leave you to determine.

Once you've assumed the inductive hypothesis that (2^{4n + 3} + 3.5^n) is a multiple of 11, wouldn't that whole expression magically become a multiple of 11 too?

Then all you need to do is test it for n=1.:smile:
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
15
Views
3K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K