Skip to main content
Revision NotesLET Secondary · MathematicsReal content

LET Secondary MathematicsLogic and Mathematics in the Modern WorldRevision Notes

Revision notes for LET Secondary Mathematics — Logic and Mathematics in the Modern World. Short, focused, and designed for the week before exam day. Use these when you are already familiar with the chapter and need a quick refresh on the high-yield items Professional Regulation Commission (PRC) tests.

Exam context

Professional Regulation Commission (PRC) runs the Licensure Examination for Professional Teachers — Secondary on Bi-annual. Its Mathematics section sits under a "Core" weighting, and Logic and Mathematics in the Modern World is the 7th chapter in the 7-chapter LET Secondary Mathematics rotation. The LET Secondary passing mark is Weighted average of 75% with no grade below 50%, and the most recent 2026 paper drew about a meaningful share of questions from Mathematics.

Logic and Mathematics in the Modern World - Revision Notes

This chapter covers two intertwined pillars of the Mathematics in the Modern World GE course: elementary logic (statements, connectives, valid reasoning) and mathematics as a practical tool (patterns, sequences, finance, codes, and data). The LET tests both precision in evaluating truth values and the ability to apply formulas in real-world contexts. As a future elementary teacher, understanding these concepts also helps you model logical thinking for Grades 1–6 pupils, consistent with DepEd's K–12 curriculum goal of developing critical and analytical thinkers. Master the rules, memorize the key formulas, and practice translating word problems into mathematical statements.

Sections

Formulas

Example

p: It is raining. q: The ground is wet. p ∧ q: It is raining AND the ground is wet. This is TRUE only if both are true at the same time.

Formula

p ∧ q = TRUE only if p = TRUE and q = TRUE

Variables

p and q are any simple statements

Application

Use when a sentence contains 'and' — both conditions must hold.

Example

p → q: 'If a number is even, then it is divisible by 2.' If p is TRUE (the number IS even) but q is FALSE (it is NOT divisible by 2), then the statement is FALSE. But a TRUE hypothesis always leads to a TRUE conclusion for this particular example, so the statement is always TRUE.

Formula

p → q = FALSE only if p = TRUE and q = FALSE

Variables

p = hypothesis (antecedent), q = conclusion (consequent)

Application

Use for all 'if…then' sentences. Memorize: a TRUE hypothesis leading to a FALSE conclusion is the ONE way the conditional fails.

Exam Tips

  • Memorize the ONE row that makes the conditional FALSE: p = T, q = F → p → q = F.
  • For truth-table questions, build the table systematically: fill in p and q columns first, then compute ¬p and ¬q, then compound expressions left to right.
  • When a question asks for the truth value of a long compound statement, substitute T/F for each variable and simplify step by step.
  • Remember: conjunction (∧) is strict — it needs BOTH; disjunction (∨) is lenient — it needs ONLY ONE.

Key Points

  • A statement (proposition) is a declarative sentence that is either TRUE or FALSE — never both and never neither.
  • Commands ('Close the door.') and questions ('Is Manila the capital?') are NOT statements because they cannot be assigned a definite truth value.
  • Simple statements express one idea; compound statements join two or more simple statements using logical connectives.
  • Negation (¬p) flips the truth value: if p is TRUE, then ¬p is FALSE, and vice versa.
  • Conjunction (p ∧ q) is TRUE only when BOTH p and q are TRUE — if even one is false, the conjunction is false.
  • Disjunction (p ∨ q) is TRUE when AT LEAST ONE of p or q is TRUE — it is false only when both are false.
  • Conditional (p → q) is FALSE only when the hypothesis (p) is TRUE and the conclusion (q) is FALSE. All other combinations are true.
  • Biconditional (p ↔ q) is TRUE when p and q have the SAME truth value (both true or both false).
  • The most tested truth-value row in the LET: a conditional p → q is FALSE when p = TRUE and q = FALSE.

Definitions

Term

Statement (Proposition)

Definition

A declarative sentence with a definite truth value of either TRUE or FALSE.

Importance

The fundamental building block of all logic. The LET asks you to identify which sentences are valid statements before assigning truth values.

Term

Negation (¬p)

Definition

The logical opposite of a statement p. If p is TRUE, ¬p is FALSE; if p is FALSE, ¬p is TRUE.

Importance

Essential for forming the inverse, contrapositive, and applying De Morgan's Laws.

Term

Conjunction (p ∧ q)

Definition

