Prime Clicker: Scratch

when Sprite1 clicked change [clickCount v] by [1] set [reward v] to (getLPF (clickCount)) change [PE v] by (reward) if (reward) = (clickCount) then // clicked on a prime if (clickCount) is not in [primesDiscovered v] then add (clickCount) to [primesDiscovered v] change [PE v] by ((10) * (clickCount)) end end

Abstract Scratch Prime Clicker is a conceptual educational game that merges the addictive mechanics of incremental (“clicker”) games with fundamental concepts in number theory, specifically prime numbers and factorization. Designed for implementation in MIT’s Scratch environment, the game serves as a bridge between recreational game design and serious mathematical learning. This paper explores the game’s core loops, mathematical depth, pedagogical applications, and technical architecture, arguing that clicker mechanics can effectively reinforce abstract mathematical principles through tangible, repetitive, and rewarding interactions. 1. Introduction Clicker games (e.g., Cookie Clicker , Adventure Capitalist ) operate on a simple premise: the player clicks to generate a resource, then uses that resource to automate production. Despite their reputation for mindlessness, these games are built on exponential growth curves, optimization problems, and strategic decision-making. Scratch Prime Clicker redirects these mechanics toward a specific mathematical domain: prime numbers. scratch prime clicker

when green flag clicked set [PE v] to [0] set [clickCount v] to [0] delete all of [primesDiscovered v] define getLPF (num) set [temp v] to (num) set [largest v] to [1] set [d v] to [2] repeat until ((d) * (d)) > (temp) repeat until ((temp) mod (d)) ≠ [0] set [largest v] to (d) set [temp v] to ((temp) / (d)) end change [d v] by [1] end if (temp) > [1] then set [largest v] to (temp) end return (largest) when Sprite1 clicked change [clickCount v] by [1]