# Edexcel C3 questionWatch

Announcements
Thread starter 4 years ago
#1
In the specification it says:

Preamble
Methods of proof, including proof by contradiction and disproof by
counter-example, are required. At least one question on the paper
will require the use of proof.

I've never seen a proof by contradiction/disproof by counter-example unless I have but didn't realise, can anyone give an example of when it's come up on a paper?
When it says at least one question will require proof

Is that e.g.
http://www.examsolutions.net/a-level...uary/paper.php question 2(a) or 2(b)

http://www.examsolutions.net/a-level...uary/paper.php question 2(a)?

If not which question is it?

Thank you 0
4 years ago
#2
(Original post by IgorYakov)
In the specification it says:

Preamble
Methods of proof, including proof by contradiction and disproof by
counter-example, are required. At least one question on the paper
will require the use of proof.

I've never seen a proof by contradiction/disproof by counter-example unless I have but didn't realise, can anyone give an example of when it's come up on a paper?
When it says at least one question will require proof

Is that e.g.
http://www.examsolutions.net/a-level...uary/paper.php question 2(a) or 2(b)

http://www.examsolutions.net/a-level...uary/paper.php question 2(a)?

If not which question is it?

Thank you Neither of those papers contains a proof-by-contradiction or a counterexample question, as far as I can tell.
The canonical example of a proof by contradiction is Euclid's proof that there are infinitely many primes, which is in the spoiler (but if you want to practise contradiction, you might like to leave this as an exercise, with the hint that "you can create a number which is not divided by any numbers in a given list, by multiplying the list together and adding 1").

Spoiler:
Show
Suppose there were not; suppose that there are only finitely many primes, . Then the number is certainly not divisible by any of those primes, since it is one more than a multiple of any of the primes. But the number itself isn't prime (because it doesn't appear as a for any ; and it doesn't have any prime factors (because no divides it). This is a contradiction, because all positive integers are either prime or composite, and this number is neither of those. Hence there are, in fact, infinitely many primes.

I don't think I've ever seen it on a paper, that I remember (I took A-levels two years ago, so my memory may be faulty). It's quite hard to practise, too.
0
4 years ago
#3
(Original post by IgorYakov)
In the specification it says:

Preamble
Methods of proof, including proof by contradiction and disproof by
counter-example, are required. At least one question on the paper
will require the use of proof.

I've never seen a proof by contradiction/disproof by counter-example unless I have but didn't realise, can anyone give an example of when it's come up on a paper?
When it says at least one question will require proof

Is that e.g.
http://www.examsolutions.net/a-level...uary/paper.php question 2(a) or 2(b)

http://www.examsolutions.net/a-level...uary/paper.php question 2(a)?

If not which question is it?

Thank you A simple proof by contradiction is the proof that is not a rational number.
Proof. Assume that it is i.e. where a and b are integers without a common factor.
Then squaring both sides so is an even number is an even number.
So put then we have are even numbers.
So a and b are both even numbers which contradicts our assumption that they had no common factor. So our initial assumption is incorrect and cannot be expressed as a fraction.
A simple disproof by counterexample is the following.
Prove that the statement is false.
Proof. is not 0
Thread starter 4 years ago
#4
(Original post by Smaug123)
Neither of those papers contains a proof-by-contradiction or a counterexample question, as far as I can tell.
The canonical example of a proof by contradiction is Euclid's proof that there are infinitely many primes, which is in the spoiler (but if you want to practise contradiction, you might like to leave this as an exercise, with the hint that "you can create a number which is not divided by any numbers in a given list, by multiplying the list together and adding 1").

Spoiler:
Show
Suppose there were not; suppose that there are only finitely many primes, . Then the number is certainly not divisible by any of those primes, since it is one more than a multiple of any of the primes. But the number itself isn't prime (because it doesn't appear as a for any ; and it doesn't have any prime factors (because no divides it). This is a contradiction, because all positive integers are either prime or composite, and this number is neither of those. Hence there are, in fact, infinitely many primes.