A compound statement that is TRUE only when BOTH component statements are TRUE.

Importance

Corresponds to the set operation INTERSECTION (A ∩ B). Critical for evaluating compound truth tables.

Term

Disjunction (p ∨ q)

Definition

A compound statement that is TRUE when AT LEAST ONE component is TRUE.

Importance

Corresponds to the set operation UNION (A ∪ B). The inclusive 'or' used in mathematics.

Term

Conditional (p → q)

Definition

An 'if p, then q' statement that is FALSE only when the hypothesis (p) is TRUE and the conclusion (q) is FALSE.

Importance

The most tested connective on the LET. You must know all four truth-value combinations.

Term

Biconditional (p ↔ q)

Definition

A 'p if and only if q' statement that is TRUE only when p and q share the same truth value.

Importance

Equivalent to saying (p → q) ∧ (q → p). Tested in equivalence questions.

Section Title

Statements and Logical Connectives

Common Mistakes

  • Thinking a conditional is false when the hypothesis is false — it is actually TRUE (a false hypothesis makes the conditional vacuously true).
  • Confusing inclusive 'or' (at least one true = TRUE) with exclusive 'or' (exactly one true). Mathematics uses inclusive or.
  • Labeling commands and questions as statements — they are NOT propositions because you cannot assign them a truth value.
  • Forgetting that negation applies to the WHOLE statement, not just the subject noun.

Formulas

Example

Original: 'If a number is divisible by 6, then it is divisible by 3.' Contrapositive: 'If a number is NOT divisible by 3, then it is NOT divisible by 6.' Both are TRUE — they are logically equivalent.

Formula

Contrapositive of p → q is ¬q → ¬p

Variables

p = original hypothesis, q = original conclusion, ¬ = negation

Application

To prove a conditional, it is sometimes easier to prove its contrapositive instead, since they are logically equivalent.

Example

Negate: 'The classroom is clean AND orderly.' → 'The classroom is NOT clean OR it is NOT orderly.' (¬(p ∧ q) ≡ ¬p ∨ ¬q)

Formula

De Morgan's Laws: ¬(p ∧ q) ≡ ¬p ∨ ¬q AND ¬(p ∨ q) ≡ ¬p ∧ ¬q

Variables

p and q are any statements; ¬ = negation; ∧ = and; ∨ = or

Application

Use when asked to negate a compound 'and' or 'or' statement. The negation of 'and' becomes 'or' and vice versa.

Exam Tips

  • Use the memory aid 'CONIC': Converse = O-pposite order; Inverse = N-egate; Contrapositive = C-ombine both.
  • Quick check: original and contrapositive always match in truth value; converse and inverse always match each other.
  • For De Morgan's: 'NOT (A and B)' = 'NOT A OR NOT B'. Change the connective AND flip each part.
  • If a question asks which statement is logically equivalent to a given conditional, the answer is its contrapositive.

Key Points

  • From any conditional p → q, three related forms can be derived: converse, inverse, and contrapositive.
  • CONVERSE: q → p — swap the hypothesis and conclusion.
  • INVERSE: ¬p → ¬q — negate both the hypothesis and conclusion.
  • CONTRAPOSITIVE: ¬q → ¬p — swap AND negate both parts.
  • The CONTRAPOSITIVE is LOGICALLY EQUIVALENT to the original conditional — they always have the same truth value.
  • The CONVERSE and INVERSE are logically equivalent to EACH OTHER but NOT to the original conditional.
  • Two statements are logically equivalent (≡) if they have identical truth values in every possible scenario.
  • A TAUTOLOGY is a compound statement that is ALWAYS TRUE regardless of the truth values of its components.
  • A CONTRADICTION is a compound statement that is ALWAYS FALSE regardless of the truth values of its components.

Definitions

Term

Converse

Definition

Formed by swapping the hypothesis and conclusion of a conditional: q → p.

Importance

The converse is NOT logically equivalent to the original. Confusing them is a common logical fallacy called 'affirming the consequent.'

Term

Inverse

Definition

Formed by negating both hypothesis and conclusion: ¬p → ¬q.

Importance

The inverse is NOT equivalent to the original but IS equivalent to the converse.

Term

Contrapositive

Definition

Formed by swapping AND negating both parts: ¬q → ¬p.

Importance

ALWAYS logically equivalent to the original. The most important variation for the LET.

Term

Tautology

Definition

A compound statement that is always TRUE no matter what truth values its variables take.

