AlgMap-2.1 Factorise \({@n@}\) into primes:
Write your answer as powers of primes, e.g. \(p_1^{n_1}\times\cdots\).
[[input:ans]] [[validation:ans]]

]]> To factorise a number, \(n\) into primes the best trick is to divide by the smallest prime, \(2\). If the resulting value, \(m\), is an integer then we write it as \(2 \cdot m\). If not, then we try the next largest prime, \(3\), and repeat the process until we have obtained a product of the form \[p_1 \cdot p_2 \cdot ... \cdot 1, \] where p are prime numbers. In this particular example: \[ {@n@} = {@ta@}. \]

]]> 1 0.1 0 n:ev(2^((rand(2)+2))*3^(rand(2)+1)*5^(rand(2))*7^(rand(2)),simp); ta:factor(n); [[feedback:prt1]]

]]> {@n@} = {@ta@} 0 0 0 *10 dot 1 i cos-1 lang [ 0 {"author":[{"firstName":"Tony","lastName":"Barnard","institution":"","year":"1999"}],"language":["en"],"isPartOf":"STACK Library - Algebra Refresher","license":"cc-sa-4.0","additional":{"UoE":{"Notes":"This is automatically generated metadata."}},"freeform":{}} ans algebraic ta 15 1 0 0 1 1 1 1 1 prt1 1.0000000 0 1 0 EqualComAss ans ta 0 = 1.0000000 -1 1-0-T = 0.0000000 1 1-0-F 1 AlgEquiv ans n 0 = 0.0000000 -1 1-1-T Your answer is equivalent to the correct answer but not fully factored.

]]> = 0.0000000 -1 1-1-F 675382660 1779049407 302075276 4640885 1561867926 528490662 1046956652 1024708417 1630812714 971026801 1 ans ta prt1 1.0000000 0.0000000 1-0-T 2 ans n prt1 0.0000000 0.1000000 1-1-T