Discrete Math - quick probability questions.

Click For Summary
The discussion focuses on solving probability problems related to the occurrence of the digit 6 in integers from 1 to 100,000. One participant calculates that there are 38,805 integers containing the digit 6 exactly once using the multiplication rule. They express uncertainty about determining how many integers contain the digit 6 at least once and how to calculate the probability of selecting an integer with two or more occurrences of 6. Another participant suggests inverting the problem to simplify finding the count of integers that do not contain the digit 6. Overall, the conversation emphasizes the challenges in applying probability rules to this specific numeric range.
KingsFoil
Messages
1
Reaction score
0
For the life of me I am having a hard time understanding how to do problems of this nature. As I understand it, were using the multiplication rule here with a twist.a. How many integers from 1 through 100,000 contain the
digit 6 exactly once?

5 * 9 * 9 * 9 * 9 = 38805 is what I have. Because the digit 6 can appear in 5 different locations.

b. How many integers from 1 through 100,000 contain the
digit 6 at least once?

c. If an integer is chosen at random from 1 through
100,000, what is the probability that it contains two or
more occurrences of the digit 6?

I am clueless here. Add up all the possibilities of containing two 6's...three 6's... four 6's... five 6's and then divide by the total possibilities.That's my line of thinking... I am just not sure how to find the amount of possibilities for each partition.
 
Last edited:
Physics news on Phys.org
KingsFoil said:
b. How many integers from 1 through 100,000 contain the
digit 6 at least once?

How many integers are there that do not contain any digit 6?
 
  • Like
Likes KingsFoil
KingsFoil said:
b. How many integers from 1 through 100,000 contain the
digit 6 at least once?

The first thing I always try in probability problems is to invert it. P(X) = 1 - P(not X)
It's easy to give it a shot, and often the resulting problem is much simpler.

In this case not X is
b') How many integers from 1 through 100,000 do not contain digit 6?
I bet that you can do that.

KingsFoil said:
c. If an integer is chosen at random from 1 through
100,000, what is the probability that it contains two or
more occurrences of the digit 6?

I am clueless here. Add up all the possibilities of containing two 6's...three 6's... four 6's... five 6's and then divide by the total possibilities.That's my line of thinking... I am just not sure how to find the amount of possibilities for each partition.

Try my special magic rule again.
 
  • Like
Likes KingsFoil and fresh_42
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 3 ·
Replies
3
Views
780
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 41 ·
2
Replies
41
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K