Learn the idea. Try it yourself.

Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.

Read the lessonStart practising →

Foundations path · F01

Before this lesson: No earlier lesson is required. Start here and take your time.

Your goal: Read a statement, name its domain, and distinguish for every from there exists.

Start with the idea and one example. Take a break before the written task if you need it. The questions are original teaching exercises, not official past-paper questions.

First ask: which numbers are allowed?

Compare these two claims: “every positive integer is greater than zero” and “every integer is greater than zero”. The first is true. The second fails at zero and at negative integers. A small word changes the whole problem. The domain is the collection of values you are allowed to use.

Your first goal: learn to check a statement before trying to prove it. Work through the first three steps, then try the practice. Sets and functions below explain the language used in the later questions. You can take them in a second sitting.

1. Integers, rational numbers and zero

The integers are …, −3, −2, −1, 0, 1, 2, 3, … . Positive means greater than zero; nonnegative means zero or greater. Thus zero is an integer and is nonnegative, but it is not positive.

AA rational number can be written as a fraction of two integers with a nonzero denominator. For example, 3/5 is rational. Every integer is rational too: −4 = −4/1. A rational number need not be an integer. The real numbers include rational numbers and irrational numbers, such as √2, which cannot be written as a ratio of integers.

Worked example: can one number break the claim?

Claim: every integer has a positive square.

Test the boundary value zero. It is allowed, but 0² = 0 is not positive. Zero is a counterexample: one allowed value for which the claim fails. We can repair the statement to “every integer has a nonnegative square”. A positive integer has a positive square; zero has square zero; and multiplying a negative number by itself gives a positive result. These cases cover every integer.

Your turn: check the domain

Give a counterexample to “every rational number is an integer”. Then explain why −4 does not work as a counterexample.

A starting hint

You need an allowed rational number that is not an integer. Try a fraction between zero and one.

Compare your reasoning

The number 1/2 is rational because its numerator and nonzero denominator are integers. It is not an integer, so it disproves the claim. The number −4 is both rational and an integer; it supports this particular claim and cannot disprove it.

2. “Every” and “at least one” ask different things

“For every integer n” asks for a statement that works for all integers. Ten successful examples do not settle what happens to the others. “There exists an integer n” asks for at least one integer that works. It does not mean exactly one.

Worked example. “There exists an integer whose square is 9” is true: choose 3 and check 3² = 9. The number −3 also works, but one example already proves existence. “Every integer has square 9” is false: choose 0.

Try it. Is “there exists a negative integer whose square is 16” true? Give an allowed example and a check.

Check

Yes: −4 is a negative integer and (−4)² = 16. The positive number 4 would not answer this question because it is outside the stated domain.

3. Negation: describe exactly when a claim fails

The negation of a statement is true exactly when the original is false. It should cover every way the original can fail, without adding a new restriction.

Worked example. Suppose we have selected some integers. The claim “all selected integers are even” fails when at least one selected integer is odd. It does not require all of them to be odd. The selection {2, 3, 4} is enough to show why “all are odd” would be too strong.

In general, the negation of “every allowed number has property P” is “at least one allowed number does not have property P”. The negation of “at least one has property P” is “none has property P”. Here P simply names the condition being discussed.

Try it. Negate “every selected integer is positive”. Is “at least one is negative” sufficient?

Hint

Keep the boundary value zero in mind.

Check

The exact negation is “at least one selected integer is nonpositive”, meaning less than or equal to zero. “At least one is negative” misses a selection such as {0, 2, 5}, which also makes the original false.

4. Sets record membership

AA set is a collection of distinct elements. Order and repeated entries do not change membership. The sets {1, 1, 3} and {3, 1} are the same: both contain the two elements 1 and 3. We write 1 ∈ A to mean “1 belongs to the set A”.

Worked example. For A = {−2, 0, 3, 3}, there are three elements. Both −2 and 0 belong to A; 2 does not. A set and a list behave differently: a list may count repeated entries or their order, so read what the problem asks.

Try it. How many elements are in {0, 0, 1, −1, 1}?

Check

Three: 0, 1 and −1. Each distinct value is counted once.

5. Functions: each allowed input has exactly one output

AA function assigns exactly one output to every input in its domain. The notation f(x) means the output assigned to input x. It does not mean f multiplied by x.

Worked example. Let f(x) = x² for integer inputs. The input −2 gives output 4, and input 2 also gives output 4. This is allowed: two different inputs can share an output. What is not allowed is giving one input two different outputs.

A formula may restrict its inputs. For g(x) = 1/(x − 3) with real inputs, x = 3 would make the denominator zero, so it must be excluded. Its domain can be all real numbers except 3. At x = 5, g(5) = 1/2.

Try it. If h(x) = 1/(x + 2) for real inputs, which input must be excluded? What is h(0)?

Check

Exclude −2, because −2 + 2 = 0. Zero is allowed and gives h(0) = 1/2. A zero input is not the same thing as a zero denominator.

Optional bridge: one choice can depend on another

