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
AI Thread Summary
There are 3^n n-digit numbers that can be formed using the digits 4, 5, and 6, with repetition allowed. The discussion centers on proving this statement through mathematical induction. The base case, P(1), is established as true since there are three single-digit options. The inductive step shows that if P(k) is true, then P(k+1) follows logically by multiplying the existing k-digit combinations by the three possible digits for the new position. The proof is confirmed as sufficient for demonstrating the original claim.
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 P(1) is true, because we have only 4, 5, 6.

But it seems to me unreasonable to say P(k)=> P(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 P(1) is true, because we have only 4, 5, 6.

But it seems to me unreasonable to say P(k)=> P(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 3^k * 3 = 3k+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.
 
ok thanks :D
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top