In article <[EMAIL PROTECTED]>, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote: > To actually answer you question, there is a known loop > cycle in 3n+85085 for which p=492 and q=264. If there is > one solution, there must be at leats 263 others (the > cyclic permutations), but to brute force search for any > others would require enumerating the answer to how many > ways can 492 marbles be put in 264 bins such that each > bin has at least 1 marble.
Thank you very much. I am awestruck. -- David Wild using RISC OS on broadband www.davidhwild.me.uk -- http://mail.python.org/mailman/listinfo/python-list
