Hard A-Level Mathematical argument and notation Questions

Challenging, exam-style A-Level Mathematical argument and notation questions with worked solutions. Stretch yourself on the hardest inequality, quadratic, sign-analysis, discriminant problems.

inequalityquadraticsign-analysisdiscriminantnecessary-sufficientfallacy
A-Level34 questionsStep-by-step solutions
Question 1
5 markschallenging
‘All primes are odd. 22 is prime. Therefore 22 is odd.’ The conclusion is false, yet the argument is logically valid in form. Explain the situation precisely.
Show worked solution

Worked solution

  1. Symbolise the argument

    primeodd;  2 prime;  2 odd\text{prime} \Rightarrow \text{odd}; \; 2 \text{ prime}; \; \therefore 2 \text{ odd}

    This is a valid deductive form (modus ponens).

  2. Check the logical form

    PQ,  PQP\Rightarrow Q,\; P \vdash Q

    If the premises were true, the conclusion would follow — so the FORM is valid.

  3. Test the first premise

    all primes are odd?\text{all primes are odd?}

    Examine whether ‘all primes are odd’ is actually true.

  4. Find a counterexample

    2 is prime and even2 \text{ is prime and even}

    22 is a prime number that is even, so the first premise is FALSE.

  5. Distinguish validity from truth

    validtrue premises\text{valid} \ne \text{true premises}

    Validity is about the structure; it does not guarantee the premises are true.

  6. Define soundness

    sound=valid+true premises\text{sound} = \text{valid} + \text{true premises}

    An argument is sound only if it is valid AND all premises are true.

  7. Classify this argument

    valid but not sound\text{valid but not sound}

    Here the form is valid, but a false premise makes it unsound, so the conclusion can be false.

  8. Explain the false conclusion

    garbage in, garbage out\text{garbage in, garbage out}

    A valid argument from a false premise can produce a false conclusion.

  9. State precisely

    valid, unsound; premise ‘all primes odd’ is false\text{valid, unsound; premise ‘all primes odd’ is false}

    The argument is valid in form but unsound because the premise is false.

  10. Define a valid argument

    true premisestrue conclusion\text{true premises} \Rightarrow \text{true conclusion}

    Validity means: IF the premises were true, the conclusion would have to be true.

  11. Define a sound argument

    valid+true premises\text{valid} + \text{true premises}

    Soundness additionally requires the premises actually to be true.

  12. Identify the modus ponens form

    PQ,  PQP\Rightarrow Q,\; P \vdash Q

    The argument follows the valid modus ponens pattern.

  13. Test the questionable premise

    are all primes odd?\text{are all primes odd?}

    We must check whether ‘all primes are odd’ is true.

  14. Produce the counterexample

    2 is prime and even2 \text{ is prime and even}

    22 is prime yet even, so the premise is false.

  15. Draw the distinction

    valid but unsound\text{valid but unsound}

    Hence the argument is valid in form but unsound, so a false conclusion is possible.

Answer
Valid in form but unsound: the premise ‘all primes are odd’ is false
Question 2
5 markschallenging
A student writes: ‘x24=0x^2 - 4 = 0, hence x2=4x^2 = 4, therefore x=2x = 2.’ Identify the flaw and give the fully correct conclusion in set notation.
Show worked solution

Worked solution

  1. Follow the first step

    x24=0x2=4x^2-4=0 \Rightarrow x^2=4

    Adding 44 to both sides is valid, so x2=4x^2=4 is correct.

  2. Examine the final step

    x2=4x=2?x^2=4 \Rightarrow x=2?

    Square-rooting must allow both signs, so x=2x=2 alone is incomplete.

  3. Recover the missing root

    x=±2x = \pm 2

    The correct deduction is x=2x=2 or x=2x=-2.

  4. Verify x=-2

    (2)24=0  (-2)^2 - 4 = 0 \;\checkmark

    Substituting x=2x=-2 satisfies the original equation.

  5. Name the flaw

    lost the negative root\text{lost the negative root}

    The word ‘therefore’ was applied to only one square root, dropping x=2x=-2.

  6. Explain the logical point

    x2=4x=±2x^2=4 \Leftrightarrow x=\pm2

    The correct relationship is an equivalence to x=±2x=\pm2, not just x=2x=2.

  7. Write the solution set

    {2,2}\{-2, 2\}

    Using set notation records the complete solution.

  8. Interpret

    two elements\text{two elements}

    The solution set has two elements, not one.

  9. State the correct conclusion

    {x:x24=0}={2,2}\{x: x^2-4=0\} = \{-2,2\}

    That is the fully correct statement.

  10. Restate the equation

    x24=0x^2-4=0

    We start again from the correct first line.

  11. Factorise as a difference of squares

    (x2)(x+2)=0(x-2)(x+2)=0

    An alternative valid route factorises directly.

  12. Apply the zero-product property

    x2=0 or x+2=0x-2=0 \text{ or } x+2=0

    Setting each factor to zero exposes both roots.

  13. Solve each factor

    x=2 or x=2x=2 \text{ or } x=-2

    This recovers the two solutions cleanly.

  14. Explain the original slip

    4=2 drops 2\sqrt{4}=2 \text{ drops } -2

    Taking only the positive square root is what lost the root 2-2.

  15. Write the full solution set

    {2,2}\{-2,2\}

    The complete, correct answer in set notation.

