Prove that there are 3^n n-digit numbers formed with 4, 5 ,6

  • Thread starter Thread starter tonit
  • Start date Start date
  • Tags Tags
    Numbers
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
4 replies · 2K views
tonit
Messages
55
Reaction score
1

Homework Statement


Prove that there are 3^n n-digit numbers formed with the numbers 4, 5, 6.
The digits can be repeated, e.g.: 444.


Homework Equations


-


The Attempt at a Solution


What I thought was to prove it by induction. So [itex]P[/itex](1) is true, because we have only 4, 5, 6.

But it seems to me unreasonable to say [itex]P[/itex](k)[itex]=> P[/itex](k+1)

any help is appreciated
 
Physics news on Phys.org
tonit said:

Homework Statement


Prove that there are 3^n n-digit numbers formed with the numbers 4, 5, 6.
The digits can be repeated, e.g.: 444.

Homework Equations


-

The Attempt at a Solution


What I thought was to prove it by induction. So [itex]P[/itex](1) is true, because we have only 4, 5, 6.

But it seems to me unreasonable to say [itex]P[/itex](k)[itex]=> P[/itex](k+1)

any help is appreciated

Hi tonit! :smile:

So suppose there are ##3^k## numbers with k digits.
The numbers with (k+1) digits would be one digit longer.
That is, they would have one more digit to the left.

How many numbers of (k+1) digits could you make, given that the last k digits are fixed?
 
that would be [itex]3^k * 3 = 3[/itex]k+1
thanks btw for the reply.

so is all this enough, or does the problem need other explanations. ?
 
A proof by full induction involves 2 steps.

The boundary condition that ##P_{(1)}## is true.

The induction hypothesis that ##P_{(k)}## is true, followed by the proof that it implies that ##P_{(k+1)}## is true as well.

You just showed both.
So yes, that is enough.