积极 AI Logo 积极 AI

五级数字游戏

五级数字游戏
几何画板及绘图内容加载中，请稍等……
2017-08-03 21:13
测试改名0函数解析几何
这个范例演示了如何通过四个数字进行各种运算，涉及分数、等腰三角形、利息计算、函数图像等核心数学概念。通过使用RandomElement、If、Polygon、Segment等GeoGebra命令，可以构造出一个互动的数学游戏。适合小学五年级学生进行数学练习和探索。

GeoGebra 命令及参数

  1. RandomElement(possibleDecimals) → A
  2. RandomElement(Remove[possibleDecimals, {A}]) → B
  3. RandomElement({2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}) → Cdenom
  4. If(Cdenom ≟ 2, Random[0, 40, true], If[Cdenom ≟ 3, Random[0, 60, true], If[Cdenom ≟ 4, Random[0, 80, true], If[Cdenom ≟ 5, Random[0, 100, true], If[Cdenom ≟ 6, Random[0, 120, true], If[Cdenom ≟ 7, Random[0, 140, true], If[Cdenom ≟ 8, Random[0, 160, true], If[Cdenom ≟ 9, Random[0, 180, true], If[Cdenom ≟ 10, Random[0, 200, true], If[Cdenom ≟ 11, Random[0, 220, true], If[Cdenom ≟ 12, Random[0, 240, true]]]]]]]]]]]) → Cnum
  5. Polygon(I + (10, 0), W + (10, 0), V + (10, 0), J + (10, 0)) → poly1, g, h, i, j
  6. Polygon(J + (10, 0), V + (10, 0), U + (10, 0), K + (10, 0)) → poly2, k, n, p, q
  7. Polygon(K + (10, 0), U + (10, 0), T + (10, 0), L + (10, 0)) → poly3, l, r, t, a
  8. Polygon(L + (10, 0), T + (10, 0), S + (10, 0), M + (10, 0)) → poly4, m, s, b, f_1
  9. Segment(H, G) → c
  10. Segment(G, Z) → d
  11. Segment(Z, E) → e
  12. Segment(E, F) → f
  13. FractionText(C) → Cfancy
  14. Random(1, 19) → Dwhole
  15. RandomElement({2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}) → Ddenom
  16. Random(1, Ddenom - 1, true) → Dnum
  17. FractionText(Dnum / Ddenom) → Dfancy
  18. If(Dwhole < 0, Dwhole - Dnum / Ddenom, Dwhole + Dnum / Ddenom) → D
  19. Segment(A_1, Aact) → aerr
  20. Segment(B_1, Bact) → berr
  21. Segment(C_1, Cact) → cerr
  22. Segment(D_1, Dact) → derr
  23. Sort({A, B, C, D}) → test
  24. Sort({x(A_1), x(B_1), x(C_1), x(D_1)}) → test2
  25. If(IndexOf[A, Sort[{A, B, C, D}]] ≟ IndexOf[x(A_1), Sort[{x(A_1), x(B_1), x(C_1), x(D_1)}]], 1) → orderA
  26. If(IndexOf[B, Sort[{A, B, C, D}]] ≟ IndexOf[x(B_1), Sort[{x(A_1), x(B_1), x(C_1), x(D_1)}]], 1) → orderB
  27. If(IndexOf[C, Sort[{A, B, C, D}]] ≟ IndexOf[x(C_1), Sort[{x(A_1), x(B_1), x(C_1), x(D_1)}]], 1) → orderC
  28. If(IndexOf[D, Sort[{A, B, C, D}]] ≟ IndexOf[x(D_1), Sort[{x(A_1), x(B_1), x(C_1), x(D_1)}]], 1) → orderD