Back to the full dot-point answer
ScotlandMathsQuick questions
Geometry, Proof and Systems of Equations
Quick questions on Number theory and methods of proof: direct, contradiction, contrapositive and the Euclidean algorithm - SQA Advanced Higher Maths
3short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is a counterexample with no working?Show answer
State the value and show it fails the claim; an unjustified number earns nothing.
What is q1?Show answer
Disprove: is prime for every positive integer . [2 marks]
What is q2?Show answer
Find by the Euclidean algorithm. [2 marks]
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.