Notes on Palindromic numbers
updated docs for ideas on Palindrome numbers
Merge branch 'master' into p4

Conflicts:
	doc/Euler.pdf
added palindrome and fixed up errors in Makefile and factor
readded file after merger
added test structure for palindrome and the first test
added code for the palindrome functions and they check out
added doc for the same
added notes on checking for 3 digit products
updated strings
fixed up a big in factorN() that resulted from n=1 when adding the last factor
fixed up bug in test
added test for new twoFactor() and function stub
wrote twoFactor(). Are these the things we do when no one else will
see or are these the things we secretly hope others will find?
This does it for -n 3 but for -n 1 and -n 2 there are bugs to be
worked out.

for -n 1 it returns 9x1, which is a questionable factoring. 9
is certainly the correct answer though so I will leave it.

for -n 2 it misses the solution 9009=91x99 and finds an
earlier solution.
changing check from < sn to <=sn to fix problem with 9009.
Since sn is an integer that may be less than sqrt(n) we have
to check up to sn.
added no solution display if none found.
bug on -n 2 was found in factor.c
Added notes and code listing
and fix typo