OpenStax, Algebra and Trigonometry 2e §13.7 Probability · Review Exercise 104 · Probability · Counting & chance

Probability · Review Exercise 104

How many distinct rearrangements of the letters of the word DEADWOOD are there if the arrangement must begin and end with the letter D?

Its source prints no answer for this problem, so there's nothing to check against.

~8 minWritten answer · check your work with Lemma

OpenStax, Algebra and Trigonometry 2e · §13.7 Probability · Review Exercise 104

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.