Solve-problem(A, n):
		 {*** n has a digital decomposition: $n=n_{k} \beta_{k} +...+n_{1} \beta_{1} +n_{0}$ *** } 
		Partition the problem into subsets
			A = $\bigcup _{i=0}^{k} \: \:  \bigcup _{j=1}^{n_{i}} \:  A_{i}^{j}$;
			 {*** where size($A_{i}^{j}$) = $\beta_{i}$ *** } 
		for i:=0 to k while not completed do
			simpler-solve($A_{i}^{1} , \,  A_{i}^{2} ,\ldots , \,  A_{i}^{n_{i}}$);