Skip to main content
Super Tutor
Detailed ExplanationLET Secondary · MathematicsReal content

LET Secondary Mathematics — Logic and Mathematics in the Modern WorldDetailed Explanation

SummaryConceptsNotesRevisionDeep DiveSlidesFlashcardsMistakesCheatMnemonicsTemplates

The Logic and Mathematics in the Modern World chapter rewards slow, careful thinking over quick pattern matching, especially on Professional Regulation Commission (PRC)'s scenario-based LET Secondary items. This detailed explanation walks through the full derivation of every core idea, then links each one to a worked example pulled from recent LET Secondary Mathematics papers.

Exam context

The Licensure Examination for Professional Teachers — Secondary is conducted by Professional Regulation Commission (PRC) and is scheduled for Bi-annual. The Mathematics subtest is marked as "Core" in the official pattern, and Logic and Mathematics in the Modern World appears in position 7th of 7 in the LET Secondary Mathematics review rotation. Passing mark: Weighted average of 75% with no grade below 50%. Recent LET Secondary 2026 papers have drawn roughly a meaningful share of questions from this subject.

Logic and Mathematics in the Modern World - Detailed Explanation

Mathematics is more than numbers and computation — it is a language for precise reasoning and a powerful lens for understanding the world around us. The LET (Elementary Level) tests this broader view through two intertwined areas: elementary logic, which governs how we build and evaluate arguments, and applied mathematics, which shows how patterns, sequences, finance, and data shape everyday life. As future elementary teachers, you will use logical thinking every time you write a lesson objective, sequence a learning activity, or evaluate a pupil's reasoning. Understanding these concepts will help you not only pass the Board Examination but also model clear, structured thinking in your classroom — a habit aligned with the K-12 BEC emphasis on critical thinking and problem solving. This chapter covers logical statements and connectives, truth tables, conditional statements and their variations, valid arguments, inductive vs. deductive reasoning, sequences (arithmetic, geometric, Fibonacci), and real-world applications in finance, sets, and modular arithmetic.

Concepts

Statements and Truth Values

A statement (also called a proposition) is a declarative sentence that can be assigned exactly one truth value — either TRUE (T) or FALSE (F), but never both at the same time. This is the foundation of all logic. Not every sentence is a statement: commands ('Close the door.'), questions ('What is your name?'), and exclamations ('Wow!') are NOT statements because they cannot be evaluated as true or false. Simple statements contain a single idea. For example, 'Manila is the capital of the Philippines' is a simple statement with truth value TRUE. 'DepEd implements the K-12 curriculum' is also TRUE. 'All Grade 1 pupils can read fluently' could be TRUE or FALSE depending on the class, but it IS a statement because it has a definite truth value in any given situation. Compound statements are formed by joining simple statements using logical connectives. For example: 'Manila is the capital and Cebu is an island' joins two simple statements with 'and.' In the LET, you must quickly identify whether a given sentence is a statement and determine its truth value. Practice looking for the subject-verb-object structure — if it makes a claim about reality, it is likely a statement.

Examples

Only declarative sentences that can be evaluated as true or false qualify as statements. The truth value can be FALSE — what matters is that it HAS a definite truth value.

Scenario

Classify each sentence: (a) 'RA 7836 governs teacher licensure in the Philippines.' (b) 'Please read Chapter 3.' (c) 'Is mathematics useful?' (d) 'The sun rises in the west.'

Solution

(a) Statement — TRUE. (b) Not a statement — it is a command. (c) Not a statement — it is a question. (d) Statement — FALSE.

The sentence is declarative and can be verified. By definition, all quadrilaterals have four sides, so the statement is universally true. This is the kind of statement used in deductive proofs.

Scenario

A teacher tells her Grade 5 class: 'Every quadrilateral has four sides.' Is this a statement? What is its truth value?

Solution

Yes, it is a statement. Its truth value is TRUE.

Applications

  • Writing clear, testable learning objectives (each objective should be a statement that is verifiable — a pedagogical parallel to logical propositions).
  • Evaluating whether pupil responses in class discussions are factual claims or mere opinions.
  • Constructing valid test items — each test question stem that calls for a T/F or multiple-choice answer rests on the concept of a statement.
  • Understanding DepEd's evidence-based policies: policy documents make truth-apt claims (statements) about educational outcomes.

Misconceptions

  • A false sentence is still a statement. 'The Earth is flat' is a statement (FALSE). Many students think only true sentences are statements.
  • Opinions like 'Mathematics is hard' are not formal statements in logic because their truth value depends on personal perspective — they are not objectively verifiable.
  • A statement does not have to be a mathematical fact; it can be about any subject, as long as it is declarative and has a definite truth value.

Related Concepts

  • Logical connectives
  • Truth tables
  • Compound statements
  • Tautology and contradiction

Common Exam Questions

Example

Which of the following is NOT a statement? (a) The moon is made of cheese. (b) Open your books. (c) Fractions are rational numbers. (d) Manila is a city. Answer: (b) — it is a command.

Approach

Read each sentence. Ask: Is it declarative? Can it be true or false? If yes, identify its truth value.

Question Type

Identification

Example

'The sum of the interior angles of a triangle is 180 degrees.' Truth value: TRUE.

Approach

Know basic mathematical and Philippine educational facts. State whether the declarative sentence is T or F.

Question Type

Truth Value Determination

Key Points To Remember

  • A statement (proposition) is a declarative sentence — TRUE or FALSE, never both.
  • Commands, questions, and exclamations are NOT statements.
  • Every statement has exactly one truth value: T or F.
  • Simple statements contain one idea; compound statements join simple statements with connectives.
  • In the LET, always check: 'Can this sentence be true or false?' If yes, it is a statement.

Logical Connectives and Truth Tables

Logical connectives are the building blocks of compound statements. There are five main connectives tested in the LET, each with its own symbol and truth-value rule. 1. NEGATION (¬p or ~p, read 'not p'): Reverses the truth value. If p is TRUE, ¬p is FALSE. If p is FALSE, ¬p is TRUE. 2. CONJUNCTION (p ∧ q, read 'p and q'): TRUE only when BOTH p and q are TRUE. Think of it as a strict 'and' — both must pass. 3. DISJUNCTION (p ∨ q, read 'p or q'): TRUE when AT LEAST ONE of p or q is TRUE. It is FALSE only when BOTH are false. 4. CONDITIONAL (p → q, read 'if p then q'): FALSE ONLY when p is TRUE and q is FALSE. The hypothesis being true but the conclusion being false is the single failure case. All other combinations are TRUE. 5. BICONDITIONAL (p ↔ q, read 'p if and only if q'): TRUE when p and q have the SAME truth value (both TRUE or both FALSE). TRUTH TABLE (Complete — all four rows): | p | q | ¬p | p∧q | p∨q | p→q | p↔q | |---|---|----|----|-----|-----|-----| | T | T | F | T | T | T | T | | T | F | F | F | T | F | F | | F | T | T | F | T | T | F | | F | F | T | F | F | T | T | The MOST TESTED ROW: Row 2 (p=T, q=F) — this is where the conditional (p→q) is FALSE. Students frequently get this wrong by thinking 'if true, then false' means something is wrong with the 'if' part. Remember: a conditional statement is like a PROMISE. You break a promise ONLY when you make a commitment (p=T) and fail to deliver (q=F). If you never made the commitment (p=F), you cannot be accused of breaking it.

