On Oct 9, 10:22 pm, John Voight <[EMAIL PROTECTED]> wrote: > Hello all: > > I was hoping you could help me with this unbelievably trivial problem. > > Fix an integer B of size about 10 decimal digits, so too big to be an > unsigned long int but not much bigger. > > PROBLEM: Given an integer d of size maybe 10-15 decimal digits, return > True or False according as there exists an integer a such that a^2 > divides d and d/a^2 <= B.
Well, if you can get access to a 64-bit machine, then your numbers do fit in machine words. I'm not sure how much this helps. Carl --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
