Happy and Sad Numbers
Loading the math board and drawing, please wait…
This example demonstrates the concept of happy and sad numbers. A happy number is one that, when the sum of the squares of its digits is repeatedly calculated, eventually reaches 1; sad numbers do not. Key mathematical concepts include sequences and cycles. It uses GeoGebra commands such as Mod, Vector, and Point for construction. Suitable for middle school and above students to learn about sequences and cycles.
GeoGebra Commands & Parameters
Mod(floor(A1 / 10)^(2) + Mod[A1, 10]^(2) + B1^(2), 10) → B2Mod(floor(A2 / 10)^(2) + Mod[A2, 10]^(2) + B2^(2), 10) → B3Mod(floor(A3 / 10)^(2) + Mod[A3, 10]^(2) + B3^(2), 10) → B4Mod(floor(A4 / 10)^(2) + Mod[A4, 10]^(2) + B4^(2), 10) → B5Mod(floor(A5 / 10)^(2) + Mod[A5, 10]^(2) + B5^(2), 10) → B6Mod(floor(A6 / 10)^(2) + Mod[A6, 10]^(2) + B6^(2), 10) → B7Mod(floor(A7 / 10)^(2) + Mod[A7, 10]^(2) + B7^(2), 10) → B8Mod(floor(A8 / 10)^(2) + Mod[A8, 10]^(2) + B8^(2), 10) → B9Mod(floor(A9 / 10)^(2) + Mod[A9, 10]^(2) + B9^(2), 10) → B10Mod(floor(A10 / 10)^(2) + Mod[A10, 10]^(2) + B10^(2), 10) → B11Mod(floor(A11 / 10)^(2) + Mod[A11, 10]^(2) + B11^(2), 10) → B12Mod(floor(A12 / 10)^(2) + Mod[A12, 10]^(2) + B12^(2), 10) → B13Mod(floor(A13 / 10)^(2) + Mod[A13, 10]^(2) + B13^(2), 10) → B14Mod(floor(A14 / 10)^(2) + Mod[A14, 10]^(2) + B14^(2), 10) → B15Mod(floor(A15 / 10)^(2) + Mod[A15, 10]^(2) + B15^(2), 10) → B16Mod(floor(A16 / 10)^(2) + Mod[A16, 10]^(2) + B16^(2), 10) → B17Mod(floor(A17 / 10)^(2) + Mod[A17, 10]^(2) + B17^(2), 10) → B18Mod(floor(A18 / 10)^(2) + Mod[A18, 10]^(2) + B18^(2), 10) → B19Mod(floor(A19 / 10)^(2) + Mod[A19, 10]^(2) + B19^(2), 10) → B20Mod(floor(A20 / 10)^(2) + Mod[A20, 10]^(2) + B20^(2), 10) → B21Mod(floor(A21 / 10)^(2) + Mod[A21, 10]^(2) + B21^(2), 10) → B22Mod(floor(A22 / 10)^(2) + Mod[A22, 10]^(2) + B22^(2), 10) → B23Vector(A_1, A_2) → uVector(A_2, A_3) → vVector(A_3, A_4) → wVector(A_4, A_5) → eVector(A_5, A_6) → fVector(A_6, A_7) → gVector(A_7, A_8) → hVector(A_8, A_9) → iVector(B_0, B_1) → jVector(B_1, B_2) → kVector(B_2, B_3) → lVector(B_3, B_4) → mVector(A_9, B_0) → nMod(floor(A23 / 10)^(2) + Mod[A23, 10]^(2) + B23^(2), 10) → B24Mod(floor(A24 / 10)^(2) + Mod[A24, 10]^(2) + B24^(2), 10) → B25Mod(floor(A25 / 10)^(2) + Mod[A25, 10]^(2) + B25^(2), 10) → B26Mod(floor(A26 / 10)^(2) + Mod[A26, 10]^(2) + B26^(2), 10) → B27Mod(floor(A27 / 10)^(2) + Mod[A27, 10]^(2) + B27^(2), 10) → B28Mod(floor(A28 / 10)^(2) + Mod[A28, 10]^(2) + B28^(2), 10) → B29Mod(floor(A29 / 10)^(2) + Mod[A29, 10]^(2) + B29^(2), 10) → B30Mod(floor(A30 / 10)^(2) + Mod[A30, 10]^(2) + B30^(2), 10) → B31Mod(floor(A31 / 10)^(2) + Mod[A31, 10]^(2) + B31^(2), 10) → B32Mod(floor(A32 / 10)^(2) + Mod[A32, 10]^(2) + B32^(2), 10) → B33Mod(floor(A33 / 10)^(2) + Mod[A33, 10]^(2) + B33^(2), 10) → B34Mod(floor(A34 / 10)^(2) + Mod[A34, 10]^(2) + B34^(2), 10) → B35Vector(B_6, B_7) → qVector(B_7, B_8) → rVector(B_8, B_9) → sVector(B_9, C_0) → tVector(C_0, C_1) → u_1Vector(C_1, C_2) → v_1Vector(C_2, C_3) → w_1Vector(A, B_6) → pPoint(a) → L_1Point(a) → M_1