Quadratics
Surds
Networking
Sequences
Linear Programming
100

In the equation: y = ax², what does a determine in terms of transformation?

How “wide” or “narrow” this shape is

100

What is a number that cannot be written as a fraction called?

Irrational Number

100

What is a network with edges that have numbers on them called?

A weighted network

100

What is a sequence that increases by the same amount each time called?

Arithmetic Sequence

100

In linear programming, what is the shaded region that satisfies all inequalities called?

The feasible region 

200

The x-intercepts of a quadratic are also known as?

The roots (or solutions)

200

Rationalize 1/√3

√3/3

200

What is a path that uses an edge only once called?

A trail

200

The formula tn = a + (n−1)d belongs to which type of sequence?

Arithmetic

200

The point (0, 5) is called this type of intercept 

y-intercept

300

The vertex of y = (x − 3)² + 2 is this point.

(3, 2)

300

Simplify √45 - √5

2√5

300

What is a trail that uses every edge exactly once called?

Euler trail

300

The next term of the sequence: 3, 9, 27, 81, __.

243

300

The inequality y≤−2x+3 shades this side of the line.

Below the line

400

The vertex form of a quadratic is written like this.

y = a(x − h)² + k

400

Combine: 3√6-2√6+√6

2√6

400
What is a network with directions on its edges called?

Direct graph

400

A geometric sequence has t1=18, t3 = 2. Find r.

r = +-1/3

400

If the constraints are x≥2 and 3y≥3, the feasible region is located in this section of the plane.

To the right of x = 2 and above y = 3

500

How does the transformation from y = x² to y = 3(x + 2)² − 7 shift the graph?

Left 2 units, up 7 units, vertically stretched by factor 3

500

Rationalize: 5/(√2+√3)

5√3-5√2

500

In a weighted network, what is the algorithm commonly used to find the shortest path between nodes called?

Dijkstra’s algorithm

500

Solve for n: In the sequence tn=10+4(n−1), the term equals 82.

n=19

500

A factory produces chairs (x) and tables (y). Each chair takes 2 hours, and each table takes 4 hours. You have 40 hours. Write the time constraint.

2x+4y≤40