Answer
{2,2}\{-2, 2\}
Question 3
5 markschallenging
Decide, with justification, whether ‘x=xx0|x| = x \Leftrightarrow x \ge 0’ is true for all real xx.
Show worked solution

Worked solution

  1. Recall the definition of modulus

    x=x if x0,  x=x if x<0|x| = x \text{ if } x\ge0,\; |x|=-x \text{ if } x<0

    The modulus equals the number itself when non-negative, and its negative otherwise.

  2. Reverse direction: assume x \ge 0

    x0x=xx \ge 0 \Rightarrow |x| = x

    By definition, for non-negative xx the modulus is xx itself. Reverse holds.

  3. Forward direction: assume |x| = x

    x=x|x| = x

    Now suppose the modulus equals xx and deduce the sign of xx.

  4. Use non-negativity of modulus

    x0|x| \ge 0

    The modulus is always 0\ge 0.

  5. Combine

    x=x0x = |x| \ge 0

    Since xx equals a non-negative quantity, x0x \ge 0. Forward holds.

  6. Check the boundary x=0

    0=0=x,  00|0| = 0 = x, \; 0 \ge 0

    At x=0x=0 both sides are consistent.

  7. Check a negative x

    x=3:3=33x=-3: |-3| = 3 \ne -3

    For negative xx, xx|x| \ne x, and indeed x0x\ge0 is false — consistent.

  8. Both directions established

     valid\Leftrightarrow \text{ valid}

    Each implication holds, so the biconditional is true.

  9. Conclude

    True\text{True}

    The statement x=xx0|x|=x \Leftrightarrow x\ge0 is true for all real xx.

  10. Recall modulus is non-negative

    x0|x|\ge0

    The modulus never returns a negative value.

  11. Split by definition

    cases x0 and x<0\text{cases } x\ge0 \text{ and } x<0

    The modulus is defined piecewise, so we reason in two cases.

  12. Case non-negative

    x0x=xx\ge0 \Rightarrow |x|=x

    For x0x\ge0 the modulus equals xx itself.

  13. Case negative

    x<0x=xxx<0 \Rightarrow |x|=-x\ne x

    For x<0x<0 the modulus is x-x, which differs from xx.

  14. Combine into the biconditional

    x=xx0|x|=x \Leftrightarrow x\ge0

    Only the non-negative case gives equality, matching both directions.

  15. State the conclusion

    True\text{True}

    The biconditional is therefore true for all real xx.

Answer
True
Question 4
5 markschallenging
For real numbers, which condition on xx is necessary but NOT sufficient for ‘x2<4x^2 < 4’?
Show worked solution

