A symmetry approach to number tricks

H{\aa}kon Kolderup

arxiv: 2509.04487 · v4 · submitted 2025-08-31 · 🧮 math.GM

A symmetry approach to number tricks

H{\aa}kon Kolderup This is my paper

Pith reviewed 2026-05-18 20:33 UTC · model grok-4.3

classification 🧮 math.GM

keywords number tricksgroup ringssymmetric groupszero divisorsdigit manipulations1089 tricklinear inequalitiespartitions

0 comments

The pith

Any pair of zero divisors in the group ring of the symmetric group partitions n-digit numbers so that digit operations produce a fixed output.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper generalizes tricks like the 1089 rule, where specific additions, subtractions, and digit reversals on a three-digit number always yield 1089. It proves that any zero divisors fg=0 in the integer group ring Z on the symmetric group of n elements induce a partition of all n-digit numbers into subsets defined by linear inequalities on their digits. On each subset the group-ring elements act constantly, turning the algebraic relation into an arithmetic identity that holds uniformly. A reader cares because the construction supplies a uniform algebraic source for an entire family of such tricks instead of discovering them one by one.

Core claim

Any pair of zero divisors fg=0 in the group ring Z[Σ_n] on the n-th symmetric group gives rise to a partition of the set of n-digit numbers into subsets U_e defined by linear inequalities, such that the zero divisors act constantly on each U_e and hence define a number trick.

What carries the argument

The constant action of a pair of zero divisors fg=0 from the group ring Z[Σ_n] on the decimal representations of n-digit numbers, restricted to subsets carved out by linear inequalities.

If this is right

Every such algebraic pair automatically produces a new number trick for any chosen n.
The linear inequalities that label the subsets U_e give an explicit description of the digit patterns on which the trick succeeds.
Different choices of zero divisors generate different families of tricks, recovering the classical 1089 example as one instance.
The method works uniformly for any n, not just the familiar three-digit case.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same construction could be run in other bases if the symmetric-group action is replaced by the corresponding wreath product.
A computer search over low-dimensional representations of Σ_n might systematically enumerate all such tricks for moderate n.
The linear inequalities may correspond to regions of constant carry patterns when the operations are performed in base 10.

Load-bearing premise

The group-ring elements must act compatibly with the linear inequalities that define the subsets so that constancy on each subset actually produces a single fixed numerical output.

What would settle it

Exhibit a concrete pair fg=0 in Z[Σ_n] for some small n together with an n-digit number whose digit vector lies in one of the predicted subsets U_e yet yields a different output from the claimed constant value.

Figures

Figures reproduced from arXiv: 2509.04487 by H{\aa}kon Kolderup.

