A 4×4 magic square with your chosen sum
Two constructions for a 4×4 magic square with any integer sum: the formula 21a+b and a transformation of the normal square with sum 34.
ReadMathematics
Clear, organized learning paths that build strong foundations in mathematics and computer science.
Two constructions for a 4×4 magic square with any integer sum: the formula 21a+b and a transformation of the normal square with sum 34.
ReadEighteen explained techniques and their identities, 25 problems and an interactive practice laboratory.
ReadSix classic puzzles approached first through insight and then checked mathematically: coins, apples, averages, a current and two meetings.
ReadA chain of formulas born from one idea: pair the extremes, then transform the sum of natural numbers into sums of evens and odds.
ReadFive reworked classics and five newly framed problems, with equations, constraints, rejected roots and step-by-step checks.
ReadEight situations explored in primary, lower-secondary, and upper-secondary terms: an advanced model helps the teacher design concrete explanations without imposing it on the child.
ReadFifty challenging real-world problems solvable with first-degree equations. Solutions are hidden and, when useful, include a method without an equation.
Read
Solve ax + by = c without guessing: theory and example side by side, Bézout’s identity, every integer solution and non-negativity constraints. With a step-by-step laboratory.
ReadA hundred animals, a hundred coins and three prices: Diophantine equations, gcd and congruences to find every solution, or prove that none exists. Twenty problems with click-to-reveal solutions.
ReadA collection with explained solutions: from full cycles to partly full turns, from the GCD to impossible cases. Laboratory with extended Euclid and simulation.
ReadAverbach and Chein’s method: interpret integer coefficients as fills and empties, construct the pours and follow them in a laboratory with two animated bars.
ReadThe exact solution to a sequence-position problem in which every natural number n appears exactly n times.
ReadArticles 37–48 of 72