The object is to find all integers k , lets say in the range [-10^9,10^9], for which the number 40!+k splits in three prime factors with 16 decimal digits. Has somebody an efficient routine for Sage?
Revision history [back]
 | 1 | initial version |
