// Proof of pudding part 2:
System.out.println("Proof of pudding part 2:");
// define l
int l = 13;
Poly [] P1 = new Poly[l];
// creates a polynomial to represent x
Poly ex = new Poly ("x", new long[] {0L, 1L}, 1L);
// creates polynomial to represent the number 1
Poly one = new Poly ("x", new long[] {1}, 1L);
// define sequence
for (int n = 0; n < l; n++)
{
// define n!
long firstDenominatorPart1 = factorial(n);
// define 2^n
long firstDenominatorPart2 = 1
for (int o = 1; o < l; o++)
{ firstDenominatorPart2 = (firstDenominatorPart2 * 2); };
// define firstDenominator
long firstDenominator (firstDenominatorPart1 * firstDenominatorPart2 );
// define 1/((2^n)*n!) as a polynomial
Poly part1 = new Poly ("x", new long[] {1}, firstDenominator);