Structure and calculation

Similar documents
S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

1 Introduction to Modulo 7 Arithmetic

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Garnir Polynomial and their Properties

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Module 2 Motion Instructions

OpenMx Matrices and Operators

8Algebraic UNCORRECTED SAMPLE PAGES. techniques. What you will learn. Australian curriculum. Chapter 8A 8B 8C 8D 8E 8F

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

UNCORRECTED SAMPLE PAGES. Length, area, surface 5area and volume. Online resources. What you will learn

Polygons POLYGONS.

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

UNCORRECTED PAGE PROOFS

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Designing A Concrete Arch Bridge

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Present state Next state Q + M N

EE1000 Project 4 Digital Volt Meter

TOPIC 5: INTEGRATION

Planar Upward Drawings

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

QUESTIONS BEGIN HERE!

Contents: A The mean of continuous data [11.5] B Histograms [11.6] C Cumulative frequency [11.7]

On each of them are the numbers +6, 5, +4, 3, +2, 1. The two dice are rolled. The score is obtained by adding the numbers on the upper faces.

3 a 15a 6 b 21a 5 c 30a 6 d 12a 9. e 125a 8 f 36a 12 g 90a 13 h 56a a 6a b 5 c 3a 4 d 6a 4. e 10a 4 f 8a 2 g 5a 4 h 12a 2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

0.1. Exercise 1: the distances between four points in a graph

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

Decimals DECIMALS.

A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE

Chem 107: Inorganic Chemistry (40720)

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

Constructive Geometric Constraint Solving

QUESTIONS BEGIN HERE!

Trees as operads. Lecture A formalism of trees

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

CS September 2018

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

Chem 104A, Fall 2016, Midterm 1 Key

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

UNCORRECTED SAMPLE PAGES

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Binomials and Pascal s Triangle

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

12. Traffic engineering

Seven-Segment Display Driver

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

C-201 Sheet Bar Measures 1 inch

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Instructions for Section 1

CS 461, Lecture 17. Today s Outline. Example Run

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. Binary Tree

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Practice Test I Bonding and Geometry Name Per

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

MCQ For Geometry. Similarity

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

period (time)? frequency?

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?

Computational Biology, Phylogenetic Trees. Consensus methods

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Properties of Hexagonal Tile local and XYZ-local Series

CS 241 Analysis of Algorithms

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

MULTIPLE-LEVEL LOGIC OPTIMIZATION II

Edexcel Level 3 Advanced GCE in Mathematics (9MA0) Two-year Scheme of Work

Graph Theory. Vertices. Vertices are also known as nodes, points and (in social networks) as actors, agents or players.

Problem solving by search

arxiv: v1 [math.mg] 5 Oct 2015

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Mode switching in modal domain models of overhead lines and underground cables

Transcription:

Strn/sustrn N1 R Bsi ountion ontnt Orr positiv n ngtiv intgrs, imls n rtions; us th symols =,, <, >,, Apply th our oprtions (+, ) inluing orml writtn mthos, to intgrs, imls n simpl rtions (propr n impropr), n mix numrs ll oth positiv n ngtiv; N2 pply th our oprtions (, ), inluing orml writtn mthos, to intgrs, imls n simpl rtions (propr n impropr), n mix numrs ll oth positiv n ngtiv; g unrstn n us pl vlu (.g. whn working with vry lrg or vry smll numrs, mr Strutur n lultion N3 N4 N5 h g h i n whn lulting with imls). Rognis n us rltionships twn oprtions, inluing invrs oprtions (.g. nlltion to simpliy lultions n xprssions); us onvntionl nottion or priority o oprtions, inluing rkts, powrs, roots n riprols. Us th onpts n voulry o prim numrs, tors (ivisors), multipls, ommon tors, ommon multipls highst ommon tor, lowst ommon multipl, prim toristion, inluing using prout nottion n th uniqu toristion thorm. Apply systmti listing strtgis Us positiv intgr powrs

Num N6 n ssoit rl roots (squr, u n highr), rognis powrs o 2, 3, 4, 5; N7 N8 Clult xtly with rtions, Frtions, imls n prntgs N9 N10 N11 N12 N13 N14 N15 Clult with n intrprt stnr orm A x 10 n, whr 1 A < 10 n n is n intgr. Work intrhngly with trminting imls n thir orrsponing rtions (suh s 3.5 n 7/2 or 0.375 or 3/8 ). Intiy n work with rtions in rtio prolms. Intrprt rtions s oprtors n prntgs s oprtors. Us stnr units o mss, lngth, tim, mony n othr msurs (inluing stnr ompoun msurs) using iml quntitis whr pproprit. Estimt nswrs; hk lultions using pproximtion n stimtion, inluing nswrs otin using thnology roun numrs n msurs to n pproprit gr o ury (.g. to spii numr o iml pls or signiint igurs) N16 Us n intrprt lgri nottion, inluing: in pl o

