[abcdunlimited@lsh409 bridges]$ diff b1 b2                                                     

10,12c10,12

< 	System.out.println(author);    

< 	System.out.println(title);

< 	    

---

> 		System.out.println("\n"); 

> 		System.out.println(author);    

> 	    System.out.println(title);

18c18

< 	    double[] x = new double[3];		// Array for a,b,c values.

---

> 	    double[] x=  new double[3];		// Array for a,b,c values.

39a40,41

> 		

> 		

45a48,49

> 		

> 		

57c61

< 		//Sets the values to be the (i + 1) power. Ends up being 1, 2 and 3 

---

> 		//Sets values for the col to be the original numbers

58a63,67

> 			p[i][0] = x[i];

> 		}

> 		

> 		//Sets the values to be the (i + 1) power. Ends up being 2 and 3 

> 		for (int i = 1; i < p.length; i++) {

61c70

< 				p[j][i] = Math.pow(x[j], (i + 1));

---

> 				p[j][i] = Math.pow(p[j][0], (i + 1));

233c242

<     int n= a;

---

>     int n= (int) a;

383c392

< 		this.b *= 3;

---

> 		this.b = this.b * 3;

427a437,471

> 

> // For item 5, you may use the following code (or write your own).

> 

> /*class Main {

>   public static void main( String[] args ) {

>   	double a=100, b=200, c=300;

>   	

> 	int n, sum1, sum2;

>     n= (int) a;

>     System.out.printf( "For 1 to %d, the sums are:  %d  %d \n", 

>     	n, countUp( n ), countDown( n ) );

>     // Now, do the same for b and c.

>     

>   }// END OF main() //

> 

> 

>   // Use a loop to compute the sum from 1 to n.

>   static int countUp( int n ) {

> 	int result=0;

> 	for (int i=0; i<=n; ++i ) {

> 		// ++++ ADD YOUR OWN CODE ++++

> 	}

>   	return result;

>   }

>   // Recursive method -- no loops allowed!

>   static int countDown( int n ) {

> 		// ++++ DO NOT USE A LOOP ++++

> 			// ++++ ADD YOUR OWN CODE HERE ++++

> 				return 1;

> 			// ++++ ADD YOUR OWN CODE HERE ++++

>   }

> }// END OF class Main //

> */

>