refactor: we can use the Polynomial's = method to reduce the number of assertions and make the tests more DSL like.

Author: hemalvarambhia

src/Math-Tests-Polynomials/PMPolynomialTest.class.st

@@ -161,11 +161,11 @@ PMPolynomialTest >> testPolynomialMultiplicationIsCommutative [
 
 { #category : #'testing - addition' }
 PMPolynomialTest >> testPolynomialNumberAddition [
-	| polynomial |
-	polynomial := 2 + (PMPolynomial coefficients: #(2 -3 1)).
-	self assert: (polynomial at: 0) equals: 4.
-	self assert: (polynomial at: 1) equals: -3.
-	self assert: (polynomial at: 2) equals: 1.
+
+	| polynomial expected |
+	polynomial := 2 + (PMPolynomial coefficients: #( 2 -3 1 )).
+	expected := PMPolynomial coefficients: #( 4 -3 1 ).
+	self assert: polynomial equals: expected.
 	self assert: (polynomial at: 3) equals: 0
 ]