Problem 2. Problem 3. Problem 4. Problem 5. Problem 6. Problem 7. Problem 8. Problem 9. Problem Video Transcript it's clear is that when you re here? Find the number of distinguishable permutations of the group of letters. Share Question Copy Link. I'm not sure what you mean by "X" in your notation. Can you explain?
Is this something you were taught, or your own invention? There are 5! If you are still unsure, please explain more fully what you think is not being handled properly. Last edited by a moderator: Nov 17, Were you taught to write your calculations as multiplications of things rather than of numbers as you are doing?
I don't think it's a safe thing to do. BCD isn't a number you can multiply. The notation may be what is confusing you. You haven't clarified what you mean by this last question, which is what I asked about.
EBCD is not among the permutations you are counting, since it has only four letters. So what "potion of the options" do you mean by this? And what do you mean by "handling"? Joined Jan 29, Messages 11, Hmm, sorry its hard to explain. No i wasn't taught any of this, im trying to basically figure it out on my own. Problem 39, page How many ways are there to travel in xyz space from the origin 0,0,0 to the point 4,3,5 by taking steps on unit in the positive x direction, one unit in the positive y direction, or one unit in the positive z direction?
Moving in the negative x, y, or z direction is prohibited, so that no backtracking is allowed. We have to make 4 steps in x direction, 3 steps in y direction and 5 steps in z direction, a total of 12 steps. There are C 12,4 ways to choose which steps will be in x direction. Once they are chosen, there are C 8,3 ways to choose which of the other steps will be in y direction.
The 5 left steps are automatically assigned to z direction. Problem 9, page How many students are enrolled in a course either in calculus, discrete mathematics, data structures, or programming languages at a school if there are , , , and students in these courses, respectively; 14 in both calculus and data structures; in both calculus and programming languages; in both discrete mathematics and data structures; 43 in both discrete mathematics and programming languages; and no student may take calculus and discrete mathematics, or data structures and programming languages concurrently?
Related documents. Download advertisement. Add this document to collection s. Learn more. Ask Question. Asked 2 years, 1 month ago. Active 2 years, 1 month ago.
Viewed times. Bram28 James Ronald James Ronald 2, 1 1 gold badge 11 11 silver badges 30 30 bronze badges. Add a comment.
0コメント