Excuse me, i'm not a native english speaker (and i thought i read this mode of speaking somewhere before):
is there an efficient way in sage to find the smallest integer k for which the inequality b^(k+1) / (factorial(k) * factorial(k+1)) <= 1 is true (b > 0) similarly for 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 --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