Examples

Work through each connective using the truth values. For (d), first negate p (¬T = F), then apply disjunction (F ∨ F = F). This step-by-step approach prevents errors in complex expressions.

Scenario

Let p = 'It is raining' (TRUE) and q = 'The streets are flooded' (FALSE). Evaluate: (a) p ∧ q, (b) p ∨ q, (c) p → q, (d) ¬p ∨ q.

Solution

(a) T ∧ F = FALSE. (b) T ∨ F = TRUE. (c) T → F = FALSE. (d) ¬T ∨ F = F ∨ F = FALSE.

Always resolve negations first, then conjunctions, then disjunctions — following the order of logical operations. The final answer is TRUE.

Scenario

Given p is FALSE and q is TRUE, find the truth value of (p ∧ ¬q) ∨ ¬p.

Solution

Step 1: ¬q = ¬T = F. Step 2: p ∧ ¬q = F ∧ F = F. Step 3: ¬p = ¬F = T. Step 4: F ∨ T = TRUE.

This real-classroom example shows that the conditional is violated (FALSE) precisely when the hypothesis is met but the conclusion does not follow. This is the 'broken promise' scenario.

Scenario

A teacher's classroom rule: 'If a pupil finishes the activity early, then the pupil may read a library book.' A pupil finishes early but the teacher does NOT allow library reading. Is the conditional TRUE or FALSE?

Solution

p (finishes early) = TRUE. q (may read) = FALSE. Since p → q with p=T and q=F, the conditional is FALSE. The teacher broke the rule.

Applications

  • Evaluating the logical structure of classroom rules and DepEd policy statements (many are written as conditional statements).
  • Understanding conditions in RA 7836: 'If an applicant passes the LET, then the PRC shall issue a license' — a conditional statement.
  • Designing rubrics: 'If the pupil meets all criteria, then the score is Excellent' — a conditional used in assessment.
  • Error detection in data and codes uses disjunction and conjunction logic.

Misconceptions

  • Students often think 'p → q' is false when p is false. Wrong! A conditional with a false hypothesis is ALWAYS TRUE (vacuously true).
  • Confusing 'or' (inclusive or — at least one is true) with everyday 'or' (exclusive or — exactly one is true). In logic, 'or' is inclusive unless stated otherwise.
  • Thinking that a compound statement needs all parts to be true. Only conjunction requires this; disjunction needs just one.
  • Forgetting to negate BOTH parts when applying De Morgan's Laws.

Related Concepts

  • Conditional statement variations
  • De Morgan's Laws
  • Tautology and contradiction
  • Valid arguments (modus ponens, modus tollens)

Common Exam Questions

Example

If p is TRUE and q is FALSE, what is the truth value of ¬(p ∧ q)? Solution: p ∧ q = T ∧ F = F; ¬F = TRUE.

Approach

Assign truth values to simple statements, then evaluate connectives one at a time from innermost to outermost. Use the truth table rules.

Question Type

Truth Value of Compound Statement

Example

Which combination of truth values makes 'If p then q' FALSE? Answer: p = TRUE, q = FALSE.

Approach

Remember: p → q is FALSE ONLY when p = T and q = F. Check all answer choices for this combination.

Question Type

Identifying the False Row of a Conditional

Key Points To Remember

  • Conjunction (∧) is TRUE only when BOTH parts are TRUE — strictest of all connectives.
  • Disjunction (∨) is FALSE only when BOTH parts are FALSE — most lenient.
  • Conditional (→) is FALSE only when hypothesis (p) is TRUE and conclusion (q) is FALSE — the 'broken promise' row.
  • Biconditional (↔) is TRUE when both parts match in truth value (T-T or F-F).
  • Negation flips the truth value — always.
  • In the LET, always evaluate compound statements column by column, innermost first.

Conditional Statements and Their Variations

The conditional statement 'If p, then q' (p → q) is one of the most important — and most tested — structures in logic. From any conditional, we can form three related statements: 1. CONVERSE: q → p (swap p and q). 'If q, then p.' 2. INVERSE: ¬p → ¬q (negate both p and q, keep same order). 'If not p, then not q.' 3. CONTRAPOSITIVE: ¬q → ¬p (swap AND negate both). 'If not q, then not p.' CRITICAL EQUIVALENCES: - The CONTRAPOSITIVE is ALWAYS logically equivalent to the original conditional. They have the same truth value in every situation. If you know p → q is true, the contrapositive ¬q → ¬p is also automatically true. - The CONVERSE and INVERSE are logically equivalent to EACH OTHER, but NOT to the original. MEMORY AID — 'CONIC' Device: - Conditional: p → q - cOnverse: q → p (swap Only) - iNverse: ¬p → ¬q (Negate only) - Contrapositive: ¬q → ¬p (Contrapositive = Complete change: swap AND negate) PRACTICAL EXAMPLE: Original: 'If a teacher is licensed, then the teacher has passed the LET.' (TRUE under RA 7836) Converse: 'If a teacher has passed the LET, then the teacher is licensed.' (TRUE — but this requires verification; converse is NOT automatically true) Inverse: 'If a teacher is NOT licensed, then the teacher has NOT passed the LET.' (TRUE here, but not always) Contrapositive: 'If a teacher has NOT passed the LET, then the teacher is NOT licensed.' (ALWAYS TRUE — equivalent to original) The key legal implication: we can logically infer the contrapositive from any true conditional, which is the basis of many legal and policy inferences in DepEd regulations.

Examples

The original is true (all Grade 6 pupils are in elementary school). The contrapositive must also be true. The converse and inverse are false in this case because many elementary pupils are not in Grade 6. This shows that truth does not transfer to the converse.

Scenario

Given: 'If a pupil is in Grade 6, then the pupil is in elementary school.' Write the converse, inverse, and contrapositive. State which are logically equivalent.

Solution

Let p = 'pupil is in Grade 6' and q = 'pupil is in elementary school.' Converse (q→p): 'If a pupil is in elementary school, then the pupil is in Grade 6.' (NOT necessarily true — could be Grade 1 to 5) Inverse (¬p→¬q): 'If a pupil is NOT in Grade 6, then the pupil is NOT in elementary school.' (NOT necessarily true) Contrapositive (¬q→¬p): 'If a pupil is NOT in elementary school, then the pupil is NOT in Grade 6.' (TRUE — equivalent to original)

This is a classic LET-type item. The contrapositive is true automatically. The converse fails because divisibility by 2 does not guarantee divisibility by 4. Always verify the converse separately.

Scenario

The statement 'If x is divisible by 4, then x is divisible by 2' is true. What is its contrapositive? Is the converse necessarily true?

Solution

Contrapositive: 'If x is NOT divisible by 2, then x is NOT divisible by 4.' (TRUE — equivalent to original.) Converse: 'If x is divisible by 2, then x is divisible by 4.' (FALSE — counterexample: x = 6 is divisible by 2 but NOT by 4.)

