Search:

Good morning:D

thanks for all the replys.
I was wondering if you could help me out with something.


int fangs[n1];

for (i2 = 0; i2 < n1; i2++)
{

hmm...

well, the goal of the program is to run through all possabilities of the specified size of the multiplaction problem, during this process, and not shown in the program, each combination is...

http://www.madras.fife.sch.uk/maths/amazingnofacts/fact020.html

Hi, just thought I would share what I've been wanting to work on for several months, and just in the past couple of days finally...