**Figure 1.** Figure 1: The symmetries of a triangle can be used to generate number tricks. we can use this equality to derive a null relation as in Theorem 11 and hence a (formal) number trick. How to look for such a null relation? One possible recipe is: • Start with a relation between symmetries that the students have discovered, say ρ◦µ3 = µ2. • Use this relation to create a two term null relation f1 ◦ g1 + f2 ◦ g2 = 0 in Z[Σ… view at source ↗

read the original abstract

We generalize the classical "1089-number trick", which states that a certain combination of addition, subtraction and swapping the digits of a three-digit number will always output 1089. More precisely, we show that any pair of zero divisors $fg=0$ in the group ring ${\mathbb Z}[\Sigma_n]$ on the n-th symmetric group gives rise to a partition of the set of n-digit numbers into subsets $U_{\mathbf e}$ defined by linear inequalities, such that the zero divisors act constantly on each $U_{\mathbf e}$ and hence define a number trick.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives an algebraic generator for number tricks from zero divisors in Z[Σ_n], but the step from abstract ring action to constant output under base-10 place values looks like the part that still needs explicit checking.

read the letter

The core idea is that any zero divisors fg=0 in the group ring over the symmetric group produce partitions of n-digit numbers into subsets defined by linear inequalities on the digits, and the ring elements then act constantly on each subset to yield a fixed numerical result. This frames the 1089 trick as one instance of a broader construction and claims it works for any such pair in Z[Σ_n]. That is the new piece: turning the algebraic relation directly into a partition scheme that organizes and potentially generates these tricks without ad-hoc choices for each case. It does a reasonable job of making the link explicit in the abstract and keeping the setup parameter-free, which is cleaner than just listing examples. Credit for that systematic angle. The soft spot is exactly the compatibility the stress-test flags. The ring action is linear combinations of permutations on the digits, but the numerical value is the weighted sum with powers of 10. A permutation moves a digit across different place values, so the total changes unless the coefficients and the inequalities cancel those shifts precisely. The zero-divisor condition lives in the abstract ring and carries no information about the specific weights 1, 10, 100, etc., so constancy on each U_e does not follow for free. The abstract gives no proof steps or extra worked examples beyond the classical case, so it is not possible to see how the argument closes that gap. If the full text supplies a direct verification that the linear inequalities force the weighted evaluation to be invariant under the relevant combinations, that would settle it; otherwise the claim rests on an unshown bridge. This is the sort of paper that would interest people working in recreational or educational mathematics who want an algebraic lens on digit tricks. It is not aimed at core number theory or ring theory audiences. The construction is coherent on its own terms and shows honest engagement with the 1089 example, so it clears the bar for serious refereeing even if revisions are likely needed on the compatibility details. I would send it to peer review rather than desk reject.

Referee Report

2 major / 2 minor

Summary. The manuscript generalizes the classical 1089-number trick by asserting that any pair of zero divisors fg=0 in the group ring ℤ[Σ_n] induces a partition of the n-digit numbers into subsets U_e defined by linear inequalities on the digits, such that the zero divisors act constantly on each U_e and thereby define a number trick.

Significance. If the central claim is established with a complete argument, the work would supply an algebraic construction for number tricks via zero divisors in symmetric group rings, potentially systematizing known examples and generating new ones for arbitrary n. The manuscript does not yet include machine-checked proofs, reproducible code, or explicit falsifiable predictions beyond the classical case, so the significance remains provisional pending verification of the key steps.

major comments (2)

[Abstract] Abstract: the general theorem is asserted without any proof steps, explicit verification for n>3, or demonstration that the ring action respects the linear inequalities defining the U_e subsets.
[Central claim] Central claim (as elaborated after the abstract): the relation fg=0 in the abstract group ring ℤ[Σ_n] is said to imply constant numerical output on each U_e, but no argument is supplied showing that the unweighted permutation action is compatible with the place-value weighting ∑ d_i 10^i; the zero-divisor relation supplies no information about the distinct integers 1,10,100,… and therefore does not automatically guarantee constancy under the weighted evaluation.

minor comments (2)

The notation for the linear inequalities that cut out the subsets U_e should be introduced with at least one fully worked n=3 example that recovers the classical 1089 trick.
A brief comparison table listing the new tricks obtained for small n would improve readability and allow direct checking of the claimed constancy.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive critique. We agree that the abstract and central claim require additional justification and will revise the manuscript to supply a proof outline, explicit checks for n=4, and a detailed argument connecting the group-ring relation to constancy of the weighted numerical value. Our responses to the major comments follow.

read point-by-point responses

Referee: [Abstract] Abstract: the general theorem is asserted without any proof steps, explicit verification for n>3, or demonstration that the ring action respects the linear inequalities defining the U_e subsets.

Authors: We accept this observation. The abstract states the result concisely but omits the supporting steps. In the revision we will insert a brief proof sketch immediately after the statement, add an explicit worked example for n=4 that verifies the partition and the constant output, and include a short lemma establishing that each U_e is preserved by the relevant permutations in a manner compatible with the zero-divisor relation. revision: yes
Referee: [Central claim] Central claim (as elaborated after the abstract): the relation fg=0 in the abstract group ring ℤ[Σ_n] is said to imply constant numerical output on each U_e, but no argument is supplied showing that the unweighted permutation action is compatible with the place-value weighting ∑ d_i 10^i; the zero-divisor relation supplies no information about the distinct integers 1,10,100,… and therefore does not automatically guarantee constancy under the weighted evaluation.

Authors: The referee correctly notes that the manuscript does not yet supply an explicit bridge between the unweighted action in ℤ[Σ_n] and the place-value weighting. The linear inequalities that define the sets U_e are chosen precisely so that, inside each U_e, every permutation appearing in the supports of f and g rearranges the digits in a way that leaves the weighted sum unchanged; the zero-divisor identity then forces the two sides to cancel. We will add a dedicated subsection that spells out this compatibility, beginning with the classical 1089 case and then giving the general argument that the fixed place values 10^i are respected because the inequalities encode the necessary ordering among the digits. revision: yes

Circularity Check

0 steps flagged

No circularity: algebraic implication from zero divisors to constant-action partitions is presented as direct without self-reference or fitted inputs

full rationale

The paper's central claim is that fg=0 in Z[Σ_n] induces partitions U_e cut by linear inequalities on digits such that the group-ring action is constant on each U_e. This is stated as a direct consequence of the algebraic relation without invoking fitted parameters, self-definitions, or load-bearing self-citations. The action is defined via linear combinations of permutations, and constancy is asserted to yield fixed numerical output; no step reduces the claimed result to its own inputs by construction. The derivation is therefore self-contained against external algebraic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the standard algebraic structure of the integer group ring of the symmetric group and the assumption that its elements act on decimal digit strings in a manner compatible with linear inequalities on those strings.

axioms (2)

standard math The integer group ring Z[Σ_n] is well-defined and its multiplication is associative and distributive over addition.
Invoked implicitly when the abstract refers to zero divisors fg=0.
domain assumption Elements of Z[Σ_n] can be interpreted as linear operators on the set of n-digit numbers via their action on digit positions.
Required for the zero divisors to 'act constantly' on the subsets U_e.

pith-pipeline@v0.9.0 · 5610 in / 1399 out tokens · 44057 ms · 2026-05-18T20:33:45.873938+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

any pair of zero divisors f◦g=0 in the group ring Z[Σ_n] ... partition ... into subsets U_e defined by linear inequalities, such that the zero divisors act constantly on each U_e
IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 9 ... Vn = ⊔_e U_e ... Φ(f·N(g·v)) = Φ(f·c(g·v))

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

[1]

Oxford University Press, USA, 2002

David J Acheson.1089 and all that: A journey into mathematics. Oxford University Press, USA, 2002

work page 2002
[2]

Yannis Almirantis and Wentian Li.Extending 1089 attractor to any number of digits and any number of steps. 2024. arXiv:2410.11784. REFERENCES 10

work page arXiv 2024
[3]

The mystery of the number 1089–how Fibonacci numbers come into play

Ehrhard Behrends. “The mystery of the number 1089–how Fibonacci numbers come into play”. In: Elemente der Mathematik70.4 (2015), pp. 144–152

work page 2015
[4]

A combinatorial problem with a Fibonacci solution

Roger Webster. “A combinatorial problem with a Fibonacci solution”. In:The Fibonacci Quarterly 33.1 (1995), pp. 26–31

work page 1995

[1] [1]

Oxford University Press, USA, 2002

David J Acheson.1089 and all that: A journey into mathematics. Oxford University Press, USA, 2002

work page 2002

[2] [2]

Yannis Almirantis and Wentian Li.Extending 1089 attractor to any number of digits and any number of steps. 2024. arXiv:2410.11784. REFERENCES 10

work page arXiv 2024

[3] [3]

The mystery of the number 1089–how Fibonacci numbers come into play

Ehrhard Behrends. “The mystery of the number 1089–how Fibonacci numbers come into play”. In: Elemente der Mathematik70.4 (2015), pp. 144–152

work page 2015

[4] [4]

A combinatorial problem with a Fibonacci solution

Roger Webster. “A combinatorial problem with a Fibonacci solution”. In:The Fibonacci Quarterly 33.1 (1995), pp. 26–31

work page 1995