Thank you for the suggestion on And, Not. The main reason for the integer type is for use in procedures since a number base must be greater than one.

@Mariusz Iwaniuk 

The syntax change works, BTW. Thanks.

@Mariusz Iwaniuk 

I've been doing it the posted way for a lonnng time (18yrs?) and have never had a problem until now. My guess is some tweaking changed the behaviour that I've been taking for granted.

@wkehowski DERP! It should be a file. Alright it's the end of the semester and I'm a bit frazzled!

@Joe Riel Yes, it's a dirsectory.

Yes, that helps with the icons, but the "Text Math Drawing Plot Animations" is squintingly small, and the filename tabs are unreadable. Hovering over a tab with the mouse is readable though. Other applications have had the same problem, just not to the degree as Maple 18. Maybe I'll just return the monitor for a 1920x1080 or a 2560X1440!

Works like a charm! However, instead of generating all combinations at once, is there a way of breaking the number of subsets into smaller pieces and the iterating over the pieces?

Works like a charm! However, instead of generating all combinations at once, is there a way of breaking the number of subsets into smaller pieces and the iterating over the pieces?

I should've reloaded before my last reply. Your answer is just what I've done. I look forward to your code. Thanks!

I should've reloaded before my last reply. Your answer is just what I've done. I look forward to your code. Thanks!

It is easy to write a search using Threads:-Map. A good idea is to break up the search into smaller pieces and then apply Map. Log files will help to resume the calculation if you need to stop it.

It is easy to write a search using Threads:-Map. A good idea is to break up the search into smaller pieces and then apply Map. Log files will help to resume the calculation if you need to stop it.

I have adapted the example for the Mandelbrot set in Task and yes, the main problem is breaking up the search. I'll post it when I'm done playing with it. A good example of how many combinations I need to search is C(113,7)=38620298376. Of course, I may need to be a little less ambitious and cut the 113 down some. I'm not sure if Seq will do the job since it seems to compute the full sequence in a parallel manner. I need a parallel version using nextcomb.

I have adapted the example for the Mandelbrot set in Task and yes, the main problem is breaking up the search. I'll post it when I'm done playing with it. A good example of how many combinations I need to search is C(113,7)=38620298376. Of course, I may need to be a little less ambitious and cut the 113 down some. I'm not sure if Seq will do the job since it seems to compute the full sequence in a parallel manner. I need a parallel version using nextcomb.