<table cellspacing="0" cellpadding="0" border="0" ><tr><td valign="top" style="font: inherit;">I am trying to do the problem 26.1.1 in the book HTDP and I just feel like the more I think about it, the more confused I get. I found a post from 2007 with some tips from Jens Axel Søgaard, the link is <a href="http://objectmix.com/scheme/186349-htdp-generative-recursion.html">http://objectmix.com/scheme/186349-htdp-generative-recursion.html</a>. I understand whats to be done, but Im just unsure how to accomplish the task. I believe that trivially solvable in this case is n=1 and n=prime. For n=1 the solution would be (list 1) for n=prime Im thinking it should be (list 1 n), my function is similar to the one on the link with a bit of different organization. When I read jens' tips near the end I am getting confused. The closest I can get to an answer is, (=(tabulate-div 20)(list 20 10 5 2 2)) From the advice supplied, I was able to say that the smaller problems that you split the program into are, one to get the largest divisor, and one which gets the smallest divisor using the largest. As far as template I am using what is supplied in the book. Im simply stuck, and would love something to help me out, I will continue to run this problem through my head and see what I can come up with. Thanks in advance for any help. </td></tr></table>