[LON-CAPA-users] prime factorization

[Jay Sullivan]

------=_Part_19896_17307145.1206017278995
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

If you tell students to enter '1' into un-needed boxes they will not
necessarily know how many non-trivial factors there are.

J

The OR-type answer (unordered) might be a good way to request the
> factors. Unfortunately, that gives away how many factors there are,
> so another way to check the result might be a simple customresponse
> that separates the answer-string by commas.
>

------=_Part_19896_17307145.1206017278995
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

If you tell students to enter &#39;1&#39; into un-needed boxes they will not necessarily know how many non-trivial factors there are.<br><br>J<br><br><div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
The OR-type answer (unordered) might be a good way to request the<br>
factors. Unfortunately, that gives away how many factors there are,<br>
so another way to check the result might be a simple customresponse<br>
that separates the answer-string by commas.<font color="#888888"><br></font></blockquote></div>

------=_Part_19896_17307145.1206017278995--