3D Shapes Menu Task 2:

Build as few 3D shapes as possible to satisfy each constraint at least once.

Include diagrams that make your thinking visual.

A. Has an odd number of vertices B. Has two possible bases

C. Has one possible base D. Has an even number of edges

E. Contains at least one triangular F. Has 4 or more faces

face

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 3D shapes?

Describe how and why you built each 3D shape.

Be sure to identify which 3D shapes satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Factoring Polynomials Menu Task:

Build as few polynomials as possible to satisfy each constraint at least once.

Provide both the factored and unfactored form of each polynomial.

A. The polynomial contains a B. The polynomial is of degree 5

Greatest Common Factor

C. One of the factors of the D. The polynomial cannot be factored

polynomial is (2x - 5)

E. The polynomial contains more F. The polynomial is a perfect square

than one variable trinomial

G. The polynomials contains a H. The polynomial can be factored using a

fractional coefficient difference of squares

I. The polynomial does not have a J. The polynomial has exactly 2 factors.
constant term

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 polynomials?

Describe how and why you built each polynomial.

Be sure to identify which polynomials satisfy which constraints.

Created by: Michael Roberts. Collected at: [Link]/menu-math & [Link]/menu-math

 Characteristics of Numbers Menu Task 2:

Build as few numbers as possible to satisfy each constraint at least once.

A. Is double-digit B. Is greater than 10

C. Is less than 50 D. Is even

E. Is 30 when rounded to the nearest F. Is prime

10

G. Is a multiple of 5 J. Has a 3 in the 10s place

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Base-10 Blocks Menu Task:

Build as few numbers as possible to satisfy each constraint at least once.

Sketch or model each number with Base-10 tiles to make your thinking visual.

A. Uses more than 10 Base-10 blocks B. Is less than 50

C. Includes all three types of blocks-- D. Is greater than 100

ones, tens, and hundreds

E. Is modeled with more ten rods F. Uses exactly 7 unit blocks

than unit blocks

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Growing Patterns Menu Task:

Build as few growing patterns as possible to satisfy each constraint at least once.

You can only use red and yellow blocks.

Please show three stages of each pattern.

A. Contains a stage with exactly 16 B. Grows by more than three blocks each
blocks stage

C. Stage 1 has exactly five blocks D. The pattern’s rule has a constant term of
3

E. No stage ever contains an odd F. Every stage has more red blocks than
number of blocks yellow blocks

G. The pattern grows with a linear H. The number “4” appears in the pattern’s
rate rule

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 growing patterns?

Describe how and why you built each growing pattern.

Be sure to identify which growing patterns satisfy which constraints.

Created by: Heather Theijsmeijer. Collected at: [Link]/menu-math & [Link]/menu-math

 Improper and Mixed Fractions Menu Task:

Build as few fractions as possible to satisfy each constraint at least once.

Your fractions can be written in either mixed or improper form.

A. The fraction is equivalent to a B. The mixed form of the fraction contains

whole number exactly 2 wholes

C. Neither form of the fraction D. The fraction is less than 1

contains a “0” digit

E. The fraction is closer to 2 than 3 F. The mixed form has a fractional piece of
one-half

G. The improper form of the fraction H. Both forms of the fraction contain only
cannot be simplified further odd digits

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 fractions?

Describe how and why you built each fraction.

Be sure to identify which fractions satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 Base-10 Blocks Menu Task 2:

Build as few numbers as possible to satisfy each constraint at least once.

Sketch or model each number with Base-10 tiles to make your thinking visual.

A. Can be modeled with less than 15 B. The number is less than 100
Base-10 blocks

C. Contains no one unit blocks D. The number is between 300 and 400

E. Is modeled with more one hundred F. Is modeled with exactly 5 ten rods
blocks than ten rods

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Numbers and Operations Menu Task:

Build as few groups of numbers as possible to satisfy each constraint at least once.

Each group must have at least 4 numbers in it.

A. The product of all the numbers in B. The product of all the numbers in the
the group is an odd number group is greater than 50

C. The sum of all the numbers in the D. The group contains at least one negative
group is an even number number

E. The group of numbers contains F. The group has no repeat numbers

exactly five numbers

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 groups of numbers?

Describe how and why you built each group of numbers.

Be sure to identify which groups of numbers satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Percentages with Fractions and Decimals Menu Task:

Build as few percentages as possible to satisfy each constraint at least once.

(While the numbers you build are percentages, you may need to convert them into fractions
or decimals)

A. The percent is more than 0.68 B. The percentage has two zero digits in it

C. 2 D. The percentage is more than 0.41 but less

The percent is less than 18
10
than
25
E. The percentage contains more odd F. The percentage is less than 50%
digits than even digits

G. The percentage has three digits H. 14

The percentage is a bit more than
25

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 percentages?

Describe how and why you built each percentage.

Be sure to identify which percentages satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 Building 3D Objects Menu Task:

Build as few objects from cubes as possible to satisfy each constraint at least once.
Use linking cubes, sketch your ideas, or use this isometric drawing tool.

A. The object is made from B.

The object has a height of 4 cubes.
an odd number of cubes.

C. The orthographic views from the D. The surface area of the object
left and the right are identical. is about 20 square units.

E. When placed on a desk, all the F. Rotating the object in 90° increments
cubes used to make the object does not change the orthographic views.
touch the desk.

G. The orthographic view from the H. When viewed from the front right, there
front looks like the letter “L”. is at least one hidden cube.

I. The top view takes up more space J. The volume of the object is 5 cubic units.
than the view from the left, right,
or front.

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 objects?

