deletions | additions       diff --git a/c) Imposing a restriction.tex b/c) Imposing a restriction.tex  index c48fb89..a27024e 100644  --- a/c) Imposing a restriction.tex  +++ b/c) Imposing a restriction.tex 
...
\section{c) Imposing a restriction}  One possible restriction would be to limit the amount possible to invest in each company to a constant amount $c$, so that the choice of how much to invest in a specific company instead becomes a choice of whether to invest money in the company or not. This should reduce makes  the complexity of the algorithm problem equivalent  to $\mathcal{O}(ix)$. the max subset sum problem.