Importance

Identifies statements that are universally valid — important in logical reasoning and proof.

Term

De Morgan's Laws

Definition

Rules for negating compound statements: ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q.

Importance

Heavily tested. Remember: negating 'and' gives 'or'; negating 'or' gives 'and'.

Section Title

Variations of the Conditional and Logical Equivalence

Common Mistakes

  • Treating the converse as logically equivalent to the original — it is NOT. Only the contrapositive is equivalent.
  • Confusing 'inverse' and 'contrapositive' — the inverse negates both parts WITHOUT swapping; the contrapositive does BOTH.
  • Applying De Morgan's Law incorrectly by only negating one part of the compound statement.
  • Forgetting that the converse and inverse are equivalent to EACH OTHER (not to the original).

Formulas

Example

If a teacher is registered (p), then they are licensed (q). Teacher Cruz is registered (p). Therefore, Teacher Cruz is licensed (q). VALID by modus ponens.

Formula

Modus Ponens: [(p → q) ∧ p] → q

Variables

p = hypothesis, q = conclusion

Application

If you know the conditional is true and the hypothesis is true, you can conclude the conclusion is true.

Example

If a number is divisible by 4 (p), then it is divisible by 2 (q). The number 15 is NOT divisible by 2 (¬q). Therefore, 15 is NOT divisible by 4 (¬p). VALID by modus tollens.

Formula

Modus Tollens: [(p → q) ∧ ¬q] → ¬p

Variables

p = hypothesis, q = conclusion, ¬ = negation

Application

If the conclusion is false, you can work backward to conclude the hypothesis is also false.

Exam Tips

  • On LET multiple-choice, identify the argument form first: is premise 2 affirming p (modus ponens) or denying q (modus tollens)? Both are valid.
  • If premise 2 affirms q or denies p, the argument is a FALLACY — mark it as invalid.
  • For inductive/deductive questions: if the question gives specific examples and draws a general rule, it is INDUCTIVE. If it applies a general rule to a specific case, it is DEDUCTIVE.
  • Remember: in K–12 BEC, the inquiry-based approach starts inductively (pupils observe → discover pattern) then moves deductively (teacher formalizes the rule).

Key Points

  • An argument is VALID if, whenever all the premises are true, the conclusion must also be true.
  • MODUS PONENS (affirming the antecedent): Premise 1: p → q. Premise 2: p. Conclusion: Therefore, q. VALID.
  • MODUS TOLLENS (denying the consequent): Premise 1: p → q. Premise 2: ¬q. Conclusion: Therefore, ¬p. VALID.
  • FALLACY — Affirming the Consequent: Premise 1: p → q. Premise 2: q. Conclusion: p. INVALID.
  • FALLACY — Denying the Antecedent: Premise 1: p → q. Premise 2: ¬p. Conclusion: ¬q. INVALID.
  • INDUCTIVE REASONING: moves from specific observations to a general conclusion (probable, not certain). One counterexample disproves it.
  • DEDUCTIVE REASONING: moves from general premises to a specific, certain conclusion. If premises are true and logic is valid, the conclusion MUST be true.
  • Teachers use INDUCTIVE reasoning to let pupils discover patterns; DEDUCTIVE reasoning to formally prove rules.

Definitions

Term

Modus Ponens

Definition

A valid argument form: given p → q and p is true, conclude q is true. Also called 'affirming the antecedent.'

Importance

One of the two main valid argument forms tested on the LET.

Term

Modus Tollens

Definition

A valid argument form: given p → q and q is false, conclude p is false. Also called 'denying the consequent.'

Importance

The second main valid argument form. Notice it uses the logic of the contrapositive.

Term

Inductive Reasoning

Definition

Reasoning that moves from specific cases to a general conclusion. Conclusions are probable but not guaranteed.

Importance

Used in discovery-based learning (INQUIRY approach in K–12). A single counterexample destroys an inductive conclusion.

Term

Deductive Reasoning

Definition

Reasoning that moves from general premises to a specific, certain conclusion. If premises are true and logic is valid, the conclusion is certain.

Importance

Used to prove mathematical theorems. Results are necessary, not merely probable.

Term

Counterexample

Definition

A specific case that shows a general statement is FALSE.

Importance

One counterexample is sufficient to disprove any universal inductive claim.

Section Title

Valid Arguments: Modus Ponens and Modus Tollens