A1 3y in pl o y + y + y n 3 y 2 in pl o, 3 in pl o, 2 in pl o Nottion, voulry n mnipultion A2 A3 A4 A5 g g h i j k l m n o / in pl o oiints writtn s rtions rthr thn s imls rkts. Sustitut numril vlus into ormul n xprssions, inluing sintii ormul. Unrstn n us th onpts n voulry o xprssions, qutions, ormul, inqulitis, trms, n tors. Simpliy n mnipult lgri xprssions ollting lik trms multiplying singl trm ovr rkt tking out ommon tors simpliying xprssions involving sums, prouts n powrs, inluing th lws o inis. Unrstn n us stnr mthmtil ormul; rrrng ormul to hng th sujt. A6

Whr pproprit, intrprt simpl xprssions s untions with inputs n outputs; A7 A8 Work with oorints in ll our qurnts. Plot grphs o qutions tht orrspon to strightlin grphs in th oorint pln; A9 Intiy n intrprt grints o linr untions Algr Grphs A10 A11 A12 grphilly n lgrilly; n intrpts o linr untions grphilly n lgrilly. Rognis, skth n intrprt grphs o linr untions, qurti untions, A13 A14 Plot n intrprt grphs n grphs o non-stnr untions in rl ontxts, to in pproximt solutions to prolms

suh s simpl kinmti prolms involving istn, sp n lrtion. A15 A16 Solv linr qutions in on unknown lgrilly; A17 Solving qutions n inqulitis A18 A19 A20 A21 A22 A23 in pproximt solutions using grph. Gnrt trms o squn rom ithr trm-totrm or position-to-trm rul. Rognis n us squns o tringulr, squr

Squns A24 g n u numrs, simpl rithmti progrssions A25 R1 h i Du xprssions to lult th n th trm o linr squns Chng rly twn rlt stnr units (.g. tim, lngth, r, volum/pity, mss) in numril ontxts n ompoun units (.g. sp, rts o py, pris) in numril ontxts s o hng g R2 R3 R4 R5 R6 R7 R8 Us sl tors, sl igrms n mps. Exprss on quntity s rtion o nothr, whr th rtion is lss thn 1 or grtr thn 1. Us rtio nottion inluing rution to simplst orm. Divi givn quntity into two prts in givn prt:prt or prt:whol rtio; xprss th ivision o quntity into two prts s rtio; pply rtio to rl ontxts n prolms (suh s thos involving onvrsion, omprison, sling, mixing, onntrtions). Exprss multiplitiv rltionship twn two quntitis s rtio or rtion. Unrstn n us proportion s qulity o rtios. Rlt rtios to rtions n to linr untions. Din prntg s numr o prts pr hunr ; intrprt prntgs s rtion

Rtio, proportion n rt Rtio, proportion n rts o hng R9 R10 R11 R12 R13 g or iml, intrprt prntg hngs s rtion or iml n intrprt ths multiplitivly; xprss on quntity s prntg o nothr h ompr two quntitis using prntgs; i work with prntgs grtr thn 100%; j solv prolms involving prntg hng, k inluing prntg inrs/rs l n originl vlu prolms, n simpl intrst inluing in innil m mthmtis. Solv prolms involving irt n invrs proportion, inluing grphil n lgri rprsnttions. Us ompoun units suh s sp, rts o py, unit priing Compr lngths, rs n volums using rtio nottion n sl tors. R14 R15 g

R16 G1 Us onvntionl trms n nottions: points, lins, vrtis, gs, plns, prlll lins, prpniulr lins, right ngls, polygons, rgulr polygons n polygons with rltion n/or rottion symmtris; us th stnr onvntions or llling n rrring to th sis n ngls o tringls; rw igrms rom writtn sription. G2 Apply th proprtis o ngls t point, ngls t point on stright lin, vrtilly opposit ngls; Proprtis n onstrutions G3 G4 G5 G6 unrstn n us ltrnt n orrsponing ngls on prlll lins; riv n us th sum o ngls in tringl us th sum o ngls in tringl (.g. to u n us th ngl sum in ny polygon, n to riv proprtis o rgulr polygons). Driv n pply th proprtis n initions o: spil typs o quriltrls, inluing squr, rtngl, prlllogrm, trpzium, kit n rhomus;n tringls n othr pln igurs using pproprit lngug.