I don't think I've ever seen it on a paper, that I remember (I took A-levels two years ago, so my memory may be faulty). It's quite hard to practise, too.

(Original post by brianeverit)
A simple proof by contradiction is the proof that is not a rational number.
Proof. Assume that it is i.e. where a and b are integers without a common factor.
Then squaring both sides so is an even number is an even number.
So put then we have are even numbers.
So a and b are both even numbers which contradicts our assumption that they had no common factor. So our initial assumption is incorrect and cannot be expressed as a fraction.
A simple disproof by counterexample is the following.
Prove that the statement is false.
Proof. is not The first one is something I've never seen before but it makes sense, I'm not sure how to practice these and I don't know why it says at least one question will require proofs, I've not seen any at all so I don't know what type of things they expect :/
0
4 years ago
#5
(Original post by IgorYakov)
The first one is something I've never seen before but it makes sense, I'm not sure how to practice these and I don't know why it says at least one question will require proofs, I've not seen any at all so I don't know what type of things they expect :/
Out of all the C3 paper I've ever done I've never seen proof by contradiction, counterexample could be likely but as shown that is straightforward.

Proof isn't even in the C3 textbook so I wouldn't worry about it tbh,
0
Thread starter 4 years ago
#6
(Original post by forsparta)
Out of all the C3 paper I've ever done I've never seen proof by contradiction, counterexample could be likely but as shown that is straightforward.

Proof isn't even in the C3 textbook so I wouldn't worry about it tbh,

Yeah true but it's in the spec and they might throw one in there this year to give some people a shock 0
4 years ago
#7
[QUOTE=IgorYakov;47810512]The first one is something I've never seen before but it makes sense, I'm not sure how to practice these and I don't know why it says at least one question will require proofs, I've not seen any at all so I don't know what type of things they expect :/[/QUOTE

For proof by contradiction we make use of the fact that if you start from something that is true then it is impossible (by mathematically correct steps) to finish up with something that is false.
So if we are asked to prove that A=B, we start by assuming A does not equal B and show that it leads us to a contradicion.
The simplest example I cxan come up with is
Prove that for all values of So we start by assuming that But contradicting our assumption. So our assumption must be incorreect and hence 1
Thread starter 4 years ago
#8
(Original post by brianeverit)

For proof by contradiction we make use of the fact that if you start from something that is true then it is impossible (by mathematically correct steps) to finish up with something that is false.
So if we are asked to prove that A=B, we start by assuming A does not equal B and show that it leads us to a contradicion.
The simplest example I cxan come up with is
Prove that for all values of So we start by assuming that But contradicting our assumption. So our assumption must be incorreect and hence Aah right, thanks a lot 0
4 years ago
#9
(Original post by IgorYakov)
Aah right, thanks a lot No problem.
0
X

new posts
Latest
My Feed

### Oops, nobody has postedin the last few hours.

Why not re-start the conversation?

see more

### See more of what you like onThe Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

### University open days

• University of Birmingham
Wed, 20 Mar '19
• King's College London
Postgraduate Taught Courses - Arts & Sciences - Strand Campus Postgraduate
Wed, 20 Mar '19
• University of East Anglia
All Departments Open 13:00-17:00. Find out more about our diverse range of subject areas and career progression in the Arts & Humanities, Social Sciences, Medicine & Health Sciences, and the Sciences. Postgraduate
Wed, 20 Mar '19

### Poll

Join the discussion

#### Where do you need more help?

Which Uni should I go to? (23)
12.11%
How successful will I become if I take my planned subjects? (16)
8.42%
How happy will I be if I take this career? (43)
22.63%
How do I achieve my dream Uni placement? (28)
14.74%
What should I study to achieve my dream career? (24)
12.63%
How can I be the best version of myself? (56)
29.47%