MathPlotAI Logo MathPlotAI

Teiler-Check-O-Mat

Teiler-Check-O-Mat
Loading the math board and drawing, please wait…
2024-01-23 15:05
In collections Teilbarkeitsregeln
Teiler-Check-O-Mat is a math tool that checks if a given number is divisible by a specific value. By inputting a number, users can check if it is divisible by 5 or 4. The tool also provides a question that asks users to input their birth year and check if it is divisible by certain values. This tool is suitable for middle school and high school math education, particularly for students learning divisibility rules and number factors. GeoGebra commands: Textfield, Polygon, Shuffle, Element, Append, Remove, DivisorsList, Factors, CountIf, Mod, Intersection, Length, Segment; Objects: counterNK, AB, AA, Blue, Green, Orange, Red, Purple, Gray, GrayDark, validate, showanswer, showsolution, btnValidate, attemptCount, correctCount, btnTryAgain, btnNew, textCountCorrect, showButtonNew, showButtonTryAgain, showButtonValidate, showhint, hintText, btnNoSelectionInputBoxes, btnSelectionAllowedInputBoxes, questionText, btnFixAllText, btnEmptyInputBoxes, inactiveButtonBackgroundColor, answerText, solutionText, text1, text2, aInput, InputBox1, bInput, InputBox2, correct, showcorrecttext.

GeoGebra Commands & Parameters

  1. Textfield(aInput) → InputBox1
  2. Textfield(bInput) → InputBox2
  3. Polygon(PtopLeftCornerFeedback, PtopRightCornerFeedback, PbottomRightCornerFeedback, PbottomLeftCornerFeedback) → rectangleCorrect, ptopleftcornerfeedback, ptoprightcornerfeedback, pbottomrightcornerfeedback, pbottomleftcornerfeedback
  4. Shuffle(Sequence[Random[0, 10], i, 1, 100]) → randomNosForX, {3, 6, 2, 5, 2, 8, 5, 0, 3, 7, 2, 6, 5, 5, 10, 0, 3, 3, 2, 0, 7, 4, 9, 0, 8, 4, 0, 9, 2, 4, 10, 10, 6, 0, 8, 10, 9, 10, 4, 5, 7, 9, 7, 3, 6, 2, 0, 7, 6, 3, 3, 4, 10, 5, 5, 10, 3, 2, 3, 3, 3, 4, 7, 7, 8, 1, 1, 0, 8, 5, 7, 9, 3, 3, 9, 10, 5, 5, 10, 7, 4, 3, 2, 5, 9, 2, 2, 0, 2, 7, 3, 2, 10, 9, 2, 7, 9, 10, 10, 1}
  5. Element(randomNosForX, Mod[questionCount, 100] + 1) → numX
  6. Shuffle(Sequence[Random[0, 10], i, 1, 100]) → randomNosForY, {4, 2, 8, 7, 1, 0, 2, 4, 3, 3, 7, 0, 9, 7, 6, 2, 9, 0, 6, 0, 6, 2, 6, 7, 10, 4, 4, 10, 6, 2, 0, 0, 1, 4, 4, 2, 2, 0, 8, 0, 2, 2, 9, 10, 9, 0, 4, 1, 8, 7, 8, 5, 5, 0, 4, 4, 6, 10, 7, 7, 8, 5, 6, 9, 1, 5, 8, 0, 8, 2, 4, 6, 3, 6, 10, 6, 5, 7, 4, 1, 9, 4, 4, 4, 4, 8, 3, 6, 2, 10, 9, 4, 1, 6, 5, 7, 8, 7, 5, 7}
  7. Element(randomNosForY, Mod[questionCount, 100] + 1) → numY
  8. Append(true, Sequence[If[randomNosForX(i) ≟ randomNosForX(i - 1), false, true], i, 2, 100]) → stayX
  9. Append(true, Sequence[If[randomNosForY(i) ≟ randomNosForY(i - 1), false, true], i, 2, 100]) → stayY
  10. Remove(Sequence[If[stayX(i), randomNosForX(i), 0], i, 1, 100], Sequence[0, i, 1, 100]) → randomNosForXwithoutRepeat
  11. Remove(Sequence[If[stayY(i), randomNosForY(i), 0], i, 1, 100], Sequence[0, i, 1, 100]) → randomNosForYwithoutRepeat
  12. Element(randomNosForXwithoutRepeat, Mod[questionCount, Length[randomNosForXwithoutRepeat]] + 1) → numXwithoutRepeat
  13. Element(randomNosForYwithoutRepeat, Mod[questionCount, Length[randomNosForYwithoutRepeat]] + 1) → numYwithoutRepeat
  14. Polygon(O, P, R, Q) → v1, o, p, r, q
  15. DivisorsList(AA) → Teilermenge
  16. Factors(AA) →
  17. CountIf(x > 0, Teilermenge) → countingElements
  18. Mod(ZahlGesamtPrüfung, 2) → Mod2
  19. Mod(ZahlGesamtPrüfung, 3) → Mod3
  20. Mod(ZahlGesamtPrüfung, 4) → Mod4
  21. Mod(ZahlGesamtPrüfung, 5) → Mod5
  22. Mod(ZahlGesamtPrüfung, 9) → Mod9
  23. Mod(ZahlGesamtPrüfung, 10) → Mod10
  24. Mod(ZahlGesamtPrüfung, 25) → Mod25
  25. Intersection(TeilerListSol, Teilermenge) → TeilerText
  26. Length(TeilerText) → teileranzahl
  27. Segment(S, T) → h

AI Drawing Prompt Reference

Create a tool to check if a number is divisible by 5 or 4. First, create two input boxes for numbers A and B. Then, generate 100 random numbers and randomly select two different numbers as X and Y coordinates. Draw a rectangle to represent the correct answer area. Define a number AA, calculate its divisors and factors, and count the number of divisors. Based on the remainder of AA divided by 2, 3, 4, 5, 9, 10, and 25, determine if it is divisible by these numbers and display the corresponding hint messages.
The prompt above was compiled from the original drawing commands and is for reference only.