积极 AI Logo 积极 AI

概率与树形图

概率与树形图
几何画板及绘图内容加载中，请稍等……
2019-01-11 16:59
概率统计
该范例演示了概率与树形图的概念。通过树形图，可以直观地展示事件的概率分布。核心数学概念包括概率计算和条件概率。使用了Sequence, Center, If, Point, Segment等GeoGebra命令进行构造。适合初中及以上学生学习概率统计。

GeoGebra 命令及参数

  1. Sequence(Circle[Element[Centre01, i], BallRadius], i, 2, NoB + 1) → BallBlueList01
  2. Center(Element[BallBlueList01, 1]) → AA
  3. Sequence(Circle[Element[Centre11, i], BallRadius], i, 2, NoB) → BallBlueList11
  4. Sequence(Circle[Element[Centre12, i], BallRadius], i, 2, NoB + 1) → BallBlueList12
  5. Sequence(Circle[Element[Centre21, i], BallRadius], i, 2, NoB - 1) → BallBlueList21
  6. Sequence(Circle[Element[Centre22, i], BallRadius], i, 2, NoB) → BallBlueList22
  7. Sequence(Circle[Element[Centre24, i], BallRadius], i, 2, NoB + 1) → BallBlueList24
  8. Sequence(Circle[Element[Centre23, i], BallRadius], i, 2, NoB) → BallBlueList23
  9. Sequence(If[step ≤ 10, (FindCor(step, 0, 10, x(Element[Tree01Point, i]), x(Element[Tree02Point, i])), FindCor(step, 0, 10, y(Element[Tree01Point, i]), y(Element[Tree02Point, i]))), Element[Tree02Point, i]], i, 1, 2) → Tree02MovingPoint
  10. Sequence(Segment[Element[Tree01Point, i], Element[Tree02MovingPoint, i]], i, 1, 2) → TreeLine01
  11. Sequence(If[step < 35, Element[Tree03Point, i], If[step > 45, Element[Tree04Point, i], (FindCor(step, 35, 45, x(Element[Tree03Point, i]), x(Element[Tree04Point, i])), FindCor(step, 35, 45, y(Element[Tree03Point, i]), y(Element[Tree04Point, i])))]], i, 1, 4) → Tree04MovingPoint
  12. Sequence(Segment[Element[Tree03Point, i], Element[Tree04MovingPoint, i]], i, 1, 4) → TreeLine02
  13. If(step < 20, Element[Centre11, NoB + 1], If[step > 30, C11a, (FindCor(step, 20, 30, x(Element[Centre11, NoB + 1]), x(C11a)), FindCor(step, 20, 30, y(Element[Centre11, NoB + 1]), y(C11a)))]) → C11aMove
  14. If(step < 20, Element[Centre12, NoB + 2], If[step > 30, C12a, (FindCor(step, 20, 30, x(Element[Centre12, NoB + 2]), x(C11a)), FindCor(step, 20, 30, y(Element[Centre12, NoB + 2]), y(C12a)))]) → C12aMove
  15. If(step < 50, Element[Centre21, NoB], If[step > 60, C21b, (FindCor(step, 50, 60, x(Element[Centre21, NoB]), x(C21b)), FindCor(step, 50, 60, y(Element[Centre21, NoB]), y(C21b)))]) → C21bMove
  16. If(step < 50, Element[Centre23, NoB + 1], If[step > 60, C23b, (FindCor(step, 50, 60, x(Element[Centre23, NoB + 1]), x(C23b)), FindCor(step, 50, 60, y(Element[Centre23, NoB + 1]), y(C23b)))]) → C23bMove
  17. If(step < 50, Element[Centre24, NoB + 3], If[step > 60, C24b, (FindCor(step, 50, 60, x(Element[Centre24, NoB + 3]), x(C24b)), FindCor(step, 50, 60, y(Element[Centre24, NoB + 3]), y(C24b)))]) → C24bMove
  18. If(step < 50, Element[Centre22, nb + 1], If[step > 60, C22b, (FindCor(step, 50, 60, x(Element[Centre22, nb + 1]), x(C22b)), FindCor(step, 50, 60, y(Element[Centre22, nb + 1]), y(C22b)))]) → C22bMove
  19. Sequence(Circle[Element[BlueSelectedMovingCentreList, i], BallRadius], i, 1, 1) → BallBlueSelectedList01
  20. Sequence(Circle[Element[RedSelectedMovingCentreList, i], BallRadius], i, 2, 5) → BallRedSelectedList02
  21. Sequence(Circle[Element[RedSelectedMovingCentreList, i], BallRadius], i, 1, 1) → BallRedSelectedList01
  22. Sequence(Circle[Element[BlueSelectedMovingCentreList, i], BallRadius], i, 2, 5) → BallBlueSelectedList02
  23. Sequence(Circle[Element[Centre01, i], BallRadius], i, NoB + 2, nb + 1) → BallRedList01
  24. Sequence(Circle[Element[Centre11, i], BallRadius], i, NoB + 2, nb + 1) → BallRedList11
  25. Sequence(Circle[Element[Centre12, i], BallRadius], i, NoB + 3, nb + 1) → BallRedList12
  26. Sequence(Circle[Element[Centre22, i], BallRadius], i, NoB + 2, nb) → BallRedList22
  27. Sequence(Circle[Element[Centre23, i], BallRadius], i, NoB + 3, nb + 1) → BallRedList23
  28. Sequence(Circle[Element[Centre24, i], BallRadius], i, NoB + 4, nb + 1) → BallRedList24
  29. Sequence(Circle[Element[Centre21, i], BallRadius], i, NoB + 2, nb + 1) → BallRedList21
  30. Point(tempL11) → Z17
  31. Segment(Z17, Z08) → i