Applications

  • Understanding legal conditionals in RA 7836: 'If you violate professional ethics, then your license may be revoked' — the contrapositive follows logically.
  • Writing lesson plans: 'If pupils meet the performance standard, then they have mastered the competency' — a conditional used in assessment.
  • Critical reading of DepEd memoranda that often use conditional structures for policy implementation.
  • Teaching Grade 5 and 6 pupils basic if-then reasoning as part of the Mathematics curriculum under K-12 BEC.

Misconceptions

  • Many students think the converse is equivalent to the conditional. This is a FALLACY called 'affirming the consequent.'
  • Students often confuse the inverse (negate only) with the contrapositive (swap and negate). Remember: contrapositive does BOTH operations.
  • A conditional and its converse can BOTH be true (as in biconditionals), but they are not guaranteed to be.
  • Forgetting that the contrapositive must be formed by BOTH swapping AND negating — doing only one operation gives the converse or inverse, not the contrapositive.

Related Concepts

  • Biconditional statements
  • Logical equivalence
  • Modus ponens and modus tollens
  • De Morgan's Laws

Common Exam Questions

Example

Given 'If a shape is a square, then it is a rectangle,' state the contrapositive. Answer: 'If a shape is NOT a rectangle, then it is NOT a square.'

Approach

Identify p and q clearly. Apply the definitions: converse = swap; inverse = negate both; contrapositive = swap and negate both.

Question Type

Forming Conditional Variations

Example

Which statement is logically equivalent to 'If p then q'? Answer: 'If not q then not p' (the contrapositive).

Approach

Among the four forms (conditional, converse, inverse, contrapositive), identify which pair is logically equivalent. Answer: conditional ↔ contrapositive; converse ↔ inverse.

Question Type

Equivalence Identification

Key Points To Remember

  • Contrapositive (¬q → ¬p) is ALWAYS logically equivalent to the original (p → q).
  • Converse (q → p) and Inverse (¬p → ¬q) are equivalent to each other, NOT to the original.
  • To form the contrapositive: SWAP the two parts AND NEGATE both.
  • A conditional can be true while its converse is false — they are independent.
  • In LET, if asked for the statement equivalent to a conditional, always choose the contrapositive.

De Morgan's Laws, Tautologies, and Valid Arguments

DE MORGAN'S LAWS are two rules for negating compound statements: 1. ¬(p ∧ q) ≡ ¬p ∨ ¬q — The negation of an 'AND' becomes an 'OR' with each part negated. 2. ¬(p ∨ q) ≡ ¬p ∧ ¬q — The negation of an 'OR' becomes an 'AND' with each part negated. MEMORY TRICK: 'Break the bar and change the sign.' When you push the negation inside, flip ∧ to ∨ (or vice versa) and negate each part. PRACTICAL EXAMPLE: 'The classroom is NOT (clean and quiet)' ≡ 'The classroom is not clean OR it is not quiet.' 'It is NOT the case that (it rains or there is a typhoon)' ≡ 'It does not rain AND there is no typhoon.' TAUTOLOGY AND CONTRADICTION: - A TAUTOLOGY is a compound statement that is ALWAYS TRUE regardless of the truth values of its parts. Example: p ∨ ¬p ('It is raining or it is not raining') — always true. - A CONTRADICTION is a compound statement that is ALWAYS FALSE. Example: p ∧ ¬p ('It is raining and it is not raining') — always false. VALID ARGUMENTS: An argument is VALID if the conclusion follows necessarily from the premises. Two classic valid forms: 1. MODUS PONENS ('affirming the antecedent'): Premise 1: p → q Premise 2: p (the antecedent/hypothesis is affirmed) Conclusion: ∴ q Example: IF a teacher passes the LET (p), THEN the PRC issues a license (q). Teacher Maria passes the LET. Therefore, the PRC issues Maria a license. ✓ VALID 2. MODUS TOLLENS ('denying the consequent'): Premise 1: p → q Premise 2: ¬q (the consequent/conclusion is denied) Conclusion: ∴ ¬p Example: IF a pupil submits homework (p), THEN the pupil gets a stamp (q). Jose did NOT get a stamp. Therefore, Jose did NOT submit homework. ✓ VALID INVALID FALLACIES (look-alikes to avoid): - AFFIRMING THE CONSEQUENT (INVALID): p→q, q, ∴ p. 'The ground is wet, so it must have rained.' (Wrong — other causes are possible.) - DENYING THE ANTECEDENT (INVALID): p→q, ¬p, ∴ ¬q. 'If it rains, the ground is wet. It did not rain, so the ground is not wet.' (Wrong — sprinklers could have wet it.)

Examples

De Morgan's first law converts the negated conjunction into a disjunction of negations. In a classroom context, this means the condition fails if EITHER part fails — the lesson isn't engaging OR the pupils aren't attentive (or both).

Scenario

Apply De Morgan's Law: Write the negation of 'The lesson is engaging and the pupils are attentive.'

Solution

Original: p ∧ q (where p = 'lesson is engaging,' q = 'pupils are attentive'). Negation: ¬(p ∧ q) = ¬p ∨ ¬q. Answer: 'The lesson is NOT engaging OR the pupils are NOT attentive.'

RA 7610 (Special Protection of Children Against Abuse) is upheld when child protection protocols are followed. Denying the consequent (RA 7610 is not upheld) allows us to validly deny the antecedent (protocols not followed). This is a legally and logically sound inference.

Scenario

Determine if the argument is valid: Premise 1: 'If a school follows child protection protocols, then RA 7610 is upheld.' Premise 2: 'This school does NOT uphold RA 7610.' Conclusion: 'This school does NOT follow child protection protocols.'

Solution

Form: p → q, ¬q, ∴ ¬p. This is MODUS TOLLENS. The argument is VALID.

The antecedent is affirmed (all pupils passed), so we can validly conclude the consequent (teacher is commended). This is the most straightforward valid argument form.

Scenario

Is this argument valid? 'If all pupils pass the summative test, the teacher will be commended. All pupils passed. Therefore, the teacher was commended.'

Solution

Form: p → q, p, ∴ q. This is MODUS PONENS. The argument is VALID.