Read “for every integer n, there exists an integer m with m > n” in order: someone first chooses n, then you may choose m. If n = 5, choose m = 6. If n = −7, choose m = −6. The single rule m = n + 1 works for every integer n, including zero and negative values.

To negate it, describe a failure: there is an integer n for which no integer m is greater than n. Equivalently, there exists an integer n such that every integer m satisfies m ≤ n. This would say that the integers have a largest element. The original is true because adding one always gives a larger integer; its negation is therefore false.

This is different from choosing one fixed m before n is known. No single integer m is larger than every integer n: taking n = m defeats that claim.

Pause and check

A trap to avoid: State the domain, keep exact values and explain why each step is allowed. A correct answer still needs a reason.

Practise and adjust the level

Foundation checks the language; Core applies the method; Stretch asks you to choose or justify an idea. These are levels within this lesson. A session selects six of the nine questions; unused questions allow the level to change. Advanced theory still needs written practice.

Interactive practice loads here. You can also use the complete question set below.

Write a clear argument

Core task. Negate “every integer n satisfies n² > 1”. Then decide whether the original statement is true, using an allowed example.

Planning hint

Change “every” to “there exists”, and negate “greater than 1” exactly. Try zero.

Compare your solution

The negation is “there exists an integer n such that n² ≤ 1”. For n = 0, the square is 0, so this negation is true and the original is false. Values 1 and −1 would also work. Saying n² < 1 alone is not the exact negation: it would omit equality.

Optional extension: two choices in order

Negate “for every integer n, there exists an integer m with m > n”. Explain why the original is true.

Hint

Use the optional bridge above. Describe an n for which every attempted choice of m would fail.

Full solution

The negation is “there exists an integer n such that every integer m satisfies m ≤ n”. The original is true: for any given integer n, choose m = n + 1. It is an integer and is greater than n. The choice of m is allowed to depend on n.

My proof notebook

Write on paper, or keep a draft here. Compare your reasoning with the solution only after a real attempt. The checklist is your own review, not an automatic mark.

All nine practice questions

Prefer paper or have JavaScript switched off? The complete question set, hints and solutions are here. Interactive practice uses these same questions in an order chosen from your answers.

1. Which number is rational but not an integer?

Foundation

  1. 0
  2. 7
  3. 35\frac{3}{5}
  4. −4
Hint

Use the definitions of the two sets.

Answer and reasoning

3/5. 3/5 is a ratio of integers and is not a whole number. The other three are integers.

2. How many elements are in the set {2, 2, 4, 7}?

Foundation

  1. 4
  2. 5
  3. 3
  4. 2
Hint

Repeating an entry does not add an element.

Answer and reasoning

3. The distinct elements are 2, 4 and 7.

3. What disproves a claim about every integer?

Core

  1. Many supporting examples
  2. An example outside the domain
  3. A drawing alone
  4. One allowed counterexample
Hint

Think about what “every” promises.

Answer and reasoning

One allowed counterexample. A single integer violating the claim is enough; a forbidden input says nothing about the claim.

4. Which real input is forbidden for f(x) = 1/(x − 3)?

Core

  1. 3
  2. −3
  3. 0
  4. 1
Hint

A denominator cannot be zero.

Answer and reasoning

3. At x = 3 the denominator vanishes. Each of the other inputs gives a nonzero denominator.

5. A selection contains only integers. Negate “all the selected integers are even”.

Stretch

  1. At least one selected number is odd
  2. All selected numbers are odd
  3. Exactly one is odd
  4. None is odd
Hint

Failure of “all” does not mean “none”.

Answer and reasoning

At least one selected number is odd. For a selection of integers, the original fails as soon as one selected number is odd.

6. A rule assigns each input two different outputs. Is it a function on those inputs?

Stretch

  1. Always
  2. No, each input needs exactly one output
  3. Yes, if both outputs are positive
  4. Yes, if the domain is finite
Hint

Check uniqueness, not just existence.

Answer and reasoning

No, each input needs exactly one output. A function assigns exactly one output to each input. Two distinct outputs violate that condition.

7. Which set contains −4 but not 1/2?

Foundation

  1. The positive integers
  2. The nonnegative integers
  3. The irrational numbers
  4. The integers
Hint

Integers include negative whole numbers.

Answer and reasoning

The integers. −4 is an integer, while 1/2 is not.

8. The negation of “every n has property P” is what?

Core

  1. No n has property P
  2. Every n has property not-P and more
  3. Some n has property P
  4. Some n does not have property P
Hint

One counterexample refutes a universal statement.

Answer and reasoning

Some n does not have property P. The negation changes for every into there exists and negates the property.

9. For every integer n, does there exist an integer m with m>n?

Stretch

  1. Yes: choose m=n+1
  2. No: integers have a largest element
  3. Only for positive n
  4. Only for even n
Hint

Construct m from the given n.

Answer and reasoning

Yes: choose m=n+1. n+1 is an integer strictly larger than n.

Choose your next step

Continue to Arithmetic and exact calculation. If this felt difficult, return to a prerequisite above. Every lesson stays open.

Open my revision list →

Original teaching material · IMOolympiad.com. Send a specific correction through our contact page. Learning progress is optional and stays in this browser.