Divisibility Tests for 9 and 11: Interactive Demonstration with Digit Rules

Divisibility Tests for 9 and 11: Interactive Demonstration with Digit Rules
Loading the math board and drawing, please wait…
2020-09-13 03:40
This GeoGebra example interactively demonstrates the divisibility tests for 9 and 11 by using digit-based patterns and immediate feedback. It shows how to determine whether a given integer is divisible by 9 (via the digit-sum rule) or by 11 (via the alternating digit-sum/difference rule), turning the learning process into a cycle of “apply the rule → check → record results.” The core math concepts include number theory, congruence-style reasoning behind the divisibility rules, and the practical factor understanding often linked with MCM/MCD ideas. Construction-wise, it relies on Random and RandomElement to generate test numbers, If to branch into correct/incorrect判定 (divisible vs not divisible), and Polygon plus multiple labeled text objects (e.g., p1texto*, p2texto*) to present the rule steps and the outcome. It also tracks performance using variables like aciertos and fallos, and uses interface objects such as buttons and geometric/layout placeholders to structure the visualization. Suitable for middle/high school lessons on number theory, classroom demonstrations, and student practice or self-testing.

GeoGebra Commands & Parameters

  1. Random(91, 108) → p2once
  2. RandomElement(listaonce) → p2n
  3. Random(0, 9) → p1n1
  4. Random(0, 9) → p1n2
  5. Random(0, 9) → p1n3
  6. If(p2n1 + (10 * p2n2) + p1n3 ≤ 11, 11 - (p2n1 + (10 * p2n2) + p2n3), If[11 < p2n1 + p2n2 + p2n3 ≤ 2, 18 - (p1n1 + p1n2 + p1n3), 27 - (p1n1 + p1n2 + p1n3)]) → p2n4once
  7. If(p1n1 + p1n2 + p1n3 ≤ 9, 9 - (p1n1 + p1n2 + p1n3), If[9 < p1n1 + p1n2 + p1n3 ≤ 18, 18 - (p1n1 + p1n2 + p1n3), 27 - (p1n1 + p1n2 + p1n3)]) → p1n4nueve
  8. Polygon(A, E, F, D) → polígono2, e, f, g, h
  9. Polygon(A, B, C, D) → polígono1, a, b, c, d
  10. RandomElement({1, p1n4nueve, 2, p1n4nueve, 3, p1n4nueve, 4, p1n4nueve, 5, p1n4nueve, 6, p1n4nueve, 7, p1n4nueve, 8, p1n4nueve}) → p1n4

AI Drawing Prompt Reference

Create an interactive demonstration for divisibility tests of 9 and 11. Start by randomly generating a two-digit number, then create another number based on its digits. Use polygons to draw two shapes, one for the divisibility test of 9 and another for 11. Finally, dynamically display feedback indicating whether the test was correct or incorrect based on the generated numbers and test results.
The prompt above was compiled from the original drawing commands and is for reference only.