Self-Checking with perfect square trinomials/binomials

Finding a, b, and c weren’t to difficult. A little calculus made it much simpler.

For the corrections, you may have used evaluateAt in the CL to test a few values. I’m doing something similar, but using a list of values, X.

I take the difference of the target function evaluations and the student’s: |f(X)-g(X)|.
If that difference is 0 (or <=0.1 depending on the type of functions used), then I output 0 otherwise 1

{|f(X)-g(X)=0:0,1} is basically a when-otherwise. This creates a list of all 0’s and 1’s for each value in list X. If the total of all of these is 0, then f(x) was equivalent to g(x) for all the values used. total({|f(X)-g(X)=0:0,1})