G6 g Gomtry n msurs G7 G8 G9 G10 G11 G12 G13 G14 G15 Intiy, sri n onstrut ongrunt n similr shps, inluing on oorint xs, y onsiring rottion, rltion, trnsltion n nlrgmnt Intiy n pply irl initions n proprtis, inluing: ntr, rius, hor, imtr, irumrn, Solv gomtril prolms on oorint xs. Intiy proprtis o th s, surs, gs n vrtis o: us, uois, prisms, ylinrs, pyrmis, ons n sphrs. intrprt plns n lvtions o 3D shps. Us stnr units o msur n rlt onpts (lngth, r, volum/pity, mss, tim, mony, t.) Msur lin sgmnts n ngls in gomtri igurs, inluing intrprting mps n sl rwings G16 n us o rings. Know n pply ormul to lult: r o tringls, prlllogrms, trpzi; volum o uois n othr right prisms (inluing ylinrs). Know th ormul: irumrn o irl = 2πr = π, r o irl = πr 2 ;

Mnsurtion n lultion G17 G18 G19 lult: primtrs o 2D shps, inluing irls; rs o irls n omposit shps; G20 g G21 G22 G23 Vtors G24 Dsri trnsltions s 2D vtors. G25 P1 Ror sri n nlys th rquny o outoms o proility xprimnts using tls n rquny trs.

Proility Proility P2 P3 P4 P5 P6 P7 P8 Apply is o rnomnss, irnss n qully likly vnts to lult xpt outoms o multipl utur xprimnts. Rlt rltiv xpt rqunis to thortil proility, using pproprit lngug n th 0-1 proility sl. Apply th proprty tht th proilitis o n xhustiv st o outoms sum to on; pply th proprty tht th proilitis o n xhustiv st o mutully xlusiv vnts sum to on. Enumrt sts n omintions o sts systmtilly, using tls, gris, Vnn igrms Construt thortil possiility sps or singl xprimnts with qully likly outoms n us ths to lult thortil proilitis n omin xprimnts with qully likly outoms n us ths to lult thortil proilitis. P9 S1 Intrprt n onstrut tls, hrts n igrms, S2 g h inluing rquny tls, r hrts, pi hrts n pitogrms or tgoril t, vrtil lin hrts or ungroup isrt numril t, n know thir pproprit us.

Sttistis Sttistis S3 S4 g h Intrprt, nlys n ompr th istriutions o t sts rom univrit mpiril istriutions through: - pproprit grphil rprsnttion involving isrt, ontinuous n group t - pproprit msurs o ntrl tnny (min, i mn, j mo n mol lss) k n spr (rng, l inluing onsirtion o outlirs, m n S5 Apply sttistis to sri popultion. Us n intrprt sttr grphs o ivrit t; S6 rognis orrltion

Aitionl ountion ontnt Highr ontnt only inluing us o th prout rul or ounting (i.. i thr r m wys o oing on tsk n or h o ths, thr r n wys o oing nothr tsk, thn th totl numr o wys th two tsks n on is m n wys).

Clult with roots, n with intgr inis n multipls o π; stimt powrs n roots o ny givn positiv numr. n rtionl inis. surs, simpliy sur xprssions involving squrs (.g. 12 = 4 3) = 4 3 = 2 3) n rtionlis nomintors. Chng rurring imls into thir orrsponing rtions n vi vrs. us inqulity nottion to spiy simpl rror intrvls u to truntion or rouning. Apply n intrprt limits o ury, inluing uppr n lowr ouns.

intitis, (inluing thos involving surs n lgri rtions) y: xpning prouts o two inomils torising qurti xprssions o th orm x 2 + x +, inluing th irn o two squrs; or mor thn two inomils torising qurti xprssions o th orm x 2 + x + Know th irn twn n qution n n intity; rgu mthmtilly to show lgri xprssions r quivlnt, n us lgr to support n onstrut rgumnts

n proos. intrprt th rvrs pross s th invrs untion ; intrprt th sussion o two untions s omposit untion (th us o orml untion nottion is xpt). us th orm y = mx + to intiy prlll lins; in th qution o th lin through two givn points, or through on point with givn grint. n prpniulr lins; Intiy n intrprt roots, intrpts, turning points o qurti untions grphilly; u roots lgrilly n turning points y omplting th squr. simpl ui untions, th riprol untion y = 1/x with x 0 (inluing riprol grphs xponntil untions y = k x or positiv vlus o k, n th trigonomtri untions (with rgumnts in grs) y = sin x, y = os x n y = tn x or ngls o ny siz. Skth trnsltions n rltions o givn untion. n xponntil grphs)

