I am looking to create a list-of-lists with all the combinations of 1..7.
The order is not important so for example [1,7] [7,1] should only return [1,7]

ie

[[1],[2],[3],[4],[5],[6],[7],[1,2],[1,3],[1,4],[1,5],[1,6],[1,7],

[2,2], [3,3], [4,4] ......................
[3,2]...................
.......
[7,2].............

[1,2,1]........

[1,2,2].......     ]

I am no sure I am explaining...

I would like to have some help to write the maple code (hopefully compiled) for

An Exact Polynomial Algorithm for the 0/1 Knapsack Problem , Edouard Petrounevitch
http://www.optimset.com/knapsack.pdf

I think such algorithm looks promising but I am no expert when it comes to optimization :-)

I was wondering if anyone could explain the theoretical reason (ie derive the
expression for the probability) why the optimal solution for the secretary problem
with n=100 is equal to 100/exp(1) and the probability is (1/exp(1))*100

Robert Israel tend to be good at these kind of things....:-)

The problem can be stated as follows (wikipedia):

 1. There is a single secretarial position to fill.
 2. There are n applicants for the position, and the value of n is known.

I have a problem understanding how the below reasoning works
for Bruss article “Sum the Odds to One and Stop,”

i) I would like to understand the die problem and more specificaly
why the probability is k(1/6)^1*(5/6)^(k-1). I have a hard time understanding this

ii) How can I apply this reasonong to a coin toss example?


I have managed...

This guy Giorges is using Python and wget inorder to do parrallel downloading
and he is arguing that it is very fast.

http://keramida.wordpress.com/2010/01/19/parallel-downloads-with-python-and-gnu-wget/


Now my questions become

1) Does there exist a simple way that I can use wget without installing it ?
I dont want to bother users of my Maple application with installing a 3:rd party software.
A simple file in a specific location would be ok though