QTT2 Finite Mathematics, catalog number MATH 5710, is the two-competency-unit course covering discrete mathematics and number system properties, including sets and their operations, primes, greatest common divisor and least common multiple, and modular arithmetic. The catalog lists it as a legacy code. It is the course where mathematics education students meet number theory, and its distinguishing feature is that answers are often easy while justifications are not. The scored skill is argument, not calculation.
What MATH 5710 is actually testing
Discrete mathematics deals with things you can count and separate rather than measure continuously, and that changes the style of reasoning. There are no limits, no approximations and no error bars. A statement about integers is either true or false, and the way you establish it is by argument from definitions. That makes this course the natural home of proof habits inside a mathematics education program, even where formal proof is not the stated requirement.
Set operations look trivial and carry more than students expect. Union, intersection, complement and difference behave in ways that mirror logical connectives, and the correspondence between set operations and logic is a genuine insight rather than a coincidence. Being able to move between a set statement, a Venn diagram and a logical statement demonstrates the representational fluency these courses assess.
The number theory strand rests on divisibility. Primes are the multiplicative building blocks, and unique factorization is what makes them useful: every integer greater than one factors into primes in exactly one way. Greatest common divisor and least common multiple both follow directly from factorization, and the relationship between them, that their product equals the product of the two original numbers, is the kind of result you should be able to explain rather than recall.
Modular arithmetic is where the course becomes most obviously teacher-relevant, because it is arithmetic on a clock and every learner already understands clocks. Congruence means two numbers leave the same remainder on division, and the reason modular arithmetic works so cleanly is that addition and multiplication respect that relationship. Divisibility rules, check digits and calendar calculations all fall out of it, which gives a teacher a supply of genuinely interesting problems.
Planning study and written work from the rubric
Scoring detail lives in your Course of Study rather than in the public catalog. Read the aspects before deciding how much of your effort goes to computation and how much to written justification. Each aspect is scored independently against a three-point scale and a 2 in each aspect passes the task.
Where the course is assessed by a performance assessment, structure by aspect and put the justification in prose beside the mathematics rather than leaving the working to speak for itself. In a course about argument, working alone rarely satisfies an aspect.
The word budget, worked. Assume five scored aspects and directions calling for roughly 1,400 words of written justification alongside worked problems. Take 110 for framing and 90 for a close, leaving about 1,200 across five aspects, or 240 each. Then rebalance toward the argumentative aspects: anything asking you to justify, prove or explain why a result holds deserves 350, funded by keeping computational commentary near 160.
If your assessment is an objective one, study definitions rather than procedures. Almost every question in discrete mathematics is answerable by someone who can state the definitions precisely, and almost none are answerable by someone who has memorized worked examples without them.
A structure that fits a discrete mathematics deliverable
Where task directions specify a format, follow them exactly. Where the arrangement is yours, this order keeps definitions ahead of the arguments that depend on them.
| Section | What belongs in it | How it tends to be scored |
|---|---|---|
| Definitions | The terms the argument will rely on, stated precisely | Short, and it makes every later justification checkable |
| Set work | Operations performed, with a diagram and the equivalent logical statement | Scored for moving between representations |
| Divisibility and primes | Factorizations shown, with the reasoning that produced them | Scored for method rather than for the factorization alone |
| GCD and LCM | Both computed, with the relationship between them explained | The explanation is the aspect; two numbers are not an argument |
| Modular arithmetic | Congruences established, with the modulus stated every time | Scored for correct use of congruence notation |
| Justification | Why each result holds, argued from the definitions above | The heart of a discrete mathematics course |
| Application | A concrete use, such as a divisibility rule or a scheduling problem | Where teacher content courses reward connection to teaching |
State the modulus every single time you write a congruence. It feels repetitive and it prevents the single most common notation error in the subject, which is a congruence statement that is true under one modulus and false under another with no way for a reader to tell which was meant.
Evidence craft in discrete mathematics
In a subject where answers are short, the evidence is entirely in the reasoning, which raises the standard for how that reasoning is written.
- Quote the definition you are using before you use it. Most discrete arguments are definitions applied carefully, and naming them makes the argument complete.
- Show factorizations in full rather than asserting a greatest common divisor. The method is what gets scored.
- Use set notation consistently, and pair any Venn diagram with the symbolic statement it illustrates.
- Write congruences with their modulus attached, and say what remainder class you are working in.
- Justify generalizations. A pattern observed in four cases is a conjecture, and saying that explicitly is better than presenting it as established.
- Cite any borrowed problem or text in APA where the rubric asks for citation, and keep quotation minimal since WGU scans submissions for authenticity.
The strongest work in this course includes a counterexample somewhere. Showing that a plausible-sounding claim fails for a specific integer demonstrates command of the definitions more convincingly than any number of confirming cases, and it is exactly the move a mathematics teacher needs to model.
What separates Competent from work sent back
Work is Competent or Not Competent, with no letter grades and no ordinary grade point average. Performance assessment work can be revised and resubmitted with no grade penalty, so a return costs days inside a six-month flat-rate term.
Discrete mathematics work that clears on the first read tends to have:
- Definitions stated before the arguments that use them.
- Factorizations and computations shown in full rather than asserted.
- Set operations paired with both diagrams and symbolic statements.
- Every congruence carrying its modulus.
- Generalizations either justified or labelled as conjectures.
- At least one applied connection, such as a divisibility rule explained from modular arithmetic.
Where a proctored objective assessment is part of this course in your plan, the boundary holds absolutely. Proctored exams are yours to sit. Support is preparation only: definition drills, worked practice and an honest readiness verdict. We never ask for portal credentials.
Six mistakes that cost time in QTT2
- Answering without justifying. The answers in discrete mathematics are short, and the reasoning is the entire assessable content.
- Omitting the modulus. A congruence without its modulus is not a statement, and it is the most common notation failure in the subject.
- Confusing greatest common divisor with least common multiple. They answer opposite questions, and the mix-up survives to the answer undetected.
- Diagrams without symbols. A Venn diagram illustrates a claim; the symbolic statement is the claim.
- Generalizing from examples. Four confirming cases are a conjecture, and presenting one as proved is precisely the habit the course exists to correct.
- Skipping the definition. Almost every returned argument in this subject is one that used a term without pinning down what it meant.
How support works on this course
Discrete mathematics is the course where students most often have the right answer and no argument for it. Send the rubric from your Course of Study and the task directions if a written deliverable is involved. The work comes back with definitions surfaced before the reasoning that depends on them, factorizations and methods shown in full, congruences given their moduli, set statements paired with diagrams, and generalizations either argued or honestly labelled as conjectures.
Two competency units against a flat-rate six-month term makes this an efficient course to close, and the proof habits it builds carry directly into abstract algebra and linear algebra, where the same discipline is assumed from the first page. There is a classroom dividend as well. Modular arithmetic is one of the few university topics that transfers straight into a school lesson without translation, because a clock face is a model every learner already owns. Teachers who leave this course with three good modular problems in their pocket tend to use them for years.
Questions students ask about QTT2
Is QTT2 the same course as MATH 5710?
Is finite mathematics the same as discrete mathematics?
Do I need to write formal proofs?
Right answers, no argument behind them?
Send your rubric and any task directions. Definitions get surfaced first, methods get shown in full, congruences get their moduli, and conjectures get labelled honestly.
Where QTT2 sits in WGU's programs
The July 2026 catalog places this code in 2 current WGU programs. Open a program page for the complete standard path and term positions. The live Degree Plan remains authoritative after transfer credit, substitutions, and mentor planning.
The assessments, one by one
The public catalog does not publish this course's PA/OA identity or task count. WGU Tutors publishes at most one PA manual per course and only from a WGU-controlled public rubric. Until that source exists, PA help begins from the student's real Course of Study and OA support remains preparation only.