| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 5 months |
| seen | May 9 at 21:31 | |
| stats | profile views | 2 |
|
Mar 15 |
comment |
Unwanted hold in recursive function @hairutan thank you very much for the detailed answer. You made it very clear. |
|
Mar 15 |
accepted | Unwanted hold in recursive function |
|
Mar 14 |
revised |
Unwanted hold in recursive function added 180 characters in body |
|
Mar 14 |
comment |
Unwanted hold in recursive function @Rojo adding Listable to the attributes of f is exactly what I need. Thank you too. |
|
Mar 14 |
comment |
Unwanted hold in recursive function @whuber thanks, it works, I meant f[] instead of f(). |
|
Mar 14 |
asked | Unwanted hold in recursive function |
|
Dec 19 |
comment |
Finding integer partitions one at a time I am aware of this but it is a lot slower. |
|
Dec 19 |
revised |
Finding integer partitions one at a time edited title |
|
Dec 18 |
awarded | Commentator |
|
Dec 18 |
comment |
Finding integer partitions one at a time OK, thanks, this is actually what I am doing now. |
|
Dec 18 |
comment |
Finding integer partitions one at a time I am not asking whether I can make ItegerPartitions to give one partition at a time, but how can I write my version of it that does that. I tried but it became too messy too quickly for me to handle. |
|
Dec 18 |
comment |
Finding integer partitions one at a time Of course n and k are known from the beginning. My problem is that the result is generated all at once. The length of the list can be well over one million. (By the way, how do you produce the grey box with the command?) |
|
Dec 18 |
awarded | Editor |
|
Dec 18 |
comment |
Finding integer partitions one at a time I did, I hope it helps. |
|
Dec 18 |
revised |
Finding integer partitions one at a time added 457 characters in body |
|
Dec 18 |
asked | Finding integer partitions one at a time |
|
Dec 17 |
comment |
Different behaviour of ValueQ inside and outside of a loop Is there any way to create algorithmically variables z1, z2, z3, etc with numbers I choose? The only other option I know is to use Subscript. |
|
Dec 17 |
comment |
Different behaviour of ValueQ inside and outside of a loop It's not very convenient. I actually have a series $\sum_{n=1}^\infty z_n t^{-n}$ so the numbering and the order is very important for me. I don't really like the way I store the data, but works fairly well. |
|
Dec 16 |
comment |
Different behaviour of ValueQ inside and outside of a loop Thank you very much, I wasted quite a few frustrating hour with this and yet I failed to check what ValueQ[Z[sindex]] evaluates to. |
|
Dec 16 |
comment |
Different behaviour of ValueQ inside and outside of a loop Sjoerd you are absolutely right, I didn't think of that, I'll keep it in mind. Leonid thank you for the link. |