概率与树状图演示
几何画板及绘图内容加载中,请稍等……
①本范例通过交互式演示概率树状图,直观展示事件发生的可能性及其组合;②涉及核心数学概念包括概率计算、事件独立性、树状图构建;③作图要点运用了 GeoGebra 命令 Sequence(序列生成)、Center(中心定位)、If(条件判断)、Point(点创建)、Segment(线段绘制);④适合高中阶段数学教学,用于概率统计入门及复杂事件分析教学。
GeoGebra 命令及参数
Sequence(Circle[Element[Centre01, i], BallRadius], i, 2, NoB + 1) → BallBlueList01Center(Element[BallBlueList01, 1]) → AASequence(Circle[Element[Centre11, i], BallRadius], i, 2, NoB) → BallBlueList11Sequence(Circle[Element[Centre12, i], BallRadius], i, 2, NoB + 1) → BallBlueList12Sequence(Circle[Element[Centre21, i], BallRadius], i, 2, NoB - 1) → BallBlueList21Sequence(Circle[Element[Centre22, i], BallRadius], i, 2, NoB) → BallBlueList22Sequence(Circle[Element[Centre24, i], BallRadius], i, 2, NoB + 1) → BallBlueList24Sequence(Circle[Element[Centre23, i], BallRadius], i, 2, NoB) → BallBlueList23Sequence(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) → Tree02MovingPointSequence(Segment[Element[Tree01Point, i], Element[Tree02MovingPoint, i]], i, 1, 2) → TreeLine01Sequence(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) → Tree04MovingPointSequence(Segment[Element[Tree03Point, i], Element[Tree04MovingPoint, i]], i, 1, 4) → TreeLine02If(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)))]) → C11aMoveIf(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)))]) → C12aMoveIf(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)))]) → C21bMoveIf(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)))]) → C23bMoveIf(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)))]) → C24bMoveIf(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)))]) → C22bMoveSequence(Circle[Element[BlueSelectedMovingCentreList, i], BallRadius], i, 1, 1) → BallBlueSelectedList01Sequence(Circle[Element[RedSelectedMovingCentreList, i], BallRadius], i, 2, 5) → BallRedSelectedList02Sequence(Circle[Element[RedSelectedMovingCentreList, i], BallRadius], i, 1, 1) → BallRedSelectedList01Sequence(Circle[Element[BlueSelectedMovingCentreList, i], BallRadius], i, 2, 5) → BallBlueSelectedList02Sequence(Circle[Element[Centre01, i], BallRadius], i, NoB + 2, nb + 1) → BallRedList01Sequence(Circle[Element[Centre11, i], BallRadius], i, NoB + 2, nb + 1) → BallRedList11Sequence(Circle[Element[Centre12, i], BallRadius], i, NoB + 3, nb + 1) → BallRedList12Sequence(Circle[Element[Centre22, i], BallRadius], i, NoB + 2, nb) → BallRedList22Sequence(Circle[Element[Centre23, i], BallRadius], i, NoB + 3, nb + 1) → BallRedList23Sequence(Circle[Element[Centre24, i], BallRadius], i, NoB + 4, nb + 1) → BallRedList24Sequence(Circle[Element[Centre21, i], BallRadius], i, NoB + 2, nb + 1) → BallRedList21Point(tempL11) → Z17Segment(Z17, Z08) → i
AI 绘图提示语参考
画一个概率树形图,包含两个初始事件,每个事件有两个可能的结果。初始事件A有蓝色和红色两个结果,事件B在每个结果下也有两个可能的结果。用线段连接每个事件的结果,形成树形结构。在每个结果点上画一个圆圈,表示事件发生的概率。随着步骤变化,结果点会移动,展示概率如何通过事件组合变化。
以上提示语为根据原始绘图命令整理而来,仅供参考。