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
Click For Summary

Homework Help Overview

The problem involves proving that there are 3^n n-digit numbers formed using the digits 4, 5, and 6, with repetition allowed.

Discussion Character

  • Exploratory, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss using mathematical induction as a method for proof. The original poster considers the base case and expresses uncertainty about the inductive step. Others suggest examining how the addition of a digit affects the total count of numbers.

Discussion Status

The discussion is active, with participants exploring the structure of the proof by induction. Some guidance has been offered regarding the induction steps, and there appears to be a productive exchange of ideas about the reasoning involved.

Contextual Notes

Participants are navigating the requirements of a formal proof and discussing the implications of their reasoning within the context of mathematical induction.

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
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 11 ·
Replies
11
Views
4K
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
7K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K