Common Mistakes

  • Treating 'affirming the consequent' as valid — knowing q is true does NOT prove p is true.
  • Treating 'denying the antecedent' as valid — knowing p is false does NOT prove q is false.
  • Confusing inductive and deductive reasoning — inductive gives probable conclusions; deductive gives certain ones.
  • Thinking a valid argument guarantees true conclusions — validity is about logical FORM; truth of premises is a separate issue.

Formulas

Example

Sequence: 3, 7, 11, 15, ... Find the 10th term. a₁ = 3, d = 4. a₁₀ = 3 + (10−1)(4) = 3 + 36 = 39.

Formula

aₙ = a₁ + (n − 1)d

Variables

aₙ = nth term, a₁ = first term, n = term number, d = common difference

Application

Use this to find any specific term in an arithmetic sequence, or to find which term number a given value is.

Example

Sum of first 10 terms of 3, 7, 11, 15, ...: a₁₀ = 39, so S₁₀ = (10/2)(3 + 39) = 5 × 42 = 210.

Formula

Sₙ = (n/2)(a₁ + aₙ)

Variables

Sₙ = sum of n terms, n = number of terms, a₁ = first term, aₙ = last term

Application

Use to find the total of a finite arithmetic series (the sum of all terms from first to nth).

Example

Sequence: 2, 6, 18, 54, ... Find the 6th term. a₁ = 2, r = 3. a₆ = 2 × 3⁵ = 2 × 243 = 486.

Formula

aₙ = a₁ × r^(n−1)

Variables

aₙ = nth term, a₁ = first term, r = common ratio, n = term number

Application

Use to find any specific term in a geometric sequence. Be careful with exponent calculations.

Example

Find the 8th Fibonacci number: 1, 1, 2, 3, 5, 8, 13, 21. The 8th term is 21.

Formula

Fibonacci: Fₙ = Fₙ₋₁ + Fₙ₋₂ with F₁ = 1, F₂ = 1

Variables

Fₙ = nth Fibonacci number, Fₙ₋₁ = previous term, Fₙ₋₂ = term before that

Application

List Fibonacci terms sequentially by adding the two preceding terms. Used in pattern identification questions.

Example

5th triangular number: T₅ = 5(6)/2 = 15. Sequence: 1, 3, 6, 10, 15 — confirmed.

Formula

Triangular Number: Tₙ = n(n+1)/2

Variables

Tₙ = nth triangular number, n = position in the sequence

Application

Use to verify or find triangular numbers in pattern questions.

Exam Tips

  • IDENTIFY FIRST: subtract consecutive terms — if the differences are constant, it is arithmetic; divide consecutive terms — if ratios are constant, it is geometric; if each term equals the sum of the two before it, it is Fibonacci.
  • For 'which term equals a given value' problems: set the nth-term formula equal to that value and solve for n algebraically.
  • For sum problems: use Sₙ = (n/2)(a₁ + aₙ). Always find aₙ first using the nth-term formula before summing.
  • Know the first 10 Fibonacci numbers by heart: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55.
  • Golden ratio quick fact for MCQ: consecutive Fibonacci ratio → 55/34 ≈ 1.618.

Key Points

  • A SEQUENCE is an ordered list of numbers (terms) that follow a specific rule.
  • ARITHMETIC SEQUENCE: a constant value called the COMMON DIFFERENCE (d) is added to each term to get the next term.
  • To find d in an arithmetic sequence: d = aₙ₊₁ − aₙ (subtract any term from the next term).
  • GEOMETRIC SEQUENCE: a constant value called the COMMON RATIO (r) is multiplied to each term to get the next term.
  • To find r in a geometric sequence: r = aₙ₊₁ / aₙ (divide any term by the previous term).
  • FIBONACCI SEQUENCE: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... Each term is the sum of the TWO preceding terms.
  • The ratio of consecutive Fibonacci numbers approaches the GOLDEN RATIO φ ≈ 1.618 (phi).
  • The Fibonacci sequence and golden ratio appear in nature: flower petals, pineapple spirals, nautilus shells, and sunflower seeds.
  • SQUARE NUMBERS: 1, 4, 9, 16, 25, 36, ... (nth term = n²)
  • TRIANGULAR NUMBERS: 1, 3, 6, 10, 15, 21, ... (nth term = n(n+1)/2)
  • To find a specific term, FIRST identify whether the sequence is arithmetic, geometric, or Fibonacci, THEN apply the correct formula.

Definitions

Term

Arithmetic Sequence

