使用带图形的解法解决一元一次方程

GeoGebra 命令及参数

1. Shuffle({1, 2, 3, 4}) → allProblTypeAndC, {1, 3, 2, 4}
2. Element(allProblTypeAndC, Mod[countQuestion, Length[allProblTypeAndC]] + 1) → problType
3. Shuffle(2…10) → allA, {3, 8, 9, 6, 10, 2, 4, 5, 7}
4. Element(allA, Mod[countQuestion, Length[allA]] + 1) → valA
5. Shuffle(Sequence[valA + 1, 21]) → allB, {15, 17, 18, 11, 6, 10, 7, 9, 16, 19, 21, 12, 13, 14, 8, 20, 5, 4}
6. Element(allB, Mod[countQuestion, Length[allB]] + 1) → valB
7. Sequence(n, n, 2, Min[valB - 1, 10]) → dummyA1
8. RemoveUndefined(Zip[If[GCD[valB, n] ≟ 1, n], n, dummyA1]) → allA1
9. Element(allA1, Mod[countQuestion, Length[allA1]] + 1) → valA1
10. Element(allC, Mod[countQuestion, Length[allC]] + 1) → valC
11. If(problType ≟ 1, savedValue ≟ valB - valA, problType ≟ 2, savedValue ≟ valB + valA, problType ≟ 3, savedValue ≟ valB / valA, problType ≟ 4, savedValue ≟ ((valC * valB)) / valA1) → correctForDisplay
12. If(problType ≟ 1, Distance[T1, T2] / valB, problType ≟ 2, Distance[T1, T2] / (valA + valB), problType ≟ 4, Distance[T1, T2] / valB, 1) → unit
13. Textfield(input1) → InputBox1
14. If(problType ≟ 1, input1 ≟ valB - valA, problType ≟ 2, input1 ≟ valB + valA, problType ≟ 3, input1 ≟ valB / valA, problType ≟ 4, input1 ≟ ((valC * valB)) / valA1) → correct1
15. Polygon(Zip[PixelsToPoint[Corner[1], Corner[3], Corner[5], A], A, {(pixelsLeft, pixelsTop), (pixelsLeft, y(Corner[5]) - pixelsBottom), Corner[5] - (pixelsRight, pixelsBottom), (x(Corner[5]) - pixelsRight, pixelsTop)}]) → borderBox
16. Corner(5) → layoutAppSize
17. Segment(L1, L2) → rhs
18. Polygon(T1, T2, T3, T4) → tape, t1, t2, t3, t4
19. Polygon(T1, T11, T41, T4) → rectXType1, f, g, h, i
20. Polygon(T11, T2, T3, T41) → rectConstType1, j, k, l, m
21. Distance(T1, T2) → lConstTape
22. Polygon(T1, T12, T42, T4) → rectBType2, n, t12, t42, p
23. Polygon(T12, T2, T3, T42) → rectAType2, q, r, s, t
24. Sequence(Polygon[(i + x(T1), y(T1)), (i + x(T1) + lHorCutsType3, y(T1)), (i + x(T1) + lHorCutsType3, y(T3)), (i + x(T1), y(T3))], i, 0, lConstTape - lHorCutsType3, lHorCutsType3) → unitCutsType3
25. Midpoint(T1, T4) → M1
26. Midpoint(T2, T3) → M2
27. If(¬showanswer, Sequence[M1 + (i / ((2 * valA)) * (M2 - M1)), i, 1, (2 * valA), 2], Sequence[M1 + (i / ((2 * valA)) * (M2 - M1)), i, 1, (2 * valA), 2]) → allMidpoints
28. Sequence(labelX3, n, 1, Length[allMidpoints]) → allLabelsX3
29. Segment(LT1, LT2) → xtype4
30. Sequence(Polygon[(i + x(T1), y(T1)), (i + x(T1) + lHorCutsType4, y(T1)), (i + x(T1) + lHorCutsType4, y(T3)), (i + x(T1), y(T3))], i, 0, lConstTape - lHorCutsType4, lHorCutsType4) → unitCutsType4
31. Polygon(T14, T2, T3, (x(T14), y(T14) + hTape)) → rectRemoveType4, t14, c, d, e
32. Segment(L1, L4) → rhsType4
33. Denominator((valC * valB / valA1)) → denX4
34. Sequence(Polygon[(i + x(T1), y(T1)), (i + x(T1) + lHorCutsType4, y(T1)), (i + x(T1) + lHorCutsType4, y(T3)), (i + x(T1), y(T3))], i, (lHorCutsType4 * valA1), lConstTape - lHorCutsType4, lHorCutsType4) → unitCutsType4Grayed
35. Sequence(Text[allLabelsX3(A), allMidpoints(A) + If[¬showsolution, ((-0.3 * unit), 0.5), ((-0.5 * unit), 1)], true, true], A, 1, Length[allMidpoints]) → allLabelsType3
36. Segment((0, 6), T31) → xtype3
37. Segment((0, 6), (x(T11), 6)) → xtype1
38. If(showsolution, Midpoint[LT1, LT2] - (1.5, 0) + If[denX4 ≠ 1, (-0.5, 2.5), (-0.5, 1.5)], Midpoint[LT1, LT2] - (1.5, 0) + If[denX4 ≠ 1, (-0.5, 2.5), (-0.5, 1.5)]) → PX4