User Tools

Site Tools


contest_2011-09-27

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
contest_2011-09-27 [2011/09/27 06:02]
jtkorb
contest_2011-09-27 [2011/09/27 11:00] (current)
jtkorb
Line 30: Line 30:
   * F: Brute force factorization is fine.  You'll want to keep a table of ''​(p,​e)''​ pairs for each prime, ''​p'',​ that divides ''​e''​ times.   * F: Brute force factorization is fine.  You'll want to keep a table of ''​(p,​e)''​ pairs for each prime, ''​p'',​ that divides ''​e''​ times.
   * G: Theorem: The highest power of ''​p''​ that divides ''​n!''​ is ''​n/​p + n/p^2 + n/p^3 ...''​. ​ So, ''​p^e''​ divides ''​n!''​ if this sum is at least ''​e''​ before ''​n/​p^k''​ reaches 0.   * G: Theorem: The highest power of ''​p''​ that divides ''​n!''​ is ''​n/​p + n/p^2 + n/p^3 ...''​. ​ So, ''​p^e''​ divides ''​n!''​ if this sum is at least ''​e''​ before ''​n/​p^k''​ reaches 0.
-  * H: Use the Diophantine solution method ​in the text.+  * H: The text suggests using the Diophantine solution method ​given there. ​ Note that you don't actually need to compute ​the solution, just determine whether or not a solution exists.
contest_2011-09-27.txt ยท Last modified: 2011/09/27 11:00 by jtkorb