few_shots: Example:
Problem/activity:
Find the general solution for:
$${\mathrm{cos}\left({\pi\over2}+x\right)=\mathrm{tan}{\pi\over4}}$$


Standard options: 
A. Prove the Pythagorean identity sin^(2)(θ) + cos^(2)(θ) = 1 and use it to find sin(θ), cos(θ),or tan(θ) given sin(θ), cos(θ), or tan(θ) and the quadrant of the angle.
B. Prove the addition and subtraction formulas for sine, cosine, and tangent and use them to solve problems.


Your response:
Thought: An initial step when solving for x in this problem requires the use of the addition formula for cosine on the left side of the equation. Solving this problem does not require use of the Pythagorean identity.
Answer: B

Now, assign the following problem or activity to one or more relevant standards it aligns with.
shot_info: fl_problem_001894

HS
options: Graph functions expressed symbolically and show key features of the graph, by hand in simple cases and using technology for more complicated cases.

Write a function defined by an expression in different but equivalent forms to reveal and explain different properties of the function.

Compare properties of two functions each represented in a different way (algebraically, graphically, numerically in tables, or by verbal descriptions). For example, given a graph of one quadratic function and an algebraic expression for another, say which has the larger maximum.
problem_activity: Task
Many computer applications use very complex mathematical algorithms. The faster the algorithm, the more smoothly the programs run. The running time of an algorithm depends on the total number of steps needed to complete the algorithm. For image processing, the running time of an algorithm increases as the size of the image increases.
For an $n$-by-$n$ image, algorithm 1 has running time given by $p(n) = n^3+3n+1$ and algorithm 2 has running time given by $q(n)=15n^2+5n+4$ (measured in nanoseconds, or $10^{-9}$ seconds ).
Compute the running time for both algorithms for images of size 10-by-10 pixels and 100-by-100 pixels.
Graph both running time polynomials in an appropriate window (or several windows if necessary).
Which algorithm is more efficient?


correct_option_index: 0