Definition

A sequence where a constant number (common difference d) is added to each term to produce the next term.

Importance

Most common sequence type on the LET. Practice finding d, the nth term, and the sum of terms.

Term

Geometric Sequence

Definition

A sequence where each term is multiplied by a constant (common ratio r) to produce the next term.

Importance

Appears in compound interest problems. Recognizing the ratio is key to applying the formula correctly.

Term

Fibonacci Sequence

Definition

The sequence 1, 1, 2, 3, 5, 8, 13, 21, ... where each term is the sum of the two preceding terms.

Importance

A staple of modern mathematics GE content. Also appears in nature and is linked to the golden ratio.

Term

Golden Ratio (φ)

Definition

The irrational number approximately equal to 1.618, approached by the ratio of consecutive Fibonacci numbers as n increases.

Importance

Tested as a conceptual fact. Know the value (≈1.618) and its connection to Fibonacci numbers and natural patterns.

Term

Common Difference (d)

Definition

The constant value added to each term in an arithmetic sequence (d = aₙ₊₁ − aₙ).

Importance

First step in solving any arithmetic sequence problem — always find d before applying the formula.

Term

Common Ratio (r)

Definition

The constant multiplier in a geometric sequence (r = aₙ₊₁ / aₙ).

Importance

First step in solving any geometric sequence problem — always find r before applying the formula.

Section Title

Patterns, Sequences, and the Fibonacci Sequence

Common Mistakes

  • Using the geometric formula for an arithmetic sequence (and vice versa) — ALWAYS check: is it adding or multiplying?
  • Making an off-by-one error in the formula aₙ = a₁ + (n−1)d — the exponent/multiplier is (n−1), NOT n.
  • Confusing the sum formula Sₙ with the nth-term formula — Sₙ adds up ALL terms; aₙ finds ONE specific term.
  • In geometric sequences, calculating r^n instead of r^(n−1) in the nth-term formula.
  • Misidentifying a Fibonacci-type sequence as arithmetic or geometric — always check if consecutive differences and ratios are constant.

Formulas

Example

In a class of 40, 25 like math, 20 like science, and 10 like both. How many like at least one? n(M ∪ S) = 25 + 20 − 10 = 35. How many like neither? 40 − 35 = 5.

Formula

n(A ∪ B) = n(A) + n(B) − n(A ∩ B)

Variables

n(A ∪ B) = number of elements in union, n(A) = elements in A, n(B) = elements in B, n(A ∩ B) = elements in both

Application

Use for any counting problem involving two overlapping groups. The overlap is subtracted once to avoid counting it twice.

Exam Tips

  • Draw a Venn diagram for every set-counting problem — fill in the INTERSECTION first, then subtract to find the 'only A' and 'only B' regions.
  • Remember: the total in the Venn diagram (all regions including outside) = Universal set size.
  • Connect sets to logic for efficiency: if a question about sets uses 'and,' think intersection; 'or,' think union; 'not,' think complement.
  • For three-set problems, use: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(A ∩ C) − n(B ∩ C) + n(A ∩ B ∩ C).

