few_shots: 
Example:
Problem/activity:
Task
 Arrange the fractions in order from least to greatest. Explain your answer with a picture.
 $\frac{1}{5}, \frac{1}{7}, \frac{1}{3} $
 $\frac{2}{5}, \frac{2}{7}, \frac{2}{3} $
 $\frac{5}{6}, \frac{3}{6}, \frac{1}{6} $
 $\frac{5}{12}, \frac{8}{12}, \frac{4}{12} $

Description: 
Explain equivalence of fractions in special cases, and compare fractions by reasoning about their size.
 Grade 3 expectations in this domain are limited to fractions with denominators 2, 3, 4, 6, and 8.

Answer: 
Yes. By arranging the fractions in this problem, students learn to compare fractions by reasoning about their size.

Now, assess whether the following problem or activity aligns with the provided description.

shot_info: im_task_000157_pos_0

3
standard_description: Approximate the probability of a chance event by collecting data on the chance process that produces it and observing its long-run relative frequency, and predict the approximate relative frequency given the probability. For example, when rolling a number cube 600 times, predict that a 3 or 6 would be rolled roughly 200 times, but probably not exactly 200 times.
problem_activity: Problem 1
Using the digits 1, 2, and 3, write an expression to answer the following questions
How many different three-digit numbers can you make when you can use each digit more than once?
How many different three-digit numbers can you make when you can only use each digit once?
Problem 2
Your phone requires you to use five numbers for the code, but you only can use numbers 1-5 for the code.
The first combination you come up with is:
| 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|
You then realize how "insecure" this number might be since anyone could guess it. Figuring this out you wonder, "How many possibilities are there for combinations if I only use each number once?"
Problem 3
You change the phone settings so that you only need a three-digit code to open the lock.
This means you have 5 numbers to choose from and 3 positions to put those numbers in, which is represented by
$$_5P_3$$
. How many different combinations can you get if you have three positions and a choice of five numbers with no repetition?


aligns: no