Hi, This is my first time emailing with a question and my first time trying to use Sage (I'm a complete programming dunce). I'm trying to do the following: Given the tuple (p,q) in Z x Z and integer n I need to count the number of integer-tuple solutions to the following (p,q)=(a_1,b_1)+...+(a_n,b_n) subject to the following conditions - (a_i,b_i) \neq (a_j,b_j) for i, j different - a_i, b_i >= -1 - a_i+b_i > 0
I would appreciate if someone could help me out even if it doesn't take the final conditions into account. I've tried doing something like X = CartesianProduct(OrderedPartitions(5,2), OrderedPartitions(4,2)); X.count() or X = CartesianProduct(Partitions(5,length=2), Partitions(4,length=2)); X.count() but the first one counts too much and the second one too little Ok thanks in advance. sonny --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