Key Points

  • A SET is a well-defined collection of distinct objects called ELEMENTS.
  • UNION (A ∪ B): All elements in A OR B (or both). Corresponds to logical disjunction (∨).
  • INTERSECTION (A ∩ B): Only elements in BOTH A AND B. Corresponds to logical conjunction (∧).
  • COMPLEMENT (A'): All elements NOT in A (from the universal set). Corresponds to logical negation (¬).
  • SUBSET: A ⊆ B means every element of A is also in B.
  • EMPTY SET (∅): A set with no elements. It is a subset of every set.
  • INCLUSION-EXCLUSION PRINCIPLE: n(A ∪ B) = n(A) + n(B) − n(A ∩ B). Subtract the overlap to avoid double-counting.
  • Venn diagrams visually show relationships between sets and are used to solve counting problems.
  • IMPORTANT PARALLEL: Set Union ↔ Logical OR; Set Intersection ↔ Logical AND; Set Complement ↔ Logical NOT.

Definitions

Term

Union (A ∪ B)

Definition

The set of all elements that belong to A OR B (or both). Think of combining both sets.

Importance

Corresponds to the logical OR operator. Critical for Venn diagram counting problems.

Term

Intersection (A ∩ B)

Definition

The set of all elements that belong to BOTH A AND B. The overlap region in a Venn diagram.

Importance

Corresponds to the logical AND operator. The 'both' value in inclusion-exclusion problems.

Term

Complement (A')

Definition

The set of all elements in the universal set that are NOT in A.

Importance

Corresponds to logical negation. Used to find 'neither' counts in Venn diagram problems.

Term

Inclusion-Exclusion Principle

Definition

The rule n(A ∪ B) = n(A) + n(B) − n(A ∩ B), which prevents double-counting elements in the intersection.

Importance

The most tested Venn diagram formula on the LET. Always subtract the overlap once.

Section Title

Sets and Venn Diagrams

Common Mistakes

  • Forgetting to subtract the intersection in the inclusion-exclusion formula, causing double-counting.
  • Confusing union (∪) and intersection (∩) — union is BIGGER (more elements); intersection is SMALLER (only shared elements).
  • Placing elements that belong to ONLY A inside the intersection region of the Venn diagram.
  • Forgetting to account for 'neither' category — subtract the union total from the universal set total.

Formulas

Example

A cooperative lends ₱5,000 at 8% per year for 2 years. I = 5,000 × 0.08 × 2 = ₱800. Total repayment = ₱5,000 + ₱800 = ₱5,800.

Formula

I = P × R × T

Variables

I = interest earned, P = principal (original amount), R = annual interest rate (as a decimal), T = time in years

Application

Use for simple interest calculations on loans (e.g., cooperative loans for teachers) or savings. Total amount = P + I.

Example

₱10,000 at 5% compounded annually for 2 years: A = 10,000 × (1.05)² = 10,000 × 1.1025 = ₱11,025. Interest earned = ₱1,025. (Compare: simple interest = ₱1,000; compound is ₱25 more.)

Formula

A = P(1 + r)ⁿ

Variables

A = total amount after compounding, P = principal, r = annual interest rate (as a decimal), n = number of compounding periods

Application

Use for compound interest. The final amount A includes both principal and all accumulated interest.

Exam Tips

  • For comparison questions: simple interest total = P + PRT = P(1 + RT); compound interest total = P(1 + r)ⁿ. Compound always yields MORE for the same rate and time (beyond 1 period).
  • Rate conversion: always convert percent to decimal before substituting into any formula (8% → 0.08; 5% → 0.05).
  • For check-digit conceptual questions: know that a mismatch in the checksum means an error was detected — you do not need to compute ISBNs from scratch.
  • Data interpretation questions (reading bar graphs, pie charts, tables) test whether you can extract and compute from presented information — practice quickly reading graph labels and scales.

Key Points

  • SIMPLE INTEREST: Interest is calculated only on the original principal. The amount grows LINEARLY.
  • COMPOUND INTEREST: Interest is calculated on the principal AND on accumulated interest. The amount grows EXPONENTIALLY (faster than simple interest).
  • In compound interest, the key phrase is 'interest earns interest' — this is why it grows faster over time.
  • MODULAR ARITHMETIC: Working with remainders after division. The notation a ≡ b (mod n) means a and b have the same remainder when divided by n.
  • CHECK DIGITS on barcodes, ISBNs, and bank cards use modular arithmetic to detect single-digit errors. A wrong digit produces a checksum mismatch.
  • STATISTICS and DATA: Mean, median, mode, and range describe data sets. Graphs (bar, line, pie) translate data into visual information for decision-making.
  • Mathematics is a PRACTICAL LITERACY for daily life: budgeting a salary, reading a utility bill, understanding loan terms, and interpreting health data all require mathematical reasoning.
  • As elementary teachers, financial literacy topics link to real-life applications in the K–12 curriculum (e.g., Grade 5–6 Math competencies on money and percentage).

Definitions

Term

Simple Interest

Definition

Interest computed only on the original principal (P), calculated as I = PRT. The amount grows at a constant (linear) rate.

Importance

Baseline interest concept on the LET. Used in short-term loans and basic savings problems.

Term

Compound Interest

Definition

Interest computed on the principal AND on previously earned interest. Amount grows exponentially: A = P(1 + r)ⁿ.

Importance

Reflects real-world bank accounts and loans. The comparison between simple and compound interest is a classic LET question type.

Term

Modular Arithmetic

Definition

A system of arithmetic for integers where numbers wrap around after reaching a fixed value (the modulus). Works with remainders.

Importance

Underlies check-digit systems (ISBN, barcodes, credit cards) that are tested as modern applications of mathematics.

Term

Check Digit

Definition

A computed digit appended to a numerical code (barcode, ISBN) that allows detection of single-digit entry errors using modular arithmetic.

Importance

Illustrates how mathematics is quietly embedded in everyday transactions — a favorite application topic in the modern-world course.

Section Title

Mathematics in Finance, Codes, and Data

Common Mistakes

  • Using the rate R as a percentage instead of converting to a decimal — 8% must become 0.08 in formulas.
  • Confusing the simple interest I (interest only) with the total amount A = P + I.
  • Using T = months instead of converting to years in the simple interest formula — always express time in YEARS unless told otherwise.
  • In compound interest, computing A = P × r × n instead of A = P(1 + r)ⁿ — the base is (1 + r), not r alone.

Connections

  • LOGIC ↔ SETS: Logical connectives have direct set equivalents — AND = intersection (∩), OR = union (∪), NOT = complement ('). This parallel means skills in one area reinforce the other.
  • CONDITIONAL ↔ CONTRAPOSITIVE: The contrapositive is logically equivalent to the original conditional because it uses the same truth-value logic as the conditional itself — understanding one deepens understanding of the other.
  • FIBONACCI ↔ GOLDEN RATIO: The Fibonacci sequence is the numerical pathway to the golden ratio. As consecutive terms grow, their ratio converges to φ ≈ 1.618 — connecting number patterns to art, architecture, and nature.
  • ARITHMETIC SEQUENCES ↔ SIMPLE INTEREST: Simple interest grows by a fixed amount (PRT) each year — this is exactly the behavior of an arithmetic sequence where the common difference d = PR (annual interest amount).
  • GEOMETRIC SEQUENCES ↔ COMPOUND INTEREST: Compound interest multiplies the total by (1 + r) each period — this is exactly a geometric sequence with first term P and common ratio r = (1 + r). The growth formula A = P(1 + r)ⁿ is the nth-term formula for a geometric sequence.
  • DE MORGAN'S LAWS ↔ SET COMPLEMENT: De Morgan's Laws in logic (¬(p ∧ q) ≡ ¬p ∨ ¬q) mirror the set complement rules: (A ∩ B)' = A' ∪ B' and (A ∪ B)' = A' ∩ B'. The same logic governs both systems.
  • INDUCTIVE REASONING ↔ K–12 INQUIRY-BASED LEARNING: DepEd's K–12 BEC emphasizes discovery learning (pupils observe → identify patterns → form generalizations), which is the exact structure of inductive reasoning. Deductive proof then formalizes the discovered rule.
  • MODULAR ARITHMETIC ↔ CHECK DIGITS ↔ DATA INTEGRITY: Modular arithmetic is the mathematical foundation of error detection in barcodes and digital transactions — showing pupils (and teachers) that mathematics protects real-world data every day.
  • VENN DIAGRAMS ↔ INCLUSION-EXCLUSION ↔ PROBABILITY: The inclusion-exclusion principle n(A ∪ B) = n(A) + n(B) − n(A ∩ B) is identical in structure to the probability addition rule P(A ∪ B) = P(A) + P(B) − P(A ∩ B). Mastering one prepares you for the other.
  • LOGIC VALIDITY ↔ PROFESSIONAL TEACHING PRACTICE: Just as modus ponens requires a valid logical form, RA 7836 requires teachers to use sound reasoning and professional judgment in instructional decisions. Logical reasoning is both an academic skill and a professional competency for licensed teachers.

Exam Strategy

For the LET, approach this chapter in three layers. LAYER 1 — LOGIC: Truth tables and connectives are pure memorization with application. Burn the conditional truth table into memory (especially the one false row: T→F = F). For every conditional question, identify p and q, assign their truth values, and apply the rule. For De Morgan's, just flip the connective and negate each part. LAYER 2 — SEQUENCES: Always identify the type FIRST (arithmetic, geometric, Fibonacci, or special). Never apply the geometric formula to an arithmetic sequence. Practice the formula aₙ = a₁ + (n−1)d and aₙ = a₁ × r^(n−1) until you can use them automatically. For sum questions, always find the last term first, then use the sum formula. LAYER 3 — APPLICATIONS: Finance problems are calculation-heavy but formula-driven. Convert rates to decimals, keep time in years, and remember compound interest ALWAYS yields more than simple interest for the same rate and time beyond one period. For Venn diagram counting, draw the diagram and fill in the intersection FIRST. For all word problems, underline key mathematical words (and → ∩, or → ∪, both → intersection value, neither → outside both circles). Time management: logic truth-value questions are fast (30 seconds each); sequence nth-term questions take 1–2 minutes; finance application problems take 2–3 minutes. Prioritize accuracy on logic items (high frequency, quick points) before moving to longer computation items.

Quick Review Questions

Which of the following is a logical statement (proposition)? A) Study for the LET! B) Is Manila the capital? C) Cebu is an island in the Philippines. D) Please open your books.