Worked solution

  1. Solve the target inequality

    x2<42<x<2x^2<4 \Leftrightarrow -2<x<2

    First find exactly when x2<4x^2<4: it is the open interval (2,2)(-2,2).

  2. Recall 'necessary'

    x2<4conditionx^2<4 \Rightarrow \text{condition}

    A necessary condition must be implied BY x2<4x^2<4.

  3. Recall 'not sufficient'

    condition⇏x2<4\text{condition} \not\Rightarrow x^2<4

    But it must not, on its own, force x2<4x^2<4.

  4. Test candidate 'x<2'

    2<x<2x<2-2<x<2 \Rightarrow x<2

    Every xx with x2<4x^2<4 certainly has x<2x<2, so ‘x<2x<2’ is necessary.

  5. Check it is not sufficient

    x=5:x<2 but x2=254x=-5: x<2 \text{ but } x^2=25 \not<4

    But x<2x<2 allows x=5x=-5, where x2<4x^2<4 fails; so ‘x<2x<2’ is not sufficient.

  6. Reject 'x<3' as too weak? test necessity

    2<x<2x<3  -2<x<2 \Rightarrow x<3 \;\checkmark

    x<3x<3’ is also necessary, but let us compare with the sufficiency requirement.

  7. Reject '-2<x<2' (that is sufficient)

    2<x<2x2<4-2<x<2 \Leftrightarrow x^2<4

    The exact interval is necessary AND sufficient, so it is the wrong answer here.

  8. Reject '0<x<2' (not necessary)

    x=1:x2<4 but 0<x<2 falsex=-1: x^2<4 \text{ but } 0<x<2 \text{ false}

    0<x<20<x<2’ is not necessary because negative xx can satisfy x2<4x^2<4.

  9. Reject '|x|<3'? it is necessary not sufficient too

    several valid necessary-not-sufficient conditions exist\text{several valid necessary-not-sufficient conditions exist}

    Both ‘x<2x<2’ and ‘x<3|x|<3’ qualify; pick the offered one.

  10. Identify the correct option

    x<3|x|<3

    x<3|x|<3’ is implied by x2<4x^2<4 (necessary) but x=2.5x=2.5 shows it is not sufficient.

  11. Verify necessity of |x|<3

    x2<4x<2<3x^2<4 \Rightarrow |x|<2<3

    If x<2|x|<2 then certainly x<3|x|<3.

  12. Verify not sufficient

    x=2.5:x<3 but x2=6.254x=2.5: |x|<3 \text{ but } x^2=6.25\not<4

    So x<3|x|<3 does not force x2<4x^2<4.

  13. Recall necessary vs sufficient

    necessary: implied BY; sufficient: implies\text{necessary: implied BY; sufficient: implies}

    A necessary condition is implied by the target; a sufficient one implies it.

  14. Restate the target set

    x2<4x(2,2)x^2<4 \Leftrightarrow x\in(-2,2)

    The target holds exactly on the open interval (2,2)(-2,2).

  15. Confirm the choice

    (2,2){x:x<3}(-2,2)\subset\{x:|x|<3\}

    Since (2,2)(-2,2) sits strictly inside {x<3}\{|x|<3\}, that condition is necessary but not sufficient.

Answer
x<3|x|<3
Question 5
5 markschallenging
Which is a correct proof that ‘if abab is odd then both aa and bb are odd’ (integers a,ba,b)?
Show worked solution

Worked solution

  1. Assess a direct approach

    hard to start from ab odd\text{hard to start from } ab \text{ odd}

    Starting directly from ‘abab odd’ is awkward, so consider the contrapositive.

  2. Write the contrapositive

    ¬(a,b both odd)¬(ab odd)\neg(a,b \text{ both odd}) \Rightarrow \neg(ab \text{ odd})

    Negate both sides and reverse.

  3. Simplify the negations

    (a even or b even)ab even(a \text{ even or } b \text{ even}) \Rightarrow ab \text{ even}

    ‘Not both odd’ means at least one is even; ‘not odd’ means even.

  4. Assume at least one is even (WLOG a)

    a=2ka = 2k

    Without loss of generality suppose aa is even, so a=2ka=2k.

  5. Multiply

    ab=2kb=2(kb)ab = 2k\,b = 2(kb)

    Then abab is 22 times an integer.

  6. Conclude the product is even

    ab evenab \text{ even}

    So abab is even, proving the contrapositive.

  7. Note the symmetric case

    if b even, same argument\text{if } b \text{ even, same argument}

    The case ‘bb even’ is identical by symmetry.

  8. Invoke equivalence

    contrapositiveoriginal\text{contrapositive} \equiv \text{original}

    Since a statement and its contrapositive are equivalent, the original is proved.

  9. Conclude

    ab odda,b both oddab \text{ odd} \Rightarrow a,b \text{ both odd}

    The result follows.

  10. Reject checking examples

    examples are not a proof\text{examples are not a proof}

    Testing 3×5=153\times5=15 etc. does not prove a general statement.

  11. Reject the converse

    do not prove a,b oddab odd\text{do not prove } a,b \text{ odd}\Rightarrow ab \text{ odd}

    That is the converse (also true) but it is a different statement.

  12. Why the contrapositive is easier

    ‘odd’ hypotheses give little to use\text{‘odd’ hypotheses give little to use}

    Starting from ‘abab odd’ is awkward, so we flip to the contrapositive.

  13. Recall the even representation

    even=2k\text{even} = 2k

    Any even integer can be written as 2k2k for some integer kk.

  14. Verify with an example

    a=4,b=7:  ab=28 evena=4,\,b=7:\; ab=28 \text{ even}

    Testing an even aa confirms the product is even.

  15. State the logical justification

    originalcontrapositive\text{original} \equiv \text{contrapositive}

    Proving the contrapositive proves the original by logical equivalence.

Answer
Prove the contrapositive: a or b even ⇒ ab even

Unlock 29 more Mathematical argument and notation questions

Create a free account to work through every A-Level Mathematical argument and notation question with instant step-by-step worked solutions, progress tracking and interactive lessons.

  • Full worked solutions for every question
  • Interactive lessons and instant feedback
  • Track your mastery across every topic
Create a Free Account

No card required · Free forever

More Mathematical argument and notation practice

Related Pure Maths topics