-
Notifications
You must be signed in to change notification settings - Fork 0
/
N4_template.tex
36 lines (21 loc) · 1.1 KB
/
N4_template.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
\setvseed{\VAR{seed}}
\skillheader{N4}
\begin{enumerate}
\item Find $\VAR{listing_prob}$ \VAR{listing_prob_wording}
\vfill
\begin{ansenv}
(Some) multiples of $\VAR{listing_a}$: $\VAR{listing_list_a}$\\
(Some) multiples of $\VAR{listing_b}$: $\VAR{listing_list_b}$\\
The smallest nonzero multiple appearing in both lists simultaneously is $\VAR{listing_lcm}$, so $\VAR{listing_prob} = \VAR{listing_lcm}$
\end{ansenv}
\vfill
\item Find $\VAR{factorization_prob}$ using the prime factorization method. You must show your work before giving the final answer.
\vfill
\begin{ansenv}
Prime factorization of $\VAR{factorization_a}$: $\VAR{factorization_mult_a}$\\
Prime factorization of $\VAR{factorization_b}$: $\VAR{factorization_mult_b}$\\
Multiplying together all prime factors of $\VAR{factorization_a}$ and $\VAR{factorization_b}$, then removing the overlapping prime factors gives us $\VAR{factorization_mult_lcm}$, so $\VAR{factorization_prob} = \VAR{factorization_lcm}$
\end{ansenv}
\vfill
\end{enumerate}
\trueemptypage