Describe how and why you built each 3D object.

Be sure to identify which objects satisfy which constraints.

Created by: JoAnn Sandford. Collected at: [Link]/menu-math & [Link]/menu-math

 Counting Wheels Menu Task:

Nat went to the bike store and counted 36 wheels. How many bicycles and tricycles did Nat
see if…

A. There were more bicycles than B. The number of bicycles and tricycles is
tricycles the same

C. There were more tricycles than D. The total tricycle wheels and the total
bicycles bicycle wheels are the same.

E. There are twice as many total F. There were more than 7 tricycles
bicycle wheels as tricycle wheels

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 collections?

Describe how and why you built each collection of bikes.

Be sure to identify which collections satisfy which constraints.

Created by: Graham Fletcher. Collected at: [Link]/menu-math & [Link]/menu-math

 Fractions Menu Task 2:

Build as few fractions as possible to satisfy each constraint at least once.

A. 1 B. 1
Equivalent to Is closer to 1 than
4 2
C. Has a denominator greater than 6 D. 1
Is less than
2
E. 3 F. Has a numerator less than 4
Is greater than
4

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 fractions?

Describe how and why you built each fraction.

Be sure to identify which fractions satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Characteristics of Numbers Menu Task 3:

Build as few numbers as possible to satisfy each constraint at least once.

A. Is double-digit B. Is even

C. Is between 30 & 70 D. Is divisible by 3

E. Has an odd digit in the tens place F. Is a multiple of 10

G. Is 50 when rounded to nearest ten H. Is composite

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number

Be sure to identify which numbers satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Sinusoidal Functions Menu Task:

Build as few sinusoidal functions as possible to satisfy each constraint at least once.

