165 questions · 20 question types identified
A question is this type if and only if it asks to show a statement is false by finding a specific counter example that contradicts the claim (e.g., 'if p is prime then 2p+1 is prime' or 'n² + 3n + 1 is always prime').
A question is this type if and only if it asks to prove that an expression involving n (e.g., n³ - n, n² + 2n) is always divisible by a specific number or is always even/odd for all integers n.
A question is this type if and only if it asks to prove an algebraic inequality (e.g., expressions involving x, y, a, b) using algebraic manipulation, completing the square, or rearrangement to show one expression is greater than or equal to another.
A question is this type if and only if it asks to write down the converse of a statement, determine if statements are true/false/either, or identify correct logical connectives (⇒, ⇐, ⇔).
A question is this type if and only if it asks to prove an inequality (typically involving positive real numbers) using proof by contradiction, starting by assuming the opposite inequality holds.
A question is this type if and only if it asks to prove that a specific number (e.g., √7, √3, log₂3) is irrational using proof by contradiction, typically assuming it can be written as p/q.
A question is this type if and only if it asks to prove by contradiction that no integers exist satisfying a given equation or condition (e.g., 3x² + 2xy - y² = 25 has no positive integer solutions).
A question is this type if and only if it asks to prove or disprove statements about sums, products, or quotients of rational and irrational numbers (e.g., 'if a is rational and b is irrational, then a+b is irrational').
A question is this type if and only if it requires proving a statement by checking all possible cases systematically, often involving modular arithmetic (e.g., n = 2k or n = 2k+1, or n ≡ 0, 1, 2 mod 3) or a finite set of values.
A question is this type if and only if it presents a student's incorrect proof or solution and asks to identify the mistake(s) and provide a correct version.
A question is this type if and only if it asks to prove that an expression is always even or odd, or involves proving statements about products/sums of consecutive integers being even.
A question is this type if and only if it asks to prove that squares of integers have specific modular properties (e.g., n² is always 0 or 1 mod 3, or n² + 2 is never divisible by 4).
A question is this type if and only if it asks to prove by contradiction that there is no greatest/smallest element in a set (e.g., no greatest odd integer, no smallest value in an interval).
A question is this type if and only if it provides a table to fill in and asks to prove a statement by exhaustively checking all valid combinations of constrained integer variables (e.g., a + b + c = 10 with c = b + 2).
A question is this type if and only if it asks to prove a conditional statement of the form 'if n³ is a multiple of k, then n is a multiple of k' or similar divisibility implications, often using contradiction.
A question is this type if and only if it involves proving or disproving statements about prime numbers, such as '2ⁿ - 1 is prime' or 'sum of consecutive primes is a multiple of 5'.
A question is this type if and only if it involves proving properties of Pythagorean triples or showing that certain integer expressions form specific patterns (e.g., 2t, t²-1, t²+1).
A question is this type if and only if it asks to prove properties of functions such as showing a function is odd, even, or proving that f(x) > 0 for all x.
A question is this type if and only if it asks to prove geometric properties (e.g., perpendicularity, circle diameter, equal lengths) using coordinate geometry and algebraic calculations.
A question is this type if and only if it involves proving or analyzing inequalities containing absolute value expressions (e.g., |x-2| ≥ |x| - 2).