Clult or stimt grints o grphs (inluing qurti n othr non-linr grphs) n rs unr grphs (inluing qurti n othr non-linr grphs), n intrprt rsults in ss suh s istn-tim grphs, vloity-tim grphs n grphs in innil ontxts. Rognis n us th qution o irl with ntr t th origin; in th qution o tngnt to irl t givn point. (inluing thos with th unknown on oth sis o th qution); Solv qurti qutions lgrilly y torising in pproximt solutions using grph. Solv two simultnous qutions in two vrils (linr/linr) in pproximt solutions using grph. trnslt simpl situtions or prours into lgri xprssions or ormul; riv n qution (or two simultnous qutions), solv th qution(s) n intrprt th solution. (inluing thos tht rquir rrrngmnt); y omplting th squr n y using th qurti ormul; or linr/qurti) lgrilly; Fin pproximt solutions to qutions numrilly using itrtion Solv linr inqulitis in on vril rprsnt th solution st on numr lin, or two vrils; n qurti inqulitis in on vril; using st nottion n on grph.

Fioni typ squns, qurti squns, n simpl gomtri progrssions ( r n whr n is n intgr, n r is rtionl numr > 0 or sur) n othr squns. n qurti squns. hng rly twn rlt stnr units (.g. tim, lngth, r, volum/pity, mss) in lgri ontxts n ompoun units (.g. sp, rts o py, pris, nsity, prssur) in lgri ontxts.

nsity n prssur. mk links to similrity (inluing trigonomtri rtios) Unrstn tht X is invrsly proportionl to Y is quivlnt to X is proportionl to 1/Y ; intrprt qutions tht sri irt n invrs proportion. Intrprt th grint o stright lin grph s rt o hng; rognis n intrprt grphs tht illustrt irt n invrs proportion. St up, onstrut n Intrprt th grint t point on urv s th instntnous rt o hng; pply th onpts o vrg rt o hng (grints o hors) in numril, lgri n grphil ontxts, n instntnous rt o hng (grints o tngnts) in numril, lgri n grphil ontxts.

solv n intrprt th nswrs in growth n y prolms, inluing ompoun intrst n work with gnrl itrtiv prosss. Us th stnr rulr n ompss onstrutions (prpniulr istor o lin sgmnt, onstruting prpniulr to givn lin rom/t givn point, isting givn ngl); us ths to onstrut givn igurs n solv loi prolms; know tht th prpniulr istn rom point to lin is th shortst istn to th lin. Us th si ongrun ritri or tringls (SSS, SAS, ASA, RHS). Apply ngl ts, tringl ongrun, similrity n proprtis o quriltrls to onjtur n riv rsults out ngls n sis,

inluing Pythgors Thorm n th t tht th s ngls o n isosls tringl r qul, n us known rsults to otin simpl proos. (inluing rtionl n ngtiv sl tors). Dsri th hngs n invrin hiv y omintions o rottions, rltions n trnsltions. tngnt, r, stor n sgmnt. Apply n prov th stnr irl thorms onrning ngls, rii, tngnts n hors, n us thm to prov rlt rsults. Construt n

sur r n volum o sphrs, pyrmis, ons n omposit solis. Clult r lngths, ngls n rs o stors o irls. Apply th onpts o ongrun n similrity, inluing th rltionships twn lngths, Know th ormul or: Pythgors thorm, 2 + 2 = 2, n th trigonomtri rtios, sinθ = opposit/hypotnus, osθ = jnt/hypotnus rs n volums in similr igurs. n tnθ = opposit/jnt; pply thm to in ngls n lngths in right-ngl tringls in two imnsionl igurs Know th xt vlus o sinθ n osθ or θ = 0, 30, 45, 60 n 90 ; know th xt vlu o tnθ or θ = 0, 30, 45 n 60. n, whr possil, gnrl tringls in two n thr imnsionl igurs. Know n pply th sin rul, /sin A = /sin B = C /sin C n osin rul, 2 = 2 + 2-2 os A, to in unknown lngths n ngls. Know n pply Ar = 1/2 sin C to lult th r, sis or ngls o ny tringl. Apply ition n sutrtion o vtors, multiplition o vtors y slr, n igrmmti n olumn rprsnttions o vtors. Us vtors to onstrut gomtri rgumnts n proos.

Unrstn tht mpiril unis smpls tn towrs thortil proility istriutions, with inrsing smpl siz. n tr igrms. Clult th proility o inpnnt n pnnt omin vnts, inluing using tr igrms n othr rprsnttions, n know th unrlying ssumptions. Inr proprtis o popultions or istriutions rom smpl, whilst knowing th limittions o smpling. Clult n intrprt onitionl proilitis through rprsnttion using xpt rqunis with two-wy tls, tr igrms n Vnn igrms. tls n lin grphs or tim sris t

Construt n intrprt igrms or group isrt t n ontinuous t, i.. histogrms with qul n unqul lss intrvls n umultiv rquny grphs, n know thir pproprit us. inluing ox plots qurtils n intr-qurtil rng). n know tht it os not init ustion; rw stimt lins o st it; mk pritions; intrpolt n xtrpolt pprnt trns whilst knowing th ngrs o so oing.