Record your functions in the form: 𝑦 = 𝑎 ⋅ 𝑠𝑖𝑛(𝑏(𝑥 − 𝑐) + 𝑑 or 𝑦 = 𝑎 ⋅ 𝑐𝑜𝑠(𝑏(𝑥 − 𝑐) + 𝑑

A. Has a period of less than 2𝜋 B. Goes through the point (0 , 3)

C. Goes through the point (2𝜋, 0) D. Never enters quadrant III

E. Has a maximum at (0 , -2) F. Has a period length of 4𝜋

𝜋
G. Has a phase shift of 2 H. Has a midline of 0

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 sinusoids?

Describe how and why you built each sinusoidal function.

Be sure to identify which sinusoidal functions satisfy which constraints.

Created by: Dylan Kane. Collected at: [Link]/menu-math & [Link]/menu-math

 Currency Menu Task:

Build as few coin collections as possible to satisfy each constraint at least once.

A. The total is worth exactly $1.00 B. The collection contains exactly one
quarter

C. The collection contains more than D. My collection uses three different types
5 total coins of coins

E. The collection contains more F. All the coins in the collection are the
dimes than nickels same type

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 coin collections?

Describe how and why you built each coin collection.

Be sure to identify which coin collections satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Building Quadrilaterals Menu Task:

Build as few quadrilaterals as possible to satisfy each constraint at least once.

Include diagrams that make your thinking visual.

A. Has at least one pair of parallel B. Has a right angle

sides

C. Is a trapezium D. Has opposite sides of equal measure

E. Has at least one obtuse angle F. Can be dissected into two isosceles
triangles

G. Has all sides of equal length H. Has a reflex angle

I. Is a parallelogram J. Has adjacent angles of equal measure

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 quadrilaterals?

Describe how and why you built each quadrilateral.

Be sure to identify which quadrilaterals satisfy which constraints.

Created by: Amie Albrecht. Collected at: [Link]/menu-math & [Link]/menu-math

 3D Shapes Menu Task 3:

Build as few 3D shapes as possible to satisfy each constraint at least once.

Include diagrams to make your thinking visual.

A. Has a curved surface B. Has two possible bases

C. Has a single base D. Has an odd number of edges

E. Has at least 1 rectangular face F. Has no vertices

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 3D shapes?

Describe how and why you built each 3D shape.

Be sure to identify which 3D shapes satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Parabola Menu Task:

Build as few quadratic functions as possible to satisfy each constraint at least once.

Record your functions in vertex-graphing form: 𝑦 = 𝑎(𝑥 − 𝑝)2 + 𝑞

A. Two negative x-intercepts B. Vertex in quadrant II

C. Never enters quadrant III D. Vertex on the y-axis

E. Positive y-intercept F. No x-intercepts

G. Never enter quadrant I H. Has a minimum value

I. Horizontally stretched J. Line of symmetry enters quadrant IV

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 functions?

Describe how and why you built each function.

Be sure to identify which functions satisfy which constraints.

Created by: Nat Banting. Collected at: [Link]/menu-math & [Link]/menu-math

 Linear Equations Menu Task:

Build as few linear equations as possible to satisfy each constraint at least once.

A. The equation has variables on both B. The original equation contains like terms
sides of the equality to collect

C. The solution is an integer D. The right side of the equation is -2

E. The equation has a fractional F. The equation contains no constant terms

coefficient

G. All constants and coefficients are H. The solution is negative

odd numbers

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 linear equations?

Describe how and why you built each linear equation.

Be sure to identify which linear equations satisfy which constraints.

Created by: Carly Hart. Collected at: [Link]/menu-math & [Link]/menu-math

 Logarithmic Functions Menu Task:

Build as few logarithmic functions as possible to satisfy each constraint at least once.

The grids below are to help make your thinking visual.

A. Is always increasing B. Has an x-intercept at -1

C. Never enters quadrant II D. Only in quadrants II and III

E. Vertical asymptote at x = 0 F. Always decreasing

G. Vertical asymptote at x = -3 H. Has a negative y-intercept

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 logarithmic functions?

Describe how and why you built each logarithmic function.

Be sure to identify which logarithmic functions satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Area and Perimeter of Rectangles Menu Task:

Build as few rectangles as possible to satisfy each constraint at least once.

The rectangles do not need to be drawn to scale.

A. The area is more than 50cm2 B. The perimeter is a multiple of 3

C. The area and perimeter are both D. Both side lengths are odd numbers
even numbers

E. One side length is double the other F. The perimeter is more than 24 cm
side length

G. The perimeter is bigger than the H. The area is a multiple of 3

area

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 rectangles?

Describe how and why you built each rectangle.

Be sure to identify which rectangles satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 Times on the Clock Menu Task:

Build as few times as possible to satisfy each constraint at least once.

Sketch a picture of a clock for each time you build.

A. The time shown is after 10:00 and B. The time shown could mean it’s dark
before 12:00 outside.

C. The minute hand is on a quarter D. The hour and minute hands are
hour time overlapping

E. The hour hand is showing 4 F. The time shown is part of the school day

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 times?

Describe how and why you built each time.

Be sure to identify which times satisfy which constraints.

Created by: Kirsten Dyck. Collected at: [Link]/menu-math & [Link]/menu-math

 Electric Circuits Menu Task:

Build as few electric circuits as possible to satisfy each constraint at least once.

(“C” and “F” require you to insert values before giving this to students)
(“G” and “I” require micro:bits)

A. There are exactly two LEDs B. There are more resistors than LEDs

C. A voltmeter reads ___ Volts D. A switch controls all LEDs in the circuit

E. A switch controls exactly one LED F. An ammeter reads ___ Amperes

G. There is automation in the circuit H. There are more LEDs than switches and
resistors combined

I. There is music produced in the J. There is an LED that cannot be turned on

circuit connected to part of the circuit

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 circuits?

Describe how and why you built each circuit.

Be sure to identify which circuits satisfy which constraints.

Created by: Siobhan McComb. Collected at: [Link]/menu-math & [Link]/menu-math

 Place Value Menu Task:

Build as few numbers as possible to satisfy each constraint at least once.

Sketch or model each number you build with Base-10 tiles to make your thinking visual.

A. Uses more than 8 tens B. Is less than 50

C. Has the same number of tens and D. Is greater than 78 but less than 99
ones

E. Has more tens than ones F. Uses exactly 7 ones

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Jean Knapp. Collected at: [Link]/menu-math & [Link]/menu-math

 Systems of Linear Inequalities Menu Task:

Build as few systems of linear inequalities as possible to satisfy each constraint at least once.

Each system must include at least 2 linear inequalities.

A. Entire solution region in quadrant I B. An inequality has a y-intercept of 4

C. All inequalities have positive slopes D. Has an unbounded solution region

E. Contains three inequalities F. The origin is in the solution region

G. Contains only oblique lines H. Contains more dashed lines than solid lines

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 systems?

Describe how and why you built each system.

Be sure to identify which systems satisfy which constraints.

Created by: Nat Banting. Collected at: [Link]/menu-math & [Link]/menu-math

 Patterns in Tables Menu Task:

Build as few tables of values as possible to satisfy each constraint at least once.

Please show at least four ordered pairs in each table

A. The y-value decreases by 2 each B. Every ordered pair has a y-value that’s
time as the x-value increases by 1 larger than its x-value

C. The y-value is halved as the x- D. The ordered pair (0 , 0) is included in the

value increases by 1 table

E. The rate of change is a fraction F. None of the y-values are odd numbers

G. The table has a constant rate of H. The table has a negative y-intercept
change

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 tables?

Describe how and why you built each pattern.

Be sure to identify which tables satisfy which constraints.

Created by: Kit Golan. Collected at: [Link]/menu-math & [Link]/menu-math

 Perfect Squares and Square Roots Menu Task:

Build as few numbers as possible to satisfy each constraint at least once.

A. Is a perfect square B. Its square root is greater than 10

C. Is a multiple of 12 D. Has an odd number of factors

E. Its square root is between 6 and 7 F. Is a perfect cube

G. Its square root is not a whole H. Its square root is odd

number

I. Has five in its prime factorization J. There is an even number of each prime
factor in its prime factorization

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Chris Hunter. Collected at: [Link]/menu-math & [Link]/menu-math

 Polynomial Expressions Menu Task:

Build as few polynomial expressions as possible to satisfy each constraint at least once.

A. The polynomial has no term of B. The polynomial fully simplifies to a

degree 1 binomial

C. The polynomial has a degree of 2 D. The polynomial has more than 3 terms

E. The polynomial has no like terms F. The constant term is a negative number

G. The polynomial has at least one H. The sum of all coefficients is 0

fractional coefficient

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 polynomial expressions?

Describe how and why you built each polynomial expression.

Be sure to identify which polynomial expressions satisfy which constraints.

Created by: Marieta Angjeli. Collected at: [Link]/menu-math & [Link]/menu-math

 Multiplication Sentences Menu Task:

Build as few multiplication sentences as possible to satisfy each constraint at least once.

Each multiplication sentence should look like:

Factor1 x Factor2 = Product

A. The product is a three-digit B. The product has a 4 in it

number

C. The product is between 25 and 45 D. Both factors are multiples of 5

E. The sum of the two factors is more F. One factor is twice as much as the other
than 22 factor

G. The product has a 6 in it H. All digits on both factors and the product
are even

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 multiplication sentences?

Describe how and why you built each multiplication sentence.

Be sure to identify which multiplication sentences satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 3D Shapes Menu Task:

Build as few 3D shapes as possible to satisfy each constraint at least once.

Include diagrams that make your thinking visual. Include all calculations.

A. Has a diameter of 10cm B. Has a side length of 10cm

C. Has a vertical height of 12cm D. Has a volume of 48𝑐𝑚3

E. Has a slant height of 5cm F. Has a surface area of 360𝑐𝑚2

G. Has a volume of 100𝜋𝑐𝑚3 H. Has a slant height of 13cm

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 3D shapes?

Describe how and why you built each 3D shape.

Be sure to identify which 3D shapes satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Building Quadrilaterals Menu Task 2:

Build as few quadrilaterals as possible to satisfy each constraint at least once.

Include diagrams that make your thinking visual.

A. Has diagonals that bisect each B. Only one diagonal is bisected

other

C. Has all sides of equal length D. Does not contain any right angles

E. Has congruent diagonals F. Has perpendicular diagonals

G. Has two pairs of parallel sides H. Has exactly one pair of parallel sides

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 quadrilaterals?

Describe how and why you built each quadrilateral.

Be sure to identify which quadrilaterals satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Polynomial Functions Menu Task:

Build as few polynomial functions as possible to satisfy each constraint at least once.

Record your functions in factored form or expanded form.

A. Has 2 negative x-intercepts B. Never enters Quadrant I

C. Has a positive y-intercept D. Ends in Quadrant I

E. Opens down F. Three x-intercepts

G. Has an x-intercept with a H. Is symmetrical

multiplicity of 2

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 polynomial functions?

Describe how and why you built each polynomial function.

Be sure to identify which polynomial functions satisfy which constraints.

Created by: Stephanie Gower. Collected at: [Link]/menu-math & [Link]/menu-math

 3D Vectors Menu Task:

Build as few 3D vectors as possible to satisfy each constraint at least once.

Record your vectors in the form (x, y, z).

A. A vector has a magnitude of 13 B. One vector is perpendicular to another

vector

C. One vector is perpendicular to two D. Two vectors are separated by an angle

others between 62 and 70 degrees

E. Two vectors with identical F. Three vectors form a right triangle

magnitude

G. Three vectors whose sum is (-1,- H.

1,7) Two vectors where

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 vectors?

Describe how and why you built each vector.

Be sure to identify which vectors satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Graphs Menu Task:

Build as few graphs as possible to satisfy each constraint at least once.

Also determine the equation that corresponds to each graph.

A. Contains (-1, 1) B. Domain is restricted

C. Range is {𝑦𝜖ℜ|𝑦 ≥ 1} D. Is not a function

E. Is a function F. Contains (2,7) & (-4,7)

G. Contains (5,-4) & (5,4) H. Domain is {𝑥𝜖ℜ}

I. Has more x-intercepts than y- J. Never enters Quadrant II

intercepts

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 [insert type of object to be built]?

Describe how and why you built each graph.

Be sure to identify which graphs satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Multiplying Fractions Menu Task:

Build as few fraction multiplication statements as possible to satisfy each constraint at least
once.

Each addition must contain exactly two fractions.

Each statement should look like: [[

]
]
✕ #

#
$

$
= 𝑝𝑟𝑜𝑑𝑢𝑐𝑡

A. Both fractions have different B. Both fractions are equivalent

denominators

C. At least one of the fractions is D. The product of the fractions is less than
greater than 1 one-half

E. No digit is repeated in the F. The product of the fractions cannot be

statement or the product reduced

G. The product of the fractions is a H. The denominator of one fraction is a

whole number factor of the other denominator

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 fraction multiplication statements?

Describe how and why you built each statement.

Be sure to identify which statements satisfy which constraints.

Created by: Kirsten Dyck and David Petro. Collected at: [Link]/menu-math & [Link]/menu-
math
 Number and Operations Menu Task 2:

Build as few multiplication facts as possible to satisfy each constraint at least once.

Each multiplication fact should contain two numbers.

A. The product is less than 25 B. The difference between the factors is 2

C. The product is a perfect square D. It contains one even factor and one odd
factor

E. The sum of the factors is less than F. One of the factors is greater than 6
10

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 multiplication facts?

Describe how and why you built each multiplication fact.

Be sure to identify which multiplication facts satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Primary Trigonometry Menu Task:

Build as few right-angled triangles as possible to satisfy each constraint at least once.

Make sure to label your triangles to ensure you satisfy each condition.

A. tan θ = 1 B. Has an angle that is less than 10°

C. The sides of the triangle form a D. Has a side length that is a perfect square
Pythagorean Triple

E. Area > 50 square units F. Perimeter < 30 units

G. cos θ = .8 H. Both acute angles are even

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 triangles?

Describe how and why you built each right-angled triangle.

Be sure to identify which right-angled triangles satisfy which constraints.

Created by: Kevin Pinno. Collected at: [Link]/menu-math & [Link]/menu-math

 Radical Equations Menu Task:

Build as few radical equations as possible to satisfy each constraint at least once.

A. The equation has a radical B. The radicand contains a binomial

expression on each side

C. The original equation contains a D. At least one radical has a non-one

constant of 4 coefficient

E. The equation only has one radical F. The original equation contains like terms
to combine

G. The solution is negative H. The equation has no solution

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 [insert type of object to be built]?

Describe how and why you built each radical equation.

Be sure to identify which radical equations satisfy which constraints.

Created by: Lena Miller. Collected at: [Link]/menu-math & [Link]/menu-math

 Angles in Standard Position Menu Task:

Build as few angles in standard position as possible to satisfy each constraint at least once.

Use the unit circles below to make your thinking visual.

A. The terminal arm is in quadrant IV B. The reference angle is less than 30o

C. sin(θ) > 0 D. The terminal arm is on an axis

E. The reference angle cannot be F. sin(θ) > cos(θ)

found in a special triangle

G. cos(θ) is a rational number H. tan(θ) < 0

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 angles in standard position?

Describe how and why you built each angle.

Be sure to identify which angles satisfy which constraints.

Created by: Meghan Donnelly. Collected at: [Link]/menu-math & [Link]/menu-math

 Linear Functions Menu Task:

Build as few linear functions as possible to satisfy each constraint at least once.

Record your functions in this form: 𝑦 = 𝑎𝑥 + 𝑏

A. Has a positive slope B. Has a positive y-intercept

C. Has a negative x-intercept D. Never enters the first quadrant

E. Goes through the point (2, -3) F. Has a negative vertical intercept

G. Has a negative slope H. Goes through the point (4, 0)

I. Never enters the third quadrant J. Has a slope less than 1

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 linear functions ?

Describe how and why you built each linear function.

Be sure to identify which linear functions satisfy which constraints.

Created by: Amie Albrecht. Collected at: [Link]/menu-math & [Link]/menu-math

 Adding Fractions Menu Task:

Build as few fraction addition statements as possible to satisfy each constraint at least once.

Each addition must contain exactly two fractions.

Each statement should look like: [[

]
]
+ #

#
$

$
= 𝑠𝑢𝑚

A. Both fractions have different B. Both fractions are equivalent

denominators

C. At least one of the fractions is D. The denominator of one fraction is a

greater than 1 factor of the other

E. The sum of the fractions is greater F. The sum of the fractions is less than 1
than 1

G. The sum of the fractions is a whole H. The sum of the fractions is less than one-
number half

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 fraction addition statements?

Describe how and why you built each statement.

Be sure to identify which statements satisfy which constraints.

Created by: David Petro. Collected at: [Link]/menu-math & [Link]/menu-math

 Shapes Menu Task:

Build as few shapes as possible to satisfy each constraint at least once.

Include diagrams that make your thinking visual.

A. Has three angles B. Has four sides

C. Has a perimeter of 20cm D. Is a polygon

E. Has all equal sides F. Has an area of 16cm2

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 shapes?

Describe how and why you built each shape.

Be sure to identify which shape satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Fractions and Decimals Menu Task:

Build as few fractions as possible to satisfy each constraint at least once.

(While the numbers you build are fractions, you may need to convert them into decimals)

A. The decimals form is closer to B. The fraction form has a prime

1.00 than to 0.5 denominator

C. The decimal form contains a 3 D. The decimal form does not contain a 5

E. The fraction form is fully F. The decimal form is less than 0.25
simplified

G. The decimal form is a terminating H. The fraction form has a numerator greater
decimal than 20

I. The decimal form is greater than J. The decimal form is between 0.25 and
1.1 0.66

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 fractions?

Describe how and why you built each fraction.

Be sure to identify which fractions satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 Two-Digit Addition Menu Task:

Build as few two-digit addition statements as possible to satisfy each constraint at least once.

Each statement should look like:

_ _ + _ _ = _ _ or __+__=___

(Addend 1 + Addend 2 = Sum)

A. The sum is a three-digit number B. One addend can be made by skip

counting by 3s

C. The sum has a 4 in it D. The sum is an odd number

E. One of the addends is larger than F. One addend is 20 more than the other
65

G. Both addends are made of only H. The sum is closer to 50 than 100
even digits

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 addition statements?

Describe how and why you built each addition statement.

Be sure to identify which addition statements satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 Pythagorean Triples Menu Task:

Build as few Pythagorean triples as possible to satisfy each constraint at least once.

All three side lengths must be integers.

A. All three sides are even numbers B. The hypotenuse is exactly one more than
another side

C. The three sides form an arithmetic D. All three side lengths are two-digit
progression numbers

E. The hypotenuse is 85 F. Two side lengths are primes

G. Two side lengths have lengths that H. The perimeter is between 50 and 100
end in 1

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 Pythagorean triples?

Describe how and why you built each Pythagorean triple.

Be sure to identify which Pythagorean triples satisfy which constraints.

Created by: Chris Smith. Collected at: [Link]/menu-math & [Link]/menu-math

 Square Roots Menu Task:

Build as few square root numbers as possible to satisfy each constraint at least once.

Each of your numbers should be of the form “√⃞”

When you’ve satisfied every constraint, place the set of square root numbers on the number
line below

A. The square root number is a B. The number under the root has only odd
natural number digits

C. The square root number is larger D. The number under the square root is a
than 4 but less than 5 single digit number

E. The number under the square root F. The number under the square root is a
is not a perfect square but is very two-digit non-perfect square
close

G. The number under the square root H. The number under the square root is 10
is a three-digit number away from being a perfect square

I. The square root number is about J. The square root number is larger than 7
halfway between benchmarks but less than 8

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 square root numbers?

Describe how and why you built each square root number.
Be sure to identify which square root numbers satisfy which constraints.

Created by: Kirsten Dyck. Collected at: [Link]/menu-math & [Link]/menu-math

 Fractions Menu Task:

Build as few fractions as possible to satisfy each constraint at least once.

A. Is less than 1 B. Has a prime denominator

C. Has a denominator greater than 10 D. Has a composite numerator

E. Is fully simplified F. 2
Is greater than
3
G. Can be rewritten as a terminating H. Has a numerator greater than 20
decimal

I. Has a numerator greater than its J. 1

denominator Is equivalent to
2

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 fractions?

Describe how and why you built each fraction.

Be sure to identify which fractions satisfy which constraints.

Created by: Josh Giesbrecht. Collected at: [Link]/menu-math & [Link]/menu-math

 Prime Factors Menu Task:

Build as few numbers as possible to satisfy each constraint at least once.

Write each number as a product of prime factors

Example: 12 = 2 x 3 x 2

A. The prime factors are twin primes B. The number is greater than 55

C. Has at least three different prime D. One of the prime factors is cubed
factors

E. No prime factor is repeated F. Has a prime factor greater than 11

G. One of the prime factors is squared H. The prime factors are all also factors of
72

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Larissa Stern. Collected at: [Link]/menu-math & [Link]/menu-math

 Characteristics of Numbers Menu Task:

Build as few numbers as possible to satisfy each constraint at least once.

A. Is even B. Is a multiple of 3

C. Is a perfect cube D. Is prime

E. Is a factor of 72 F. Is a perfect square

G. Has exactly 4 factors H. Is odd

I. Is composite J. Has both 4 and 6 as factors

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Chris Hunter. Collected at: [Link]/menu-math & [Link]/menu-math

 Building Triangles Menu Task 2:

Build as few triangles as possible to satisfy each constraint at least once.

Any three distinct points can be joined to form a triangle.

A. Has a right angle B. Two sides has the same length

C. The perimeter is greater than 12 D. All sides are odd-numbered lengths

E. All sides are the same length F. Has an obtuse angle

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 triangles?

Describe how and why you built each triangle.

Be sure to identify which triangles satisfy which constraints.

Created by: Chad Williams. Collected at: [Link]/menu-math & [Link]/menu-math

 Building Triangles Menu Task:

Build as few triangles as possible to satisfy each constraint at least once.

Any three distinct points can be joined to form a triangle. Build your triangles on a coordinate
plane.

A. Is an isosceles triangle B. Has a vertex in quadrant III

C. Is a right triangle D. Has a vertex at (1 , 3)

E. Has a side through (-2 , 1) F. Is a scalene triangle

G. Enters all four quadrants H. Has a 45 degree angle

I. Has a vertex on the x-axis J. Is entirely in the first quadrant

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 triangles?

Describe how and why you built each triangle.

Be sure to identify which triangles satisfy which constraints.

Created by: Amie Albrecht. Collected at: [Link]/menu-math & [Link]/menu-math

 Division with Remainders Menu Task:

Build as few division statements as possible to satisfy each constraint at least once.

Each of your statements should look like this:

Dividend ÷ Divisor = Quotient + Remainder

A. The statement has a remainder of 3 B. The dividend is even

C. The quotient is greater than 100 D. The divisor is a multiple of 4

E. The remainder is one less than the F. The statement has a remainder of zero
divisor

G. Both the dividend and the divisor H. The dividend is greater than 150
end in a 4

I. The divisor is a double-digit J. The statement contains only odd digits

number

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 division statements?

Describe how and why you built each division statement.

Be sure to identify which division statements satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math
 Order of Operations Menu Task:

Build as few expressions as possible to satisfy each constraint at least once.

Use whichever numbers you wish and the operations along with addition, subtraction,
multiplication, division, and/or exponentiation.

A. Contains only the numbers 2, 3, 4 B. Contains only the operators +, - and x

&5

C. Uses division but still evaluates to D. Contains an exponent and two different
an integer operators

E. Evaluates to 54 F. Has two sets of necessary brackets

G. Only uses double digit numbers H. Evaluates to -4

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 expressions?

Describe how and why you built each expression.

Be sure to identify which expressions satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Integers Menu Task:

Build as few integers as possible to satisfy each constraint at least once.

A. Is double digit B. Is even

C. Is between -30 and -65 D. Is divisible by 3

E. Is still positive even after F. Becomes -20 when rounded to the nearest
subtracting 13 10s place

G. Is a multiple of 10 H. Has the same digit in the 1s and 10s place

I. Is no more than 20 away from zero J. Is less than zero

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 integers?

Describe how and why you built each integer.

Be sure to identify which integers satisfy which constraints.

Created by: Jayne Breton. Collected at: [Link]/menu-math & [Link]/menu-math

 Parent Functions Menu Task:

Use as few of the nine types of parent functions as possible to satisfy each constraint at least
once.

The nine types include: linear, quadratic, exponential, square root, rational (y = 1/x), absolute
value, sine, cosine, and tangent.

A. Domain of {𝑥 𝜖 ℜ} B. Even symmetry

C. As 𝑥 → ∞, 𝑦 → ∞ D. No 𝑥-intercepts

E. 𝑦-intercept of (0, 1) F. Discontinuous

G. 𝑥-intercept of (0, 0) H. Range of {𝑦 𝜖 ℜ | − 1 ≤ 𝑦 ≤ 1}

I. Range of {𝑦 𝜖 ℜ | 𝑦 ≥ 0} J. Increasing on (−∞, ∞)

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 parent functions?

Describe how and why you built each parent function.

Be sure to identify which parent functions satisfy which constraints.

Created by: Meghan Donnelly. Collected at: [Link]/menu-math & [Link]/menu-math

 Faces, Bases, and Surface Area Menu Task:

Build as few solids as possible to satisfy each constraint at least once.

Include diagrams to make your thinking visual.

A. One face makes up more than half B. Has a total surface area of 10cm3
of the total surface area of the solid

C. All sides are flat faces D. Has a circular base

E. Faces are all rectangles F. The total number of all bases and faces
is greater than 6

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 solids?

Describe how and why you built each solid.

Be sure to identify which solids satisfy which constraints.

Created by: Seth Ellis. Collected at: [Link]/menu-math & [Link]/menu-math

 Periodic Table Menu Task:

State as few elements as possible to satisfy each constraint at least once.

A. Is a metal B. Is a gas at room temperature

C. Has an atomic number greater than D. Has three energy levels that house
25 electrons

E. Is not conductive F. Is a halogen

G. Is a solid at room temperature H. Exists on Earth’s moon

I. Has fewer than four neutrons J. Is used in everyday objects

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 elements?

Describe how and why you used each element.

Be sure to identify which elements satisfy which constraints.

Created by: Siobhan McComb. Collected at: [Link]/menu-math & [Link]/menu-math

 Calculus Functions Menu Task:

Build as few functions as possible to satisfy each constraint at least once.

A. Has a negative y-intercept B. Has a negative slope at x=2

C. Has a local maximum in quadrant D. Has a positive definite integral between

II x=1 and x=3

E. Is concave up at x=0 F. Has a turning point on the x-axis

G. Has a local minimum in quadrant H. Has a degree greater than 2

IV

I. Is increasing when x < -2 J. Is not continuous across its domain

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 functions?

Describe how and why you built each function.

Be sure to identify which functions satisfy which constraints.

Created by: Erick Lee. Collected at: [Link]/menu-math & [Link]/menu-math

 Decimal Operations Menu Task:

Build as few pairs of decimal numbers as possible to satisfy each constraint at least once.

A. The sum of the two decimal B. The product of the two decimal numbers
numbers is a whole number. is less than 2.

C. Both decimal numbers have a “3” D. Both decimal numbers are larger than 10.
in the hundredths position.

E. The quotient of the two decimal F. All digits used in both numbers are even.
numbers is a whole number.

G. The difference of the two decimal H. When rounded to the nearest whole
numbers is greater than 5. number, both decimal numbers are even.

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 pairs of decimal numbers?

Describe how and why you built each pair of decimal numbers.
Be sure to identify which pair satisfies which constraints.

Created by: Dave Martin. Collected at: [Link]/menu-math & [Link]/menu-math

 Calculus Functions 2 Menu Task:

Build as few functions as possible to satisfy each constraint at least once.

A. Has a limit that does not exist at B. Fails to meet the hypothesis of the IVT
x=1 but does satisfy the conclusion

C. Fails to meet the hypothesis of the D. Limit exists at x=3 but the function is
EVT but does satisfy the undefined
conclusion

E. Has a maximum value when x=3 F. Has a removable discontinuity

G. Has an infinite discontinuity H. Has an x-intercept when x=3

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 functions?

Describe how and why you built each function.

Be sure to identify which functions satisfy which constraints.

Created by: Jeremy Sundeen. Collected at: [Link]/menu-math & [Link]/menu-math

 Line and Point Symmetry Menu Task:

Build as few shapes as possible to satisfy each constraint at least once.

Draw your shapes on separate pieces of (patty) paper.

A. Has no lines of symmetry B. Has exactly 1 line of symmetry

C. Has at least 2 lines of symmetry D. Has a line of symmetry along y=7

E. Has point symmetry at (2,7) F. Has a like of symmetry along y=x

G. Has a line of symmetry along x=2 H. Has a like of symmetry along x=7

I. Does not have point symmetry J. Has both line and point symmetry

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 shapes?

Describe how and why you built each shape.

Be sure to identify which shapes satisfy which constraints.

Created by: Javier Cabezas. Collected at: [Link]/menu-math & [Link]/menu-math

 Compound Inequalities Menu Task:

Build as few compound inequalities as possible to satisfy each constraint at least once.

Provide a graph alongside each inequality statement

A. The graph has arrows but there are B. Uses the conjunction “OR” to connect the
no real number solutions inequalities

C. The graph contains hollow dots D. All the solutions are negative numbers

E. All the arrows on the graph point F. Every solution is between -5 and 5
in different directions

G. Both inequalities include zero as a H. The number 10 is a solution to one

solution inequality but not another

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 compound inequalities?

Describe how and why you built each compound inequality.

Be sure to identify which compound inequalities satisfy which constraints.

Created by: Seth Ellis. Collected at: [Link]/menu-math & [Link]/menu-math

 Slope Menu Task:

Build as few ordered pairs as possible to satisfy each constraint at least once.

You can connect any pair of points to satisfy the constraints.

A. The slope between the points is B. The slope between the points is less than
2 1
perpendicular to − 3

C. The slope between the points is D. One of the points is (-2 , -5)
not positive

E. The slope between the points is an F. The slope between the points has a
integer denominator of 3

G. Both points are in the second H. Both points are on the axes
quadrant

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 ordered pairs?

Describe how and why you built each ordered pair.

Be sure to identify which pairs of points satisfy which constraints.

Created by: Nat Banting. Collected at: [Link]/menu-math & [Link]/menu-math

 Exponential Functions Menu Task:

Build as few exponential functions as possible to satisfy each constraint at least once.

A. Has one negative x-intercept B. Has a positive y-intercept

C. No x-intercept D. Never enters quadrant III

E. Is always increasing F. Never enters quadrant I

G. Goes through the point (2 , -3) H. Has a base value greater than 1

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 exponential functions?

Describe how and why you built each exponential function.

Be sure to identify which exponential functions satisfy which constraints.

Created by: Sherri Walker & Tania Asselstine. Collected at: [Link]/menu-math &
[Link]/menu-math
 Data Sets Menu Task:

Build as few data sets as possible to satisfy each constraint at least once.

Each data set needs to contain at least six values.

A. Has a mean value of exactly 3 B. Has a median greater than its mean

C. Has no single mode D. Is skewed left

E. Has a median less than its mode F. Has a mode of 5.5

G. Has an odd sample size H. Has a standard deviation greater than 5

I. Has a median that does not appear J. Has a median of 4

in the data set

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 data sets?

Describe how and why you built each data set.

Be sure to identify which data sets satisfy which constraints.

Created by: Josh Giesbrecht. Collected at: [Link]/menu-math & [Link]/menu-math

 Two-Digit Sums Menu Task:

Build as few addition expressions as possible to satisfy each constraint at least once.

+ = Su
m
A. The sum is less than 100 B. The sum of the ones digits is 12

C. The sum is greater than 50 D. One addend is half of the other

E. Both addends are even F. You can skip count by 3 and 4 to each
addend

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 sums?

Describe how and why you built each sum.

Be sure to identify which sums satisfy which constraints.

Created by: Graham Fletcher. Collected at: [Link]/menu-math & [Link]/menu-math

 Sinusoidal Functions Menu Task 2:

Build as few sinusoidal functions as possible to satisfy each constraint at least once.

Include a sketch of each graph to make your thinking visual.

A. Never touches the x-axis B. Has a positive y-intercept

C. The amplitude is greater than the D. Has a negative “a” value

vertical displacement

E. Has exactly 1 zero on the interval F. Has a non-zero horizontal shift

[0,4]

G. Has a period length greater than2𝜋 H. The range includes negative and positive
y-values

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 functions?

Describe how and why you built each function.

Be sure to identify which functions satisfy which constraints.

Created by: Dave Martin. Collected at: [Link]/menu-math & [Link]/menu-math

 Solutions to Linear Systems Menu Task:

Build as few systems of linear functions as possible to satisfy each constraint at least once.

Use graphing technology.

A. The solution is in the second B. One equation in the system is x = -2

quadrant

C. The linear equations have identical D. Both linear equations have positive
but oppositely-signed y-intercepts. slopes

E. The y-value of the solution is less F. The x-coordinate of the solution is twice
than y = -5 that of the y-coordinate of the solution

G. Two lines are equally steep but in H. The solution lies on an axis
opposite directions

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 systems?

Describe how and why you built each system.

Be sure to identify which systems satisfy which constraints.

Created by: Heather Theijsmeijer. Collected at: [Link]/menu-math & [Link]/menu-math

 Place Value of 4-Digit Numbers Menu Task:

Build as few 4-digit numbers as possible to satisfy each constraint at least once.

“0723” is not a 4-digit number but “7320” is a 4-digit number.

A. When you round the number to the nearest B. The number is even
ten, there’s a “4” in the 10s place

C. The number is between 3000 and 7000 D. The hundreds digit is greater
than the thousands digit

E. The number has an odd digit in the tens F. The number is a multiple of 10
place

G. The number has an identical thousands H. The number has a thousands

digit and ones digit digit that rounds to an “8”

I. When you round the number to the nearest J. You say the word “five” when
hundred, there’s a “3” in the 100s place you read the number aloud

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Kirsten Dyck.. Collected at: [Link]/menu-math & [Link]/menu-math

 Geometry on the Plane Menu Task:

Build as few ordered pairs as possible to satisfy each constraint at least once.

Include any calculations to justify your explanations and/or graphs

A. The slope between two of the B. The distance between two of the points is
points is positive between 10 and 15 units

C. The midpoint between two of the D. Three of the points form a right triangle
points is in Quadrant III

E. Four of the points make a F. Three points form a triangle whose

parallelogram with no right angles altitude contains the point (1,7)

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 ordered pairs?

Describe how and why you built each ordered pair.

Be sure to identify which ordered pairs satisfy which constraints.

Created by: Alli Etherington. Collected at: [Link]/menu-math & [Link]/menu-math

 Rational Functions Menu Task:

Build as few rational functions as possible to satisfy each constraint at least once.

A. Has a hole at x = 4 B. Has a double root at x = -3

C. Vertical asymptote at x = -2 D. Has a point of inflection at (1 , 0)

E. Has a horizontal asymptote y = 2 F. Has an oblique asymptote at y = x + 2

G. Has a single root at the origin H. Has a y-intercept at -4

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 rational functions?

Describe how and why you built each rational function.

Be sure to identify which rational functions satisfy which constraints.

Created by: Mary Bourassa. Collected at: [Link]/menu-math & [Link]/menu-math

 Divisibility Menu Task:

Build as few numbers as possible to satisfy each constraint at least once.

A. The number is odd B. The number has a prime factor greater

than 7

C. The number is divisible by 4 D. The number is greater than 100

E. The number contains a “0” digit F. The number is divisible by 3

G. The number is less than 85 H. The number is not divisible by 6

I. The number is divisible by both 3 J. The number contains two consecutive

and 5 digits. (For example: 523, 532, 672, etc.)

Which constraints pair nicely?

Which constraints cannot be paired?
Is it possible to solve in 2, 3, or 4 numbers?

Describe how and why you built each number.

Be sure to identify which numbers satisfy which constraints.

Created by: Maegan Giroux & Kyle Webb. Collected at: [Link]/menu-math & [Link]/menu-
math