A statement must be a declarative sentence with a definite truth value (TRUE or FALSE). Options A and D are commands; Option B is a question. Only Option C is declarative and can be evaluated as TRUE.

Let p = TRUE and q = FALSE. What is the truth value of p → q?

A conditional p → q is FALSE only when p is TRUE and q is FALSE. Since p = TRUE and q = FALSE, this is exactly that case. This is the ONE critical row to memorize: TRUE hypothesis + FALSE conclusion = FALSE conditional.

What is the contrapositive of 'If a pupil studies hard, then the pupil passes the exam'?

The contrapositive is formed by swapping AND negating both parts of the conditional. Original: p → q (p = studies hard; q = passes). Contrapositive: ¬q → ¬p (not passes → not studies hard). The contrapositive is logically equivalent to the original.

Negate the statement: 'The playground is safe and the equipment is in good condition.'

By De Morgan's Law: ¬(p ∧ q) ≡ ¬p ∨ ¬q. When you negate a conjunction ('and'), the result is a disjunction ('or') with each part negated. The connective changes from AND to OR.

Find the 12th term of the arithmetic sequence: 5, 9, 13, 17, ...

Identify: a₁ = 5, d = 9 − 5 = 4. Apply the formula: a₁₂ = a₁ + (n − 1)d = 5 + (12 − 1)(4) = 5 + 44 = 49.

