Counting problem involving numbered cards
- Context: MHB
- Thread starter Milly
- Start date
Click For Summary
Discussion Overview
The discussion revolves around a counting problem involving nine numbered cards, specifically focusing on how many different 3-digit numbers can be formed from these cards under certain conditions. The problem is presented in the context of combinatorial mathematics.
Discussion Character
- Homework-related
- Mathematical reasoning
Main Points Raised
- One participant asks for help with part (b) of the problem, indicating they are unsure how to proceed.
- Another participant suggests that the original poster should share their attempts to solve the problem to facilitate better assistance.
- A participant mentions trying to use the permutation formula 5P2 but found it ineffective for this problem.
- A later reply provides a detailed listing of possible 3-digit numbers that can be formed, specifically those between 200 and 300, and concludes with a count of 22 different numbers.
Areas of Agreement / Disagreement
The discussion does not appear to have a consensus, as participants are exploring different methods and approaches to solving the problem without resolving the effectiveness of each method.
Contextual Notes
There may be limitations regarding the assumptions made about the arrangement of the cards and the interpretation of the problem, as well as the effectiveness of the proposed methods.
Similar threads
- · Replies 4 ·
- · Replies 7 ·
- · Replies 15 ·
- · Replies 9 ·
- · Replies 3 ·
- · Replies 6 ·
- · Replies 1 ·
- · Replies 1 ·
- · Replies 6 ·
- · Replies 2 ·