On Jan 21, 2008 6:39 AM, Georg <[EMAIL PROTECTED]> wrote: > > Hi, > > is there an efficient way in sage to find the smallest integer k to > meet (b constant) > > b^(k+1) / (factorial(k) * factorial(k+1)) <= 1
This sentence doesn't make sense to me. What does it mean for an integer to meet an inequality? I imagine an integer in a barroom meeting up with I don't know. > > and > > b^k / factorial(k) <=1 > > or, more generally (b, c, d positive constants, c > d) > > b^k / (factorial(k) * (k + c - d)^d) <= 1 > > many thanks in advance, Georg > > > > > -- William Stein Associate Professor of Mathematics University of Washington http://wstein.org --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@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-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
