GeoGebra Demo of GCD: Factor Lists and Common Divisors

This example demonstrates how the greatest common divisor (gcd) arises by randomly selecting integers, generating their full divisor lists, and highlighting the common divisors between two numbers. The key concepts are divisibility, factorization into prime factors (via Factors where used), divisor sets (DivisorsList), and the relationship between common divisors and gcd. Construction emphasizes a workflow: RandomElement picks values to vary each round; DivisorsList produces divisor lists for n, n1, n2, n3 (and others); Factors supports the factor structure; Textfield and corner-placed text objects display the divisor sets and computed answers; buttons (p1botón1, p1botón2, p1botón3) drive repeat/submit-like interaction and update counters such as aciertos and fallos. Geometric/layout elements like Polygon and Corner are used to organize the interface and stepwise visualization. Suitable for middle-school number theory lessons on divisibility and gcd, and for interactive practice/self-check activities.