Prove Infinitely Many Prime Numbers with Contradiction also Concept to Create Edexcel Level A

Edexcel Past Questions: https://www.youtube.com/watch?v=hhbBNCuo4IU&list=PLJ-ma5dJyAqokW84K3LZfIjHExeYKkxLp
#AnilKumar #GCSE #SAT #CubeRoot #Contradiction #EdexcelPastPapers #AnilKumarMath #GlobalMathInstitute #ProofByContradiction
Infinitely Many Prime Numbers: Proof by Using Method of Contradiction
To prove a statement by contradiction you start by assuming it is not true.
Write a negative statement for doing so. Then use logical steps to show that this assumption leads to something impossible (either a contradiction of the assumption, or a contradiction of a fact). Then you can conclude that the assumption was wrong, and so the original statement was true.
NEXT: Mock Test
Prove each of the following by contradiction
Q1. There are infinite prime numbers
Q2. There are no positive integer solutions to the equation x^2-y^2=1
Q3. There is no integer to the equation 8x+6y=1
Q4. If n^2 is even integer then n is also an even integer
Q5. √2 is irrational number.
Q6. Tangent to a circle is at right angle to the