What would you like to understand?

Popular destinationsCalculatorsCoursesPracticeFormulas

Unlock Premium Help

Explore every tutor and study workspace for seven days, with no daily AI cap during the trial.

Choose a billing period
Ask a parent to pay

Nothing is charged during the first seven days. Unless you cancel, the plan you selected begins when the trial ends and renews on its stated schedule. Manage cancellation from your plan page. Stripe handles the payment details.

← Abstract Algebra
00:00

Find out what you can choose without a model.

Guided mode reveals one clue and immediate feedback. Quiet-test mode postpones the review until the complete run is submitted.

Course areas in this rehearsal

Treat the list as a dependency map. A later miss may point back to an earlier definition or representation.

Groups

Groups: Name the objects and notation before applying a rule.

Subgroups

Subgroups: Connect the symbolic form to a graph, diagram, table, or example.

Homomorphisms

Homomorphisms: Compare two methods and record when each one is valid.

Quotient groups

Quotient groups: Finish with an unfamiliar problem and an independent check.

Rings and ideals

Rings and ideals: Name the objects and notation before applying a rule.

Polynomial rings

Polynomial rings: Connect the symbolic form to a graph, diagram, table, or example.

Field extensions

Field extensions: Compare two methods and record when each one is valid.

Eight original decision checks

These fixed prompts test study and verification choices across the course map. The interactive builder above creates mathematical questions separately.

Question 1: In the group of integers modulo 15 under addition, what is the order of the element 6?

Groups

  1. 5
  2. 6
  3. 15
  4. 3
Inspect the reasoning
  1. The order is the smallest positive k with 6k equal to 0 modulo 15.
  2. In this group the order of an element a is 15 divided by gcd(a, 15).
  3. gcd(6, 15) = 3.
  4. 15 / 3 = 5. Check: 6 x 5 = 30, and 30 is 0 modulo 15.

Best choice: 5

Question 2: A group has order 12. Which of these can NOT be the order of one of its subgroups?

Subgroups

  1. 8
  2. 6
  3. 4
  4. 3
Inspect the reasoning
  1. Lagrange's theorem says a subgroup's order must divide the order of the group.
  2. The divisors of 12 are 1, 2, 3, 4, 6, and 12.
  3. 6, 4, and 3 are all on that list.
  4. 8 does not divide 12, so no subgroup can have order 8.

Best choice: 8

Question 3: Define a map from the integers modulo 12 to the integers modulo 4 by reducing each class modulo 4. What is the order of the kernel?

Homomorphisms

  1. 3
  2. 4
  3. 12
  4. 1
Inspect the reasoning
  1. The kernel holds every element that maps to 0.
  2. Those are the classes of 0, 4, and 8.
  3. That is 3 elements.
  4. This matches the first isomorphism theorem: 12 / 4 = 3.

Best choice: 3

Question 4: What is the order of the quotient group formed by the integers modulo 12 divided by the subgroup generated by 4?

Quotient groups

  1. 4
  2. 3
  3. 8
  4. 12
Inspect the reasoning
  1. The subgroup generated by 4 is {0, 4, 8}, which has 3 elements.
  2. The order of a quotient group is the group order divided by the subgroup order.
  3. 12 / 3 = 4.
  4. So the quotient group has 4 elements.

Best choice: 4

Question 5: How many units does the ring of integers modulo 12 have?

Rings and ideals

  1. 4
  2. 6
  3. 11
  4. 12
Inspect the reasoning
  1. An element is a unit exactly when it shares no factor with 12 other than 1.
  2. Test each: 1, 5, 7, and 11 have gcd 1 with 12.
  3. Everything else shares a factor of 2 or 3.
  4. So there are 4 units, which agrees with Euler's totient of 12.

Best choice: 4

Question 6: Is x^2 + 1 irreducible over the integers modulo 3, and how many elements does the resulting quotient ring have?

Polynomial rings

  1. Irreducible, and the quotient is a field with 9 elements
  2. Reducible, and the quotient has 9 elements
  3. Irreducible, and the quotient is a field with 3 elements
  4. Reducible, and the quotient has 6 elements
Inspect the reasoning
  1. A degree-2 polynomial is reducible over a field exactly when it has a root there.
  2. Test all three elements: 0 gives 1, 1 gives 2, and 2 gives 4 which is 1 modulo 3.
  3. No root, so x^2 + 1 is irreducible and the quotient ring is a field.
  4. Its elements are a + bx with a and b from three choices each, giving 3 x 3 = 9 elements.

Best choice: Irreducible, and the quotient is a field with 9 elements

Question 7: What is the degree of the field extension of the rationals by both the square root of 2 and the square root of 3?

Field extensions

  1. 4
  2. 2
  3. 6
  4. 8
Inspect the reasoning
  1. Adjoining the square root of 2 gives a degree 2 extension.
  2. The square root of 3 is not in that field, so adjoining it gives another degree 2 step.
  3. Degrees multiply in a tower of extensions.
  4. 2 x 2 = 4, with basis 1, root 2, root 3, and root 6.

Best choice: 4

Question 8: How many elements of order 2 are in the direct product of the integers modulo 2 and the integers modulo 4?

Groups

  1. 3
  2. 1
  3. 4
  4. 2
Inspect the reasoning
  1. An element (a, b) has order 2 when doubling it gives (0, 0) but the element itself is not (0, 0).
  2. In the first factor, a can be 0 or 1, and both double to 0.
  3. In the second factor, b must satisfy 2b = 0 modulo 4, so b is 0 or 2.
  4. That gives (0,0), (0,2), (1,0), (1,2). Removing the identity leaves 3 elements of order 2.

Best choice: 3

After the run

Sort each miss into interpretation, recall, setup, execution, verification, or pacing. Schedule a changed question that tests the corrected decision without reusing the same surface details.

When should I increase difficulty?

Increase it after setup is accurate without a clue and you can explain why the method fits.

When should I use test mode?

Use it once guided sets are stable and you want evidence about selection, pacing, and sustained attention.

Printed question coverage
QuestionsReview
8 original promptsChoices, answer, and worked reasoning