Represent natural, integer, rational and real numbers in suitable forms
Represent natural, integer, rational and real numbers in suitable forms.
Area of Study 1
Open a heading to see its content focus, source page and related topic practice. These descriptions are paraphrases of the published requirements.
Recognise natural, integer, rational, real and complex systems and their basic structure.
; bullet 1; p. 58Use membership, intersection, union, complement, subset and power-set ideas.
; bullet 2; p. 58Understand primes, unique prime factorisation and why there are infinitely many primes.
; bullet 3; p. 58Convert rational numbers between fractional and decimal forms.
; bullet 4; p. 58Use propositions, quantifiers, examples and counterexamples with direct proof, contradiction, contrapositive and induction.
; bullet 5; p. 58Construct elementary proofs about divisibility, sequences, series, inequalities and irrational numbers.
; bullet 6; p. 58Represent undirected graphs, including loops and multiple edges, with lists, diagrams and adjacency matrices.
; bullet 1; p. 59Model practical relationships with graphs and consider existence, construction, counting and optimisation questions.
; bullet 2; p. 59Use vertex degree and the handshaking result.
; bullet 3; p. 59Work with simple graphs, isomorphism, subgraphs, connectedness, complete graphs and complements.
; bullet 4; p. 59Recognise bipartite graphs, trees and regular graphs, including graphs from Platonic solids.
; bullet 5; p. 59Prove and apply elementary counting and planarity results.
; bullet 6; p. 59For a connected simple planar graph, relate vertices, faces and edges by v + f − e = 2.
; bullet 6.1; p. 59Derive the complete-graph edge count n(n−1)/2.
; bullet 6.2; p. 59Derive the edge count nr/2 for an r-regular graph with n vertices.
; bullet 6.3; p. 59Establish planarity for trees, Kn with n≤4, and Km,n when m≤2 or n≤2.
; bullet 6.4; p. 59Use equivalent characterisations of when a simple n-vertex graph is a tree.
; bullet 7; p. 59Study trails, circuits, Euler and Hamilton routes and the Königsberg bridge problem.
; bullet 8; p. 59Use propositions, logical connectives, truth values, truth tables and Karnaugh maps.
; bullet 1; p. 59Understand Boolean algebra.
; bullet 2; p. 59Work with binary number representations.
; bullet 3; p. 59Analyse tautologies and argument validity; relate natural-language proofs and Boolean/set/propositional laws.
; bullet 4; p. 59Represent and simplify logical circuits and gates.
; bullet 5; p. 59Describe algorithms using sequence, selection and repetition.
; bullet 6; p. 59Construct and implement basic algorithms expressed in pseudocode.
; bullet 7; p. 59Key knowledge and Key skills are indexed by outcome. Where the official list spans several Areas of Study, the area links are our cross-references. Individual learning targets are concise paraphrases; the source reference identifies the original list. Internal Aspire references are not VCAA codes.
Represent natural, integer, rational and real numbers in suitable forms.
Understand set symbols and operations.
Understand contradiction, contrapositive, counterexamples and the structure of induction.
Know graph terminology, representations, families and structural properties.
Recognise how graphs model problems and how suitable graphs are constructed.
Know elementary graph results and their proofs.
Understand propositions, truth values, tautologies, Karnaugh maps and connections with sets.
Understand what makes an argument valid and how it becomes a proof.
Know Boolean operations and the laws governing them.
Interpret logic gates and the circuits assembled from them.
Understand sequence, decision and repetition in algorithm design.
Recognise the ordered operations described by pseudocode.
Understand algorithms as precise pseudocode instructions across different contexts.
Construct clearly expressed deductive arguments, including induction, across the unit's topics.
State assumptions and definitions, and use examples, counterexamples, diagrams and models precisely.
Define and represent numbers in integer, rational, real and complex settings, and in sequences and series.
Construct graph models for given situations.
Use algorithms to build graph subsets satisfying conditions and solve associated problems.
Develop and explain graph results about planarity, trails and circuits.
Solve graph problems and prove related theorems.
Build truth tables to represent propositions and test their truth.
Write propositional proofs in ordinary language and mathematical notation.
Compute exactly or approximately and interpret pseudocode algorithms in varied mathematical settings.
Outcomes 2 and 3 develop investigation, modelling and technology skills across the relevant areas.