Chapter 8: Problem 4
How many permutations of \(1,2,3,4,5,6,7\) are not derangements?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 8: Problem 4
How many permutations of \(1,2,3,4,5,6,7\) are not derangements?
All the tools & learning materials you need for study success - in one app.
Get started for free
At Flo's Flower Shop, Flo wants to arrange 15 different plants on five shelves for a window display. In how many ways can she arrange them so that each shelf has at least one, but no more than four, plants?
Professor Bailey has just completed writing the final examination for his course in advanced engineering mathematics. This examination has 12 questions, whose total value is to be 200 points. In how many ways can Professor Bailey assign the 200 points if (a) each question must count for at least 10 , but no more than 25 , points? (b) each question must count for at least 10 , but not more than 25 , points and the point value for each question is to be a multiple of 5 ?
Determine the number of positive integers \(n, 1 \leq n \leq 2000\), that are a) not divisible by 2,3 , or \(5 .\) b) not divisible by \(2,3,5\), or 7 . c) not divisible by 2,3, or 5, but are divisible by \(7 .\)
In how many ways can one arrange the letters in CORRESPONDENTS so that (a) there is no pair of consecutive identical letters? (b) there are exactly two pairs of consecutive identical letters? (c) there are at least three pairs of consecutive identical etters?
Compute \(\phi(n)\) for \(n\) equal to (a) 51 ; (b) 420 ; (c) 12300 .
What do you think about this solution?
We value your feedback to improve our textbook solutions.