二次多项式因式分解的几何作图与验证

GeoGebra 命令及参数

1. Shuffle({1, 2, 3, 4}) → allCaseNum, {4, 1, 2, 3}
2. Element(allCaseNum, Mod[countQuestion, Length[allCaseNum]] + 1) → caseNum
3. Shuffle(Sequence[t, t, -7, 7, 1] \ {0}) → allA, {5, -4, -7, -1, -5, 7, 4, 1, -3, -2, 6, -6, 2, 3}
4. Element(allA, Mod[countQuestion, Length[allA]] + 1) → numA
5. Shuffle(Sequence[t, t, -7, 7, 1] \ {0, numA, (-numA)}) → allB, {-1, 3, 1, -6, -2, -7, 6, -4, 4, -3, 2, 7}
6. Element(allB, Mod[countQuestion, Length[allB]] + 1) → numB
7. Polynomial(((numA * x) + numB)^(2)) → given1
8. Polynomial((((numA * x) + numB) * ((numA * x) - numB))) → given2
9. Polynomial(((((-numA) * x) + numB) * ((numA * x) + numB))) → given4
10. Polynomial(x^(2) + ((numA + numB) * x) + (numA * numB)) → given3
11. Shuffle({1, 2, 3, 4, 5, 6}) → ddOrder, {6, 4, 2, 5, 3, 1}
12. Append("$\phantom{ABCDEFppqq}$", Zip[choices(A), A, ddOrder]) → ddMenu2
13. SelectedIndex(ddMenu1) → is1
14. SelectedIndex(ddMenu2) → is2
15. Polygon({DataMin, (x(DataMin), y(DataMax)), DataMax, (x(DataMax), y(DataMin))}) → viewBox
16. Segment((x(DataMin), 0), (x(DataMax) + (10 * windowWidth / PXwindowWidth), 0)) → axisX
17. Segment((0, y(DataMin)), (0, y(DataMax) + (10 * windowHeight / PXwindowHeight))) → axisY
18. If(x(DataMin) < 0, If[y(DataMin) ≟ 0, (0, -1), If[y(DataMin) < 0, (-1, -1), (0, -1)]], If[y(DataMin) < 0, (-1, 0), (-1, -1)]) → zeroOffset
19. Join({Sequence[A, A, (-xIncrement), x(DataMin), (-xIncrement)], Sequence[A, A, xIncrement, x(DataMax), xIncrement]}) → xLblPos
20. Join({Sequence[A, A, (-yIncrement), y(DataMin), (-yIncrement)], Sequence[A, A, yIncrement, y(DataMax), yIncrement]}) → yLblPos
21. Sort(Join[{Sequence[0, x(DataMax), xIncrement], Sequence[(-xIncrement), x(DataMin), (-xIncrement)]}]) → xValues
22. Zip((A, Max[0, y(DataMin)]), A, xValues) → xPoints
23. Join({Sequence[0, y(DataMax), yIncrement], Sequence[(-yIncrement), y(DataMin), (-yIncrement)]}) → yValues
24. Zip((Max[0, x(DataMin)], A), A, yValues) → yPoints