Applications

  • Writing the negation of school policies (De Morgan's Laws): 'Not (all pupils are present and all assignments are submitted)' = 'Some pupils are absent OR some assignments are not submitted.'
  • Evaluating the logical soundness of arguments in research papers, DepEd reports, and policy proposals.
  • Teaching Grade 5–6 pupils to identify whether reasoning is correct using simple if-then scenarios.
  • Understanding the basis for legal arguments related to RA 7836 and RA 7610 in teacher discipline cases.

Misconceptions

  • Students often write ¬(p ∧ q) = ¬p ∧ ¬q — WRONG! The connective must flip from AND to OR.
  • Confusing modus tollens with 'denying the antecedent.' Remember: modus tollens DENIES THE CONSEQUENT (q), not the antecedent (p).
  • Thinking that any argument with true premises is valid. Validity is about FORM, not truth. An argument can have true premises and still be invalid (wrong form).
  • A tautology is NOT just a statement that happens to be true — it must be true for ALL possible combinations of truth values.

Related Concepts

  • Truth tables
  • Conditional and contrapositive
  • Inductive and deductive reasoning
  • Logical equivalence

Common Exam Questions

Example

What is the negation of 'p or q'? Answer: 'not p and not q' (¬p ∧ ¬q).

Approach

Identify the connective being negated (AND or OR). Flip the connective and negate each part. Write the equivalent statement in words.

Question Type

Applying De Morgan's Laws

Example

Premises: 'If it is a holiday, schools are closed. Schools are closed.' Conclusion: 'It is a holiday.' Valid or invalid? INVALID — this is affirming the consequent.

Approach

Identify the form of the argument. Match it to modus ponens (p→q, p, ∴q) or modus tollens (p→q, ¬q, ∴¬p). If it matches neither, check for the two fallacies.

Question Type

Argument Validity

Key Points To Remember

  • De Morgan's Law 1: ¬(p ∧ q) = ¬p ∨ ¬q — negate AND, flip to OR.
  • De Morgan's Law 2: ¬(p ∨ q) = ¬p ∧ ¬q — negate OR, flip to AND.
  • Tautology is ALWAYS TRUE; contradiction is ALWAYS FALSE.
  • Modus Ponens: affirm p, conclude q (VALID).
  • Modus Tollens: deny q, conclude ¬p (VALID).
  • Affirming the consequent and denying the antecedent are INVALID fallacies.
  • In the LET, identify valid argument forms by checking if the conclusion must follow from the premises.

Inductive and Deductive Reasoning

Two modes of reasoning are foundational in both mathematics and teaching: INDUCTIVE REASONING moves from SPECIFIC OBSERVATIONS to a GENERAL CONCLUSION. You observe several cases, notice a pattern, and make a conjecture (educated guess) about the general rule. The conclusion is PROBABLE but not guaranteed — a single COUNTEREXAMPLE is enough to disprove an inductive claim. Example: A teacher notices that 2, 4, 6, 8, 10 are all even and divisible by 2. She concludes (inductively): 'All even numbers are divisible by 2.' This is a valid generalization, but it is arrived at inductively. The DISCOVERY process in mathematics is inductive — mathematicians observe patterns and form conjectures. But conjectures are NOT proofs. DEDUCTIVE REASONING moves from GENERAL PREMISES to a SPECIFIC CONCLUSION. If the premises are true and the argument is valid, the conclusion MUST be true — it is CERTAIN, not just probable. Example: General rule: 'All multiples of 4 are even.' Specific case: '28 is a multiple of 4.' Conclusion: 'Therefore, 28 is even.' This is deductive — the conclusion follows necessarily. PEDAGOGICAL CONNECTION: In the K-12 BEC, elementary mathematics teachers are encouraged to begin lessons inductively — having pupils discover patterns through guided activities — then move to deductive application of the discovered rule. This mirrors the scientific process of hypothesis (inductive) and proof (deductive). KEY DISTINCTION: - Inductive: Specific → General (probable, can be disproven) - Deductive: General → Specific (certain, if valid and premises are true) - A counterexample DISPROVES an inductive claim but does NOT affect a valid deductive argument (it would mean a premise is false instead).

Examples

Inductive reasoning in mathematics generates conjectures. The conjecture 'sum of two consecutive odd numbers is even' happens to be true and can be proved deductively using algebra: (2n-1) + (2n+1) = 4n, which is even. The teacher used induction to discover, then could use deduction to prove.

Scenario

A teacher observes: 1 + 3 = 4, 3 + 5 = 8, 5 + 7 = 12, 7 + 9 = 16. She concludes: 'The sum of any two consecutive odd numbers is an even number.' What type of reasoning is this?

Solution

INDUCTIVE REASONING. She observed specific cases and generalized to a rule. The conclusion is probable (and in this case, also provable deductively), but the process of reaching it from examples is inductive.

Both premises are mathematically true, and the argument is valid (it follows the syllogism pattern). Therefore, the conclusion is certain. This is the type of reasoning used in geometric proofs, which elementary pupils begin to encounter in Grade 5–6.

Scenario

Premises: (1) All rectangles are parallelograms. (2) A square is a rectangle. Conclusion: A square is a parallelogram. What type of reasoning is this?

Solution

DEDUCTIVE REASONING. The conclusion follows necessarily from the two general premises. This is a syllogism — a classic deductive form.

This illustrates the danger of inductive reasoning based on limited observations. The student only checked odd base numbers (1, 3) and skipped 2. One counterexample (2² = 4 is even) is sufficient to disprove the inductive claim.

Scenario

A student claims: 'I checked: 1² = 1, 2² = 4, 3² = 9. All perfect squares are odd.' Evaluate this claim.

Solution

The claim uses INDUCTIVE REASONING — but it is WRONG. The counterexample is 2² = 4, which is an even perfect square. (Also, 4² = 16, 6² = 36, etc.) The inductive claim is disproven by counterexample.

Applications

  • Elementary lesson design: Use inductive exploration (pattern activities) before stating rules — aligned with K-12 BEC's learner-centered, inquiry-based approach.
  • Critical thinking in classroom discussions: Help pupils distinguish between 'I think this is always true based on examples I tried' (inductive) vs. 'This must be true because of the rule we proved' (deductive).
  • Evaluating research conclusions: Survey-based educational research uses inductive reasoning; mathematical theorems use deductive reasoning.
  • LET item analysis: Identifying whether the reasoning in a given argument moves from specific to general (inductive) or general to specific (deductive).

Misconceptions

  • Many examples that support an inductive claim do NOT prove it — only deductive proof establishes certainty.
  • Students often think deductive reasoning is just 'logical' and inductive is 'wrong.' Both are valid reasoning tools with different roles.
  • Confusing inductive reasoning with 'guessing' — it is systematic and pattern-based, just not certain.
  • Thinking that a disproven inductive claim means the opposite is true. A counterexample only shows the original claim is not UNIVERSALLY true.

Related Concepts

  • Valid arguments
  • Patterns and sequences
  • Tautology
  • Mathematical proof

Common Exam Questions

Example

'All prime numbers greater than 2 are odd. 17 is a prime number greater than 2. Therefore, 17 is odd.' What type of reasoning? Answer: DEDUCTIVE.

Approach

Ask: Does the argument move from examples/cases to a general rule? (Inductive) Or from a general rule to a specific case? (Deductive)

Question Type

Classification of Reasoning Type

Example

Claim: 'n² + n + 41 is prime for all positive integers n.' Counterexample: n = 41 gives 41² + 41 + 41 = 41(41 + 1 + 1) = 41 × 43, which is NOT prime.

Approach

For inductive claims, try to find ONE specific case where the conclusion fails. If found, the claim is disproven.

Question Type

Finding a Counterexample

Key Points To Remember

  • Inductive reasoning: specific to general — conclusions are PROBABLE, not certain.
  • Deductive reasoning: general to specific — conclusions are CERTAIN if premises are true and argument is valid.
  • ONE counterexample is enough to disprove an inductive conclusion.
  • Deductive conclusions cannot be disproven if the premises are true and the logic is valid.
  • Mathematics uses inductive reasoning to DISCOVER patterns and deductive reasoning to PROVE them.
  • In teaching, inductive approaches help pupils discover rules; deductive approaches help pupils apply rules.

Patterns and Sequences

A SEQUENCE is an ordered list of numbers (or objects) following a specific rule. Identifying the type of sequence is the first step to finding any missing term or applying the correct formula. 1. ARITHMETIC SEQUENCE Definition: A constant amount (common difference d) is ADDED to each term. Formula for the nth term: aₙ = a₁ + (n − 1)d Formula for the sum of n terms: Sₙ = (n/2)(a₁ + aₙ) or Sₙ = (n/2)[2a₁ + (n−1)d] How to identify: Subtract any term from the next. If the difference is constant, it is arithmetic. Example: 5, 9, 13, 17, ... → d = 4 (arithmetic) 2. GEOMETRIC SEQUENCE Definition: A constant amount (common ratio r) is MULTIPLIED to each term. Formula for the nth term: aₙ = a₁ × r^(n−1) How to identify: Divide any term by the previous. If the ratio is constant, it is geometric. Example: 3, 6, 12, 24, ... → r = 2 (geometric) 3. FIBONACCI SEQUENCE Definition: Each term is the SUM of the two preceding terms. Sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... Rule: Fₙ = Fₙ₋₁ + Fₙ₋₂ Found in nature: number of petals on flowers, arrangement of seeds in sunflowers, spirals in pineapples and snail shells. Golden Ratio: As consecutive Fibonacci numbers are divided (e.g., 55/34 ≈ 1.618), they approach φ (phi) ≈ 1.618, the golden ratio, associated with aesthetic proportion in art, architecture, and nature. 4. SPECIAL NUMBER PATTERNS Square numbers: 1, 4, 9, 16, 25, 36, ... (pattern: n²) Triangular numbers: 1, 3, 6, 10, 15, 21, ... (pattern: running sums: 1, 1+2, 1+2+3, ...) KEY STRATEGY for LET sequence items: Step 1 — Check if the differences are constant → arithmetic Step 2 — Check if the ratios are constant → geometric Step 3 — Check if each term = sum of previous two → Fibonacci Step 4 — Check if terms are perfect squares or triangular numbers Step 5 — Apply the correct formula

Examples

The common difference is 5 (each term increases by 5). Substituting n = 12 into the formula gives 59. Verify: counting 11 more terms from 4 at intervals of 5 should reach 59.

Scenario

Find the 12th term of the arithmetic sequence: 4, 9, 14, 19, ...

Solution

Step 1: Identify a₁ = 4 and d = 9 − 4 = 5. Step 2: Apply the formula aₙ = a₁ + (n−1)d. Step 3: a₁₂ = 4 + (12−1)(5) = 4 + (11)(5) = 4 + 55 = 59. Answer: The 12th term is 59.

This models a real Philippine classroom context. The arithmetic series formula efficiently finds the total without adding each row individually. Sum = 3+5+7+9+11+13+15+17 = 80. ✓

Scenario

A Grade 6 teacher arranges seats in rows: Row 1 has 3 seats, Row 2 has 5 seats, Row 3 has 7 seats, and so on. How many total seats are in 8 rows?

Solution

Step 1: Identify the sequence — arithmetic with a₁ = 3, d = 2. Step 2: Find a₈ = 3 + (8−1)(2) = 3 + 14 = 17. Step 3: Sum = (n/2)(a₁ + aₙ) = (8/2)(3 + 17) = 4 × 20 = 80. Answer: 80 seats total.

The ratio between consecutive terms is constant (3), confirming this is geometric. Apply the formula directly. Note how geometric sequences grow much faster than arithmetic — 3,645 vs. what would be around 23 if arithmetic.

Scenario

Find the 7th term of the geometric sequence: 5, 15, 45, ...

Solution

Step 1: a₁ = 5, r = 15/5 = 3. Step 2: a₇ = 5 × 3^(7−1) = 5 × 3⁶ = 5 × 729 = 3,645. Answer: The 7th term is 3,645.

Each term is the sum of the two before it. There is no shortcut formula for the LET level — just list the terms systematically. Notice F₁₀/F₉ = 55/34 ≈ 1.618, approaching the golden ratio.

Scenario

What is the 10th term of the Fibonacci sequence?

Solution

List the sequence: F₁=1, F₂=1, F₃=2, F₄=3, F₅=5, F₆=8, F₇=13, F₈=21, F₉=34, F₁₀=55. Answer: The 10th term is 55.

Applications

  • Seat arrangement and resource allocation in classrooms (arithmetic sequences).
  • Compound growth of school enrollment, population, or budget projections (geometric sequences).
  • Nature study in elementary Science classes — Fibonacci patterns in flowers, shells, and pineapples as an interdisciplinary connection.
  • Teaching patterns in K-12 Grade 1–6 Mathematics: recognizing and extending patterns is a core competency in the curriculum.

Misconceptions

  • Confusing arithmetic (constant difference) with geometric (constant ratio). Always CHECK by computing differences AND ratios before deciding.
  • Using the wrong formula — applying arithmetic formula to a geometric sequence, or vice versa.
  • Forgetting that in aₙ = a₁ + (n−1)d, it is (n−1) not n. The '−1' adjusts for the fact that the first term does not need any d added.
  • Miscounting Fibonacci terms by not starting from F₁ = 1, F₂ = 1.

Related Concepts

  • Inductive reasoning (used to discover sequence patterns)
  • Finance applications (compound interest uses geometric growth)
  • Fibonacci sequence and golden ratio
  • Arithmetic and geometric means

Common Exam Questions

Example

What is the 15th term of 2, 5, 8, 11, ...? (Arithmetic, d=3.) a₁₅ = 2 + (14)(3) = 2 + 42 = 44.

Approach

Identify the sequence type. Apply the correct formula. Substitute values carefully.

Question Type

Finding the nth Term

Example

Find the sum of the first 20 terms of 1, 4, 7, 10, ... (a₁=1, d=3, a₂₀=1+19×3=58). S₂₀ = (20/2)(1+58) = 10×59 = 590.

Approach

Use Sₙ = (n/2)(a₁ + aₙ) for arithmetic series. Find aₙ first if not given.

Question Type

Finding the Sum

Example

Fill in the blank: 2, 6, __, 54, 162. Ratio = 3 (geometric). Missing term = 6 × 3 = 18.

Approach

Find d or r, then fill in the blank.

Question Type

Identifying Missing Terms

Key Points To Remember

  • Arithmetic sequence: constant DIFFERENCE d. Formula: aₙ = a₁ + (n−1)d.
  • Sum of arithmetic sequence: Sₙ = (n/2)(a₁ + aₙ).
  • Geometric sequence: constant RATIO r. Formula: aₙ = a₁ × r^(n−1).
  • Fibonacci: each term = sum of the two before it. Sequence: 1,1,2,3,5,8,13,21,34,55,...
  • Golden ratio φ ≈ 1.618 — ratio of consecutive Fibonacci numbers approaches this value.
  • Square numbers: 1, 4, 9, 16, 25 (n²); Triangular: 1, 3, 6, 10, 15 (running sums).
  • Always identify the sequence type FIRST before applying any formula.

Mathematics in Everyday Life: Finance, Sets, and Modular Arithmetic

The 'Mathematics in the Modern World' course, now standard in Philippine teacher-education programs, emphasizes that mathematics is a PRACTICAL TOOL for everyday decisions. The LET tests three key application areas: 1. FINANCIAL MATHEMATICS SIMPLE INTEREST: Interest is computed on the ORIGINAL principal only. Formula: I = P × R × T Where: I = Interest, P = Principal (amount borrowed/invested), R = Rate per year, T = Time in years Total Amount: A = P + I = P(1 + RT) COMPOUND INTEREST: Interest is computed on the PRINCIPAL PLUS ACCUMULATED INTEREST ('interest on interest'). Money grows faster than under simple interest. Formula: A = P(1 + r)ⁿ Where: A = Final amount, P = Principal, r = Annual interest rate (as decimal), n = Number of compounding periods Interest earned: I = A − P KEY INSIGHT: Under compound interest, the year 2 interest is computed on the balance at the end of year 1 (which already includes year 1 interest), so you earn more interest overall. This is why savings accounts and loan amortization use compound interest. 2. SETS AND VENN DIAGRAMS A SET is a collection of distinct objects (elements). Key set operations: - Union (A ∪ B): All elements in A OR B (or both). - Intersection (A ∩ B): Elements in BOTH A AND B. - Complement (A'): Elements NOT in A (relative to the universal set). Venn diagram counting formula: n(A ∪ B) = n(A) + n(B) − n(A ∩ B) This formula subtracts the intersection because elements in BOTH sets are counted twice when you add n(A) and n(B). KEY WORD CLUES in word problems: - 'Only A' = elements in A but NOT in B - 'Both' = elements in A ∩ B - 'Either or both' = elements in A ∪ B - 'Neither' = elements outside both A and B 3. MODULAR ARITHMETIC AND CHECK DIGITS Modular arithmetic works with REMAINDERS. 'a mod m' means the remainder when a is divided by m. Example: 17 mod 5 = 2 (because 17 = 3 × 5 + 2). CHECK DIGITS (ISBN, barcodes, bank cards) use modular arithmetic to detect errors. A computed sum of digits is taken mod a number; if the result matches a built-in check digit, the code is valid. A single mistyped digit changes the sum and produces a mismatch — flagging the error. This is why an online payment system immediately rejects a wrong card number.

Examples

The compounding effect adds ₱220.32 extra because in year 2, interest is earned on ₱21,200 (not ₱20,000), and in year 3, on ₱22,472. This 'interest on interest' accumulates over time, which is why long-term savings benefit greatly from compound interest.

Scenario

A teacher deposits ₱20,000 in a bank at 6% annual interest for 3 years. Compare simple and compound interest earned.

Solution

Simple Interest: I = PRT = 20,000 × 0.06 × 3 = ₱3,600. Compound Interest: A = P(1+r)ⁿ = 20,000 × (1.06)³ = 20,000 × 1.191016 = ₱23,820.32 I = 23,820.32 − 20,000 = ₱3,820.32. Difference: 3,820.32 − 3,600 = ₱220.32 more with compound interest.

Venn diagram setup: The intersection (both clubs) = 10. Only Math = 30 − 10 = 20. Only Science = 25 − 10 = 15. Both = 10. Neither = 5. Total check: 20 + 15 + 10 + 5 = 50. ✓ Always verify by summing all regions.

Scenario

In a class of 50 pupils, 30 joined the Math Club, 25 joined the Science Club, and 10 joined both. How many joined NEITHER club? How many joined ONLY the Math Club?

Solution

Step 1: n(M ∪ S) = n(M) + n(S) − n(M ∩ S) = 30 + 25 − 10 = 45. Step 2: Neither = Total − n(M ∪ S) = 50 − 45 = 5 pupils. Step 3: Only Math = n(M) − n(M ∩ S) = 30 − 10 = 20 pupils.

Modular arithmetic focuses on remainders. 6 × 7 = 42, and 47 − 42 = 5. The statement '47 ≡ 5 (mod 7)' (read '47 is congruent to 5 modulo 7') means they have the same remainder when divided by 7.

Scenario

Find 47 mod 7. Then determine if 47 ≡ 5 (mod 7).

Solution

47 ÷ 7 = 6 remainder 5. So 47 mod 7 = 5. Since 47 mod 7 = 5, we confirm 47 ≡ 5 (mod 7). TRUE.

Applications

  • Personal financial literacy for teachers: computing interest on SSS/GSIS loans or bank savings — directly applicable to a beginning teacher's financial life.
  • School canteen or cooperative fund management: comparing loan options using simple vs. compound interest calculations.
  • Venn diagram problems appear in DepEd data analysis (e.g., how many pupils passed both reading and numeracy assessments).
  • Understanding how DepEd's school report cards and data from PISA/NAT use set operations to categorize student performance.

Misconceptions

  • In compound interest, many students forget to convert the percentage rate to a decimal (e.g., 5% = 0.05, NOT 5). This gives answers 100 times too large.
  • In Venn diagram problems, students often forget to subtract the intersection when computing the union, leading to double-counting.
  • Thinking 'neither' means n(A) + n(B) − Total. The correct approach is Total − n(A ∪ B).
  • Confusing simple interest total (A = P + I) with compound interest formula (A = P(1+r)ⁿ). In compound, the formula already gives the TOTAL amount, not just the interest.

Related Concepts

  • Arithmetic and geometric sequences (geometric growth models compound interest)
  • Logical connectives (set operations mirror AND, OR, NOT)
  • Modular arithmetic
  • Ratio and proportion

Common Exam Questions

Example

₱15,000 at 5% for 2 years: Simple I = 15,000 × 0.05 × 2 = ₱1,500. Compound A = 15,000 × (1.05)² = 15,000 × 1.1025 = ₱16,537.50, I = ₱1,537.50. Compound earns ₱37.50 more.

Approach

Compute simple interest (I=PRT) and compound interest (A=P(1+r)ⁿ, then I=A−P). Compare the results.

Question Type

Simple vs. Compound Interest Comparison

Example

40 students: 22 like reading, 18 like math, 8 like both. Neither = 40 − (22 + 18 − 8) = 40 − 32 = 8 students.

Approach

Draw a Venn diagram. Fill in the intersection first, then compute 'only A,' 'only B,' and 'neither.' Verify by summing all regions to match the total.

Question Type

Venn Diagram Word Problem

Key Points To Remember

  • Simple interest: I = PRT. Total amount A = P + I = P(1+RT).
  • Compound interest: A = P(1+r)ⁿ. Interest I = A − P. Compound always > simple for same rate and time.
  • Venn diagram: n(A ∪ B) = n(A) + n(B) − n(A ∩ B). Subtract the overlap to avoid double-counting.
  • Set union (∪) matches logical OR; intersection (∩) matches logical AND; complement matches NOT.
  • Modular arithmetic: 'a mod m' = remainder when a is divided by m.
  • Check digits use modular arithmetic to detect errors in codes (barcodes, ISBNs, card numbers).
  • In word problems, identify the key word: 'both' → intersection; 'either' → union; 'neither' → complement of union.

Practice Problems

Key check: Is the sentence declarative and verifiable as true or false? Commands and questions fail this test. Note that (c) is a statement even though it is false — the existence of the counterexample (2) makes it definitively false.

Problem

Classify each sentence as a statement or not. If a statement, give its truth value. (a) 'The Professional Regulation Commission administers the LET.' (b) 'Study hard for the Board Exam!' (c) 'All prime numbers are odd.' (d) 'What is the golden ratio?'

Solution

(a) Statement — TRUE. (b) NOT a statement — it is a command. (c) Statement — FALSE (2 is a prime number but is even). (d) NOT a statement — it is a question.

Work systematically: resolve negations first, then conjunctions/disjunctions, then conditionals/biconditionals. In (c), the conditional is false because the hypothesis is true but the conclusion is false — the 'broken promise' scenario. In (d), first compute T ∨ F = T, then negate to get F.

Problem

Let p be TRUE and q be FALSE. Evaluate each compound statement: (a) p ∧ q (b) ¬p ∨ q (c) p → q (d) ¬(p ∨ q) (e) p ↔ q

Solution

(a) T ∧ F = FALSE (b) ¬T ∨ F = F ∨ F = FALSE (c) T → F = FALSE (the only case where conditional is false) (d) ¬(T ∨ F) = ¬T = FALSE (e) T ↔ F = FALSE (they have different truth values)

The Code of Ethics for Professional Teachers is a core reference in RA 7836. The contrapositive is formed by BOTH swapping p and q AND negating both. It is always logically equivalent. The converse and inverse are equivalent to each other but not to the original — a teacher could serve pupils well through motivation and passion even without formally knowing the Code of Ethics (making the converse not necessarily true).

Problem

Given: 'If a teacher follows the Code of Ethics for Professional Teachers, then the teacher serves pupils well.' (a) Write the converse. (b) Write the inverse. (c) Write the contrapositive. (d) Which of (a), (b), (c) is logically equivalent to the original?

Solution

(a) Converse: 'If a teacher serves pupils well, then the teacher follows the Code of Ethics.' (b) Inverse: 'If a teacher does NOT follow the Code of Ethics, then the teacher does NOT serve pupils well.' (c) Contrapositive: 'If a teacher does NOT serve pupils well, then the teacher does NOT follow the Code of Ethics.' (d) The CONTRAPOSITIVE (c) is logically equivalent to the original.

De Morgan's Laws: negate AND → OR with each part negated; negate OR → AND with each part negated. In (c), applying De Morgan's gives ¬p ∨ ¬(¬q), and ¬(¬q) = q by double negation, so the final answer is ¬p ∨ q. This is also the equivalent form of the conditional p → q, which is logically equivalent to ¬p ∨ q.

Problem

Apply De Morgan's Law: Write the negation of each statement. (a) 'The pupil is attentive and the pupil is participative.' (b) 'The teacher is present or the substitute is here.' (c) ¬(p ∧ ¬q) — write this as an equivalent expression.

Solution

(a) ¬(attentive ∧ participative) = 'The pupil is NOT attentive OR the pupil is NOT participative.' (b) ¬(present ∨ substitute here) = 'The teacher is NOT present AND the substitute is NOT here.' (c) ¬(p ∧ ¬q) = ¬p ∨ ¬(¬q) = ¬p ∨ q

Argument (a) follows a valid syllogism. Argument (b) denies the antecedent — a classic fallacy; there could be other pathways to promotion under DepEd policy. Argument (c) affirms the consequent — new materials could arrive from LGU or private donors without PRIME funding, so we cannot conclude the school has PRIME funding just from having new materials.

Problem

Determine if each argument is valid. Identify the argument form. (a) All DepEd teachers follow child protection laws (RA 7610). Maria is a DepEd teacher. Therefore, Maria follows RA 7610. (b) If a pupil passes the NAT, the pupil advances to the next grade. Juan did not pass the NAT. Therefore, Juan does not advance. (c) If a school has PRIME funding, it has new materials. This school has new materials. Therefore, this school has PRIME funding.

Solution

(a) VALID — Modus Ponens (or syllogism). All A are B; X is A; therefore X is B. ✓ (b) INVALID — Denying the Antecedent. (p→q, ¬p, ∴¬q) The NAT is not the ONLY criterion for promotion; other factors apply. (c) INVALID — Affirming the Consequent. (p→q, q, ∴p) New materials could come from other sources (LGU, donations) even without PRIME funding.

Always identify a₁ and d first. The formula (n−1) accounts for the fact that d is added only 19 times to get from the 1st term to the 20th. Verification: starting from 7 and adding 5 nineteen times should reach 102. Quick check: 7 + 95 = 102. ✓

Problem

Find the 20th term of the arithmetic sequence: 7, 12, 17, 22, ...

Solution

Step 1: a₁ = 7, d = 12 − 7 = 5. Step 2: aₙ = a₁ + (n−1)d. Step 3: a₂₀ = 7 + (20−1)(5) = 7 + (19)(5) = 7 + 95 = 102. Answer: The 20th term is 102.

The sum formula requires both a₁ and aₙ. Find the 15th term first, then apply the sum formula. Note: (15/2)(62) = 7.5 × 62 = 465. Alternatively, use Sₙ = (n/2)[2a₁ + (n−1)d] = (15/2)[6 + 56] = (15/2)(62) = 465. Same result. ✓

Problem

Find the sum of the first 15 terms of the arithmetic sequence: 3, 7, 11, 15, ...

Solution

Step 1: a₁ = 3, d = 4. Step 2: Find a₁₅ = 3 + (15−1)(4) = 3 + 56 = 59. Step 3: S₁₅ = (n/2)(a₁ + aₙ) = (15/2)(3 + 59) = (15/2)(62) = 15 × 31 = 465. Answer: The sum of the first 15 terms is 465.

The exponent is (n−1), not n. So for the 8th term, compute 3⁷ (not 3⁸). 3⁷ = 2,187. Multiply by the first term: 4 × 2,187 = 8,748. Geometric sequences grow rapidly — from 4 to 8,748 in just 8 terms with ratio 3.

Problem

Find the 8th term of the geometric sequence: 4, 12, 36, ...

Solution

Step 1: a₁ = 4, r = 12/4 = 3. Step 2: aₙ = a₁ × r^(n−1). Step 3: a₈ = 4 × 3^(8−1) = 4 × 3⁷ = 4 × 2,187 = 8,748. Answer: The 8th term is 8,748.

Each term is the sum of the two before it. F₁₂ = F₁₁ + F₁₀ = 89 + 55 = 144. F₁₃ = F₁₂ + F₁₁ = 144 + 89 = 233. Notice F₁₃/F₁₂ = 233/144 ≈ 1.6181, already very close to the golden ratio φ ≈ 1.618.

Problem

What is the 13th Fibonacci number?

Solution

List from F₁: F₁=1, F₂=1, F₃=2, F₄=3, F₅=5, F₆=8, F₇=13, F₈=21, F₉=34, F₁₀=55, F₁₁=89, F₁₂=144, F₁₃=233. Answer: The 13th Fibonacci number is 233.

Under simple interest, the same ₱2,000 interest is added each year (₱50,000 × 4%). Under compound interest, year 2 adds interest on ₱52,000 and year 3 on the growing balance. The difference (₱56,243.20 − ₱56,000 = ₱243.20) may seem small here, but it grows significantly with larger principals and longer periods — relevant when teachers evaluate GSIS loan terms.

Problem

A teacher cooperative lends ₱50,000 at 4% annual simple interest for 3 years. (a) How much interest is charged? (b) What is the total amount to be repaid? (c) If instead the rate is compound interest at 4% per year for 3 years, what is the total repayment?

Solution

Simple Interest: (a) I = PRT = 50,000 × 0.04 × 3 = ₱6,000. (b) Total repayment = P + I = 50,000 + 6,000 = ₱56,000. Compound Interest: (c) A = P(1+r)ⁿ = 50,000 × (1.04)³ = 50,000 × 1.124864 = ₱56,243.20. Total repayment under compound = ₱56,243.20.

Draw a Venn diagram with two overlapping circles. Fill in the intersection (20) first. Then compute 'only' regions by subtracting the intersection from each set total. Sum all four regions to verify against the total. This Venn diagram technique is applicable to many DepEd data analysis contexts — such as analyzing how many pupils passed both reading and numeracy assessments in the Philippine Informal Reading Inventory (Phil-IRI) and ELLNA.

Problem

In a survey of 100 Grade 6 pupils: 60 like reading storybooks, 45 like solving math puzzles, and 20 like both. How many like (a) at least one activity? (b) only reading? (c) only math puzzles? (d) neither activity?

Solution

(a) n(R ∪ M) = n(R) + n(M) − n(R ∩ M) = 60 + 45 − 20 = 85 pupils. (b) Only Reading = n(R) − n(R ∩ M) = 60 − 20 = 40 pupils. (c) Only Math = n(M) − n(R ∩ M) = 45 − 20 = 25 pupils. (d) Neither = 100 − 85 = 15 pupils. Verification: 40 + 25 + 20 + 15 = 100. ✓

In (a), the student observed a pattern from only four numbers and made a hasty generalization. The number 9 (or 15, 21, 25, etc.) disproves the claim. This is the danger of inductive reasoning — limited observations can mislead. In (b), the syllogistic form ensures that if the general rule (all multiples of 10 end in 0) is true and 370 satisfies the condition, the conclusion must follow. Deductive reasoning guarantees the conclusion if premises are true and the argument is valid.

Problem

Identify whether each is inductive or deductive reasoning. Then evaluate if it is correct. (a) 'I noticed that 3, 5, 7, and 11 are all prime and odd. Therefore, all odd numbers are prime.' (b) 'All multiples of 10 end in 0. 370 is a multiple of 10. Therefore, 370 ends in 0.'

Solution

(a) INDUCTIVE REASONING — and the conclusion is WRONG. Counterexample: 9 is odd (9 = 3 × 3) but NOT prime. (b) DEDUCTIVE REASONING — and the conclusion is CORRECT. The argument is valid and the premises are true.

Exam Preparation Tips

  • MASTER THE TRUTH TABLE by heart. You must recall instantly: conjunction is true only when BOTH are true; conditional is false ONLY when p=TRUE and q=FALSE. Write the table 10 times until it is automatic.
  • For conditional variations, use the mnemonic 'CONIC': Conditional (p→q), cOnverse (q→p), iNverse (¬p→¬q), Contrapositive (¬q→¬p). Remember: only the contrapositive is equivalent to the original.
  • De Morgan's Laws = 'Break the bar, change the sign.' Negate AND → OR; negate OR → AND. Always negate BOTH parts.
  • For argument validity: write the premises in symbolic form, then check against modus ponens (p→q, p, ∴q) and modus tollens (p→q, ¬q, ∴¬p). If it matches neither, the argument is likely invalid.
  • For sequences: ALWAYS determine the type first. Compute differences (for arithmetic) and ratios (for geometric). If neither is constant, check for Fibonacci pattern. Only THEN apply the formula.
  • Memorize the Fibonacci sequence up to at least the 15th term: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610. The golden ratio φ ≈ 1.618.
  • For Venn diagram problems: ALWAYS draw the diagram, fill in the intersection FIRST, then compute 'only' regions, then 'neither.' Verify by summing all regions to match the total.
  • For interest problems: Simple Interest I = PRT (three multiplications). Compound Interest A = P(1+r)ⁿ (formula gives TOTAL amount, not just interest). Convert percentage to decimal FIRST.
  • Time management in the LET: Logic items (statements, truth tables, conditionals) can be solved in 30–60 seconds each if you memorize the rules. Sequence items take 1–2 minutes. Finance and Venn diagram items take 2–3 minutes. Prioritize logic items first.
  • Use elimination strategy in multiple-choice: For conditional truth value questions, immediately eliminate any answer that says the conditional is false when p is false — this is ALWAYS wrong.
  • Review Philippine educational context connections: RA 7836 (teacher licensure), Code of Ethics, and RA 7610 (child protection) are often woven into logic word problems. Knowing these laws helps you quickly assign truth values to policy-based statements.
  • Practice the Venn diagram inclusion-exclusion formula: n(A ∪ B) = n(A) + n(B) − n(A ∩ B). For three sets: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A∩B) − n(A∩C) − n(B∩C) + n(A∩B∩C).
  • For the LET, compound statements with 3 variables (p, q, r) require 8 rows in the truth table (2³). Practice evaluating these step-by-step, column by column.
  • When the problem says 'logically equivalent,' the answer for a conditional p→q is ALWAYS the contrapositive ¬q→¬p. This is one of the most frequently tested facts in the Logic section.
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…

In summary

Logic and Mathematics in the Modern World forms a powerful foundation for both your LET examination and your future classroom practice. The chapter unites two seemingly different domains: the precision of formal logic (statements, connectives, truth tables, valid arguments) and the practical power of mathematics (sequences, finance, sets, modular arithmetic). Together, they embody the vision of the K-12 BEC and the 'Mathematics in the Modern World' GE course: that mathematics is not just calculation but a language for clear, critical, and creative thinking. As a future elementary teacher, you will apply these concepts daily: writing logically structured lesson objectives (propositions), using if-then reasoning in classroom rules (conditionals), spotting patterns in pupil performance data (sequences), helping pupils understand fair sharing through set theory (Venn diagrams), and making sound financial decisions as a professional (interest computations). The Code of Ethics for Professional Teachers under RA 7836 calls for competence and commitment to truth — and logical thinking is the backbone of both. For the LET, your priorities are clear: master truth tables (especially the conditional's single false row), know the contrapositive's equivalence, apply De Morgan's Laws automatically, identify sequence types before formula application, and solve Venn diagram and interest problems systematically. With consistent practice using the worked examples, flowcharts, and practice problems in this chapter, you will approach the Board Examination with both confidence and competence — and you will carry these habits of mind into every lesson you teach.

Previous chapter

Statistics and Probability

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.

Start free See the full LET Secondary guide LET Secondary preparation guide
← Back to Mathematics hub