Foundation to VCE • Explore the maths library • Try a free sample
Specialist Mathematics · Unit 1

Algebra, number and structure

Area of Study 1

Study-design content

Open a heading to see its content focus, source page and related topic practice. These descriptions are paraphrases of the published requirements.

Proof and number
  1. Recognise natural, integer, rational, real and complex systems and their basic structure.

    ; bullet 1; p. 58
  2. Use membership, intersection, union, complement, subset and power-set ideas.

    ; bullet 2; p. 58
  3. Understand primes, unique prime factorisation and why there are infinitely many primes.

    ; bullet 3; p. 58
  4. Convert rational numbers between fractional and decimal forms.

    ; bullet 4; p. 58
  5. Use propositions, quantifiers, examples and counterexamples with direct proof, contradiction, contrapositive and induction.

    ; bullet 5; p. 58
  6. Construct elementary proofs about divisibility, sequences, series, inequalities and irrational numbers.

    ; bullet 6; p. 58

Related topic practice

Graph theory
  1. Represent undirected graphs, including loops and multiple edges, with lists, diagrams and adjacency matrices.

    ; bullet 1; p. 59
  2. Model practical relationships with graphs and consider existence, construction, counting and optimisation questions.

    ; bullet 2; p. 59
  3. Use vertex degree and the handshaking result.

    ; bullet 3; p. 59
  4. Work with simple graphs, isomorphism, subgraphs, connectedness, complete graphs and complements.

    ; bullet 4; p. 59
  5. Recognise bipartite graphs, trees and regular graphs, including graphs from Platonic solids.

    ; bullet 5; p. 59
  6. Prove and apply elementary counting and planarity results.

    ; bullet 6; p. 59
    1. For a connected simple planar graph, relate vertices, faces and edges by v + f − e = 2.

      ; bullet 6.1; p. 59
    2. Derive the complete-graph edge count n(n−1)/2.

      ; bullet 6.2; p. 59
    3. Derive the edge count nr/2 for an r-regular graph with n vertices.

      ; bullet 6.3; p. 59
    4. Establish planarity for trees, Kn with n≤4, and Km,n when m≤2 or n≤2.

      ; bullet 6.4; p. 59
  7. Use equivalent characterisations of when a simple n-vertex graph is a tree.

    ; bullet 7; p. 59
  8. Study trails, circuits, Euler and Hamilton routes and the Königsberg bridge problem.

    ; bullet 8; p. 59

Related topic practice

Logic and algorithms
  1. Use propositions, logical connectives, truth values, truth tables and Karnaugh maps.

    ; bullet 1; p. 59
  2. Understand Boolean algebra.

    ; bullet 2; p. 59
  3. Work with binary number representations.

    ; bullet 3; p. 59
  4. Analyse tautologies and argument validity; relate natural-language proofs and Boolean/set/propositional laws.

    ; bullet 4; p. 59
  5. Represent and simplify logical circuits and gates.

    ; bullet 5; p. 59
  6. Describe algorithms using sequence, selection and repetition.

    ; bullet 6; p. 59
  7. Construct and implement basic algorithms expressed in pseudocode.

    ; bullet 7; p. 59

Related topic practice

Related knowledge and skills

Key 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.

Apply these ideas and use technology

Outcomes 2 and 3 develop investigation, modelling and technology skills across the relevant areas.