Problem preview
N-CN.9 Warmup M3-046-A09-V01

Know the Fundamental Theorem of Algebra and connect it to polynomial roots.

Enumerate polynomial root structures by degree slots

Problem

A \(\text{degree}-4\) real-coefficient polynomial has \(\text{two}~\text{specified}~\text{simple}~\text{real}~\text{roots}\). Describe every possible structure for the \(\text{remaining}~\text{two}~\text{degree}~\text{slots}\), counting multiplicity.

Big Picture

What this problem is really about

Treat the degree as a fixed number of multiplicity slots. Account for the stated simple roots first, then partition the remaining slots among additional real-root occurrences or nonreal roots. For real coefficients, nonreal slots must be grouped into conjugate pairs, while real slots may represent distinct roots or repeated occurrences of the same root.

Inside Gozunta

Turn the preview into practice.

More than a preview

Gozunta lets you study this problem—and more than 10,000 others.

Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.

Discover Gozunta Try it now
Four variants of this problem type
Curriculum context
Course
Math III
Standard
N-CN.9
Category
Number and Quantity
Domain
The Complex Number System
Objective
Know the Fundamental Theorem of Algebra and connect it to polynomial roots.
Problem type
Enumerate polynomial root structures by degree slots