Find the 5th term of the geometric sequence: 3, 6, 12, 24, ...

Identify: a₁ = 3, r = 6 ÷ 3 = 2. Apply the formula: a₅ = 3 × 2^(5−1) = 3 × 2⁴ = 3 × 16 = 48.

What is the 9th term of the Fibonacci sequence?

List the Fibonacci sequence: F₁=1, F₂=1, F₃=2, F₄=3, F₅=5, F₆=8, F₇=13, F₈=21, F₉=34. Each term is the sum of the two preceding terms: F₉ = F₈ + F₇ = 21 + 13 = 34.

A teacher deposits ₱8,000 in a bank at 6% simple interest per year. How much will be in the account after 3 years?

Use I = PRT: I = 8,000 × 0.06 × 3 = ₱1,440. Total amount = P + I = 8,000 + 1,440 = ₱9,440.

In a Grade 4 class of 35 pupils, 20 play basketball, 18 play volleyball, and 8 play both. How many pupils play neither sport?

Use inclusion-exclusion: n(B ∪ V) = n(B) + n(V) − n(B ∩ V) = 20 + 18 − 8 = 30. Pupils who play neither = Total − n(B ∪ V) = 35 − 30 = 5.

Which argument form is valid? A) p → q; q is true; therefore p is true. B) p → q; p is true; therefore q is true. C) p → q; ¬p is true; therefore ¬q is true. D) p → q; q is false; therefore p is true.

Option B is Modus Ponens (affirming the antecedent) — a valid argument form. Option A is 'affirming the consequent' (fallacy). Option C is 'denying the antecedent' (fallacy). Option D is invalid because a false q should lead to ¬p (not p) by modus tollens.

Which type of reasoning is used when a pupil observes that 2+4=6, 4+6=10, 6+8=14, and concludes 'the sum of any two even numbers is even'?

The pupil is moving from specific examples (observed cases) to a general conclusion ('all sums of two even numbers are even'). This is inductive reasoning — it produces a probable conclusion that could be disproved by a counterexample, although in this case the conclusion happens to be true.

If A = {2, 4, 6, 8, 10} and B = {6, 8, 10, 12, 14}, find A ∩ B.

The intersection A ∩ B contains only elements found in BOTH sets. Checking each element: 6 is in both, 8 is in both, 10 is in both. Elements 2 and 4 are only in A; 12 and 14 are only in B. Therefore, A ∩ B = {6, 8, 10}.

Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…

Ready to practise for the LET Secondary 2026?

Super Tutor's AI review plan adapts to your weak areas and builds a weekly practice schedule around your target LET Secondary exam date.