Is there a quick method using Sage to find all representations of a given (possible very large) positive integer B as a sum x21+....+x2n of exactly n integers xi>0?
Thanks for any help
![]() | 1 | initial version |
Is there a quick method using Sage to find all representations of a given (possible very large) positive integer B as a sum x21+....+x2n of exactly n integers xi>0?
Thanks for any help
![]() | 2 | None |
Is there a quick method using Sage to find all representations of a given (possible very large) positive integer B as a sum x21+....+x2n of exactly n integers $x_i >0$?>0,wherewecanassumethatx_i \leq x_{i+1}foralli$?
Thanks for any help