Journal of Economic Intelligence and Mathematics

DOI PREFIX 10.67238
FREQUENCY Annual (One issue per year)
×

Contact Emails

mathematics@globalmeetx.net
support@globalmeetx.com
editorial@globalmeetx.com
finance@globalmeetx.com
Diagonal Condition in Multiplication Table of Z[i]/(α)
Research Article - Volume: 1, Issue: 1, 2026 (November)
Dr Chadaphorn Kodsueb*ORCID

School of Mathematical Sciences and Geoinformatics, Institute of Science, Suranaree University of Technology, Nakhon Ratchasima, Thailand 30000.

*Correspondence to: Dr Chadaphorn Kodsueb, School of Mathematical Sciences and Geoinformatics, Institute of Science, Suranaree University of Technology, Nakhon Ratchasima, Thailand 30000, E-Mail:
Received: October 09, 2026; Manuscript No: JEIM-26-1036; Editor Assigned: October 26, 2026; PreQc No: JEIM-26-1036(PQ); Reviewed: October 30, 2026; Revised: October 31, 2026; Manuscript No: JEIM-26-1036(R); Published: November 07, 2026

ABSTRACT

Multiplication table of a ring with identity 1 is said to have the diagonal condition if 1’s occur only on the main diagonal. In this paper, we study the diagonal condition in the ring of Gaussian integers Z[i]. Furthermore, we also find the Gaussian integers α so that the rings of Gaussian integers modulo α satisfy the diagonal condition.

Keywords: diagonal condition, multiplication table, Gaussian integers, quotient ring

2020 MSC: 11R04, 11T30, 11N13.

INTRODUCTION

In [1] S.K. Chebolu (2012), he observed that 1’s only appear on the main diagonal of multiplication tables of Z2,Z3,Z4 and Z8 but not for Z5. The aim of [1] S.K. Chebolu (2012) is to find which positive integers n that make 1’s occur only on the main diagonal (not off diagonal) of multiplication table of Zn. Given Zn={1,2,…,n-1}. Any ring which has 1’s only appear on the main diagonal of its multiplication table. One says the ring satisfies diagonal condition, summarized in the following.

Theorem: Let n be a positive integer for Zn. The statements are equivalent:

  1. 1’s occur only on the main diagonal (not off diagonal) of multiplication table of Zn.
  2. If a is an element which has multiplicative inverse in Zn , then a2=1∈Zn.
  3. If a is an integer relatively prime with n, then n|a2-1.
  4. If p is a prime such that p∤n, then n|p2-1.

Finally, he found that 1’s occur only on the main diagonal of multiplication table of Zn if and only if n is a divisor of 24. This became the main theorem in [2] S.K. Chebolu (2012). He also provided five distinct proofs for this theorem. However, the special property about divisors of 24 has not ended there. In 2024,J. C. Lagarias proposed problems on Floor Quotients in American Math. Monthly problem 11747, Vol. 121,p. 83. His solution appears in Vol. 123 (2016), pp. 199–200 [9].

Later, [3] Chebolu, S.K. and Mayers (2013) investigated on the (same) diagonal condition of multiplication table but in a different ring, Zn[x]. They had very interest result, and then formed it as a main theorem “For any positive integer m, the multiplication table for the polynomial ring Znx1,x2,⋯,xm has 1’s only on the diagonal if and only if n is a divisor of 12”. Another result involved with number 12 has shown in [17] Poonen, B. and Rodriguez-Villegas, F. (2000). They discussed the number 12 related to convex lattice polygons with one interior lattice point.

Additionally, there is one paper linked to both numbers 12 and 24. In [14] Godinho, L., von Heymann, F. and Sabatini, S. (2017), they were interested in connection with mirror-symmetry and Calabi-Yau toric varieties. This kind of thing leads into aspects of Topology and Geometry.

Beyond than that [11] Genzlinger, K. and Lockridge, K. (2015) studied the diagonal condition on multiplication cube of Zn. They gained the main theorem as “All 1’s in the multiplication cube for

Zn lie exclusively on the diagonal or the coordinate planes (where one of the three coordinates is 1) if and only if n is a divisor of 4 or 6.

Nevertheless, the author’saim is still about the diagonal condition in multiplication table of (another) classical ring: Gaussian integers Z[i], specifically a ring of Gaussian integers modulo α.

GUSSIAN INTEGERS

This section provides crucial background of Gaussian integers Z[i] and Gaussian integers modulo α where α is nonzero in Z[i]. Some materials in this section, we take it partially from [3]K. Conrad 2016,[4]D.S. Dummit and R.M Foote (2004) and [6]J.A. Gallian (2021).

Basic knowledge of Z[i]

Gaussian integers are complex numbers is in the form a+bi where a,b∈Z, denoted Z[i]. In fact, Z[i] is subring of C with 1 is multiplicative identity. Since C is a field, Z[i] is an integral domain.

Definition For α=a+bi, Norm of α denote by Nα:=αα‾=a+bia-bi=α2+β2.

Remark It is obvious that Nα∈N0=Z+∪{0} if including the case α=0.

Theorem For α,β∈Z[i],Nαβ=NαNβ.

Definition The Gaussian integer β is a unit if β has multiplicative inverse in Z[i]i.e. there exists γ∈Z[i] such that γβ=1.

Theorem The only Gaussian integers that are units in Z[i] are 1,-1,i,-i.

Definition For α,β∈Z[i] where β≠0, we say that β|α if α=βγ for some γ∈Z[i]. Then β is called a divisor of α.

Theorem For all α,β in Z[i], if β|α in Z[i] then Nβ|Nα in Z.

Theorem Division Algorithm in Z[i] Given α,β∈Z[i] with β≠0. There exist κ,ρ in Z[i] such that α=βκ+ρ and Nρ<Nβ. In fact, we can choose ρ that makes Nρ<12Nβ.

Proof. We provide proof without words in Geometry: Division Algorithm in Z[i].

Article image

From the figure, vector from 0 to iβ is perpendicular with vector from 0 to β in Complex Plane C=R2. So the set βZ[i]={βκ∣β∈Z[i]} forms squares with length β= Nβ netting as lattice. It is easy to see that α appearing inside at least 1 square. Let βκ be the most nearest corner point with point α. Given ρ=α-βκ∈Z[i]. Then ρ is less than or equal to half a diagonal length, i.e. Nρ=ρ≤22β<Nβ.

Known fact is Z[i] is a Euclidean Domain (ED). Then Z[i] is also a PID and a UFD.

Definition Let γ∈Z[i], we call 1,-1,i,-i,γ,-γ,γi,-γi are trivial factors of γ.

Definition For α∈Z[i] which is not a unit, α is a factorized element (reducible element). If α is not a trivial factor and α has only trivial factors, then α is a irreducible element or called a Gaussian prime.

Theorem If Nα is a prime in Z, then α is a Gaussian prime in Z[i].

Definition A common divisor of α and β is a Gaussian integer δ such that δ|α and δ|β. Denote δ:=gcdα,βa greatest common divisor of α and β if and only if

  1. δ|α and δ|β,
  2. For all γ∈Z[i], if γ|α and γ|β then γ|δ. One says α and β are relatively (Gaussian) primes if δ=gcdα,β is a unit in Z[i].

Theorem Given π is a Gaussian prime. For all α,β∈Z[i], if π|αβ then π|α or π|β.

Remark Since Z[i] is a Unique Factorization Domain, Gaussian integers which are nonzero and non-unit can be factorized as multiplication of distinct Gaussian primes and a unit. § Author’s explanation

Coset representatives of quotient ring Z[i]/α

This subsection gives concepts of congruence–modulo and coset representatives in Z[i]/α.

Definition For Gaussian integers α,β and γ, we say that β congruence γ modulo α denoted by β≡γ mod α, when α|β-γ.

Remark It can be proved that Congruence–Modulo is an equivalence relation on Z[i]. The equivalence classes are cosets in quotient ring Z[i]/α. Next, we provide methods to find coset representatives of Z[i]/α when α=a+bi through multiples of Gaussian in grid as followed.

Let m,n∈Z. Consider a+bim+ni=a+bim+-b+ain.

Plot points a,b and -b,a in the grid, then form two vectors from origin to these points.

Extend the sided of two vectors to create a (main) square. Coset representatives of Z[i]/α are points located inside the square and on two main vectors including origin.

Translate the square till it can be filled the grid. Then, we have (all) cosets.

Examples 2.2.2 Find coset representatives of Z[i]/2+2i. First, consider 2+2im+ni=2+2im+-2+2in. Then follow steps 2. and 3. :

Article image

From the figure, the coset representatives of Z[i]/2+2i are 0,i,2i,3i,1+i,1+2i, -1+i,-1+2i equivalent with points 0,0,0,1,0,2,0,3,1,1,1,2,-1,1,-1,2 in grid.

Lemma For a,b,c,d,m∈Z, we have

a≡bmod c in Z if and only if a≡bmod c in Z[i].

a+bi≡c+dimod m if and only if a≡cmod m and b≡dmod m.

Let Nα be the number of coset representatives of Z[i]/αi.e. Nα:=Z[i]/α,α∈Z[i].

Lemma If m∈Z is nonzero, then Nm=m2.

Lemma If α≠0 in Z[i], then Nα‾=Nα.

Lemma If α and β are nonzero in Z[i], then Nαβ=NαNβ. In another word, function N is multiplicative.

Theorem If α≠0 in Z[i], then Nα=Nα.

Proof. By Lemma 2.2.6, Nαα‾=NαNα‾. From Lemma 2.2.5, we have the right hand side of previous equation is Nα2. Since αα‾=Nα is integer and Lemma 2.2.4, it can be concluded that Nαα‾=Nα2. Thus, Nα2=Nα2. Hence, we have Nα=Nα.

Gaussian primes

In this subsection, we find all Gaussian primes from Gaussian integers which divide primes in Z.

Definition In Z[i], we say that α∼β if α=uβ or α=uβ where u is a unit in Z[i].

Lemma 2.3.1 Let π be a Gaussian prime. Then, there exists a prime p∈Z such that π|p.

We can find all Gaussian primes from Gaussian integers which divide primes in Z[i].

Theorem A prime in Z is a factorized element (reducible element) in Z[i] if and only if p can be written as a sum of two squares.

Remark Any primes p∈Z which cannot be written as a sum of two squares, then p is not a factorized element (reducible element). Thus, p is a Gaussian primes.

Corollary If p is a prime in Z such that p≡3mod 4, then p is a Gaussian prime.

Lemma Given p∈Z is a prime. Either p=2 or p≡1mod 4 if and only if there exist integers a,b such that p=a2+b2.

Theorem Let p be a prime in Z such that p≡1mod 4. Then p=ππ‾ where π=a+bi and π‾=a-bi whilst π≁π‾.

Proof. By, there exist integers a,b such that p=a2+b2. So, p=ππ‾ where π=a+bi and π‾=a-bi. Assume that a+bi∼a-bi. Then, there are 4 cases as followed

• case a+bi=a-bi: we have b=0. Then p=a2,a contradiction.

• case a+bi=-a-bi: we have a=0. Then p=b2,a contradiction.

• case a+bi=ia-bi: we get a=b. Then p=2a2=2b2,a contradiction.

• case a+bi=-ia-bi: we get a=-b. Then p=2b2=2a2,a contradiction. Thus, π=a+bi≁a-bi=π‾.

Theorem These are all Gaussian primes:

  1. 1+i,
  2. p where p are primes in Z s.t. p≡3mod 4,
  3. π=a+bi and π‾=a-bi when Nπ=Nπ‾=a2+b2=p, and p are primes in Z s.t. p≡1 mod 4.

Proof. We can find all Gaussian primes which divide prime p∈Z from Lemma 2.3.1:

  1. When p=2, we have 2=1+i1-i=-i1+i2. Then 1+i is satisfied the condition i.e. 1 +i|2 and 1+i≁1-i, ¶ Main theorem for this section.
  2. When p≡3mod 4,p is a Gaussian prime by Corollary 2.3.4,
  3. When p≡1mod 4, by Theorem 2.3.6,π and π‾ are Gaussian primes where p=ππ‾ and π≁π‾.
  4. Thus, we have proved.

MAIN RESULTS

From subsection 2.3 (Theorem 2.3.7), we know that all Gaussian primes are in the form

  1. 1+i,
  2. p where p are primes in Z s.t. p≡3mod 4,
  3. π=a+bi and π‾=a-bi when Nπ=Nπ‾=a2+b2=p, and p are primes in Z s.t. p≡1 mod 4.

We also know that any Gaussian integer α≠0 and α not a unit can be written as Gaussian primes factorization in the following theorem.

Theorem If α=uπ1c1π2c2⋯πrcr where u is unit and πi are Gaussian primes such that u≁πi , then

Z[i]/α≅Z[i]/u×Z[i]/π1c1×Z[i]/π2c2×⋯×Z[i]/πrcr.

Proof. This is trivial from Chinese Remainder Theorem, see statement in [9]T. Koshy (2002).

Theorem Z[i]/1+in do not satisfy diagonal condition when n≥3.

Proof. Suppose that Z[i]/1+in satisfy diagonal condition for some n≥3. Then, for all α∈Z[i] s.t. gcdα,1+i=δ where δ is unit, we have α2≡1mod 1+in. In Z[i]/1+i3× , we get -2+i2=4-4i-1≡-1mod 1+i3 that makes -2+i4≡1mod 1+i3. Since Z[i]/1+in satisfy diagonal condition for some n≥3,-2+i2≡1mod 1+in and hence -2+i2≡1 mod 1+i3. Thus, -1≡1mod 1+i3 so that 1+i3|-2. This leads a contradiction, the statement we supposed is wrong. Hence, Z[i]/1+in do not satisfy diagonal condition for all n≥3.

Remark If the order of Gaussian integers modulo α is greater than or equal to 3, then multiplication table of Z[i]/α do not have diagonal condition.

Lemma Z[i]/p do not satisfy diagonal condition when p are primes in Z s.t. p≡3mod 4.

Proof. Since p are primes in Z such that p≡3mod 4,p are Gaussian primes. Then Z[i]/p is a finite field which has order p2 because p is the maximal ideal. Thus, Z[i]/p× is a cyclic group with its order is equal to p2-1≥3. By Remark 3.3, the statement of lemma is proved.

Theorem Z[i]/pn do not satisfy diagonal condition when n≥2 and p are primes in Z such that p≡3mod 4.

Proof. Assume that Z[i]/pn satisfy diagonal condition for some n≥2. Then, we have ∀α∈Z[i] s.t. gcdα,p=δ where δ is unit, α2≡1(mod  pn ). However, there exists β∈Z[i]/p such that the order of β modulo p is p2-1≥3. That makes β2≢1mod p, contradicts with β2≡1mod p by assumption. Hence, the statement of theorem is confirmed.

Lemma Z[i]/π and Z[i]/π‾ do not satisfy diagonal condition when ππ‾=p and p are primes in Z such that p≡1mod 4.

Proof. By Theorem 2.3.7,π≁π‾ without loss of generality. Since π is a Gaussian prime, Z[i]/π is a field because π is a maximal ideal. Thus, Z[i]/π× is a cyclic group with order p-1. Then, there exists α∈Z[i] such that the order of α modulo π is equal to p-1≥3 so that α2≢1mod π. Hence, Z[i]/π does not satisfy diagonal condition.

Theorem Z[i]/πn and Z[i]/π‾n do not satisfy diagonal condition when n≥2 and ππ‾=p where p are primes in Z such that p≡1mod 4.

Proof. By Theorem 2.3.7,π≁π‾ without loss of generality. Suppose Z[i]/πn satisfy diagonal condition. Then, α2≡1mod πn for all α∈Z[i]. In Z[i]/π, there exists β∈Z[i] such that the order of β modulo π is p≥3 so that β2≢1mod π. By the assumption, we need to have β2≡1 mod πn,a contradiction. Thus, the statement of theorem is proved.

From Theorem 3.1 to Theorem 3.7 including remark and lemmas, we can generate the main theorem as followed:

Theorem Multiplication table of Z[i]/α have diagonal condition if and only if α=1+i or α=1+i2.

OPEN PROBLEMS AND INTERESTING POINTS

The author suggests readers to investigate diagonal condition on several interesting rings e.g. Q[i], Z1+-32, Real/ Imaginary Quadratic fields (QD where D is square-free, Real when D>0; Imaginary when D<0) or any other imaginary quadratic fields have units only 1 and -1. † Also, all related open problems such as Floor Quotient for the previous-mentioned domains with a variant problem analogs with what the author did in this paper.

DISCLOSURE

The author declares that there are no conflicts of interest that could have influenced the objectivity of this research or the writing of this paper.

ACKNOWLEDGEMENTS

The author would like to thank her BS advisor Assoc. Prof. Dr. Ajchara Harnchoowong for inspiration on research of Number Theory. Additionally, the author would like to praise productive comments from Prof. Jeffrey Clark Lagarias while attending the 2026 Gainesville international Number Theory conference at University of Florida, USA. The most important part to mention is her family, they always cheer her up in any stage of this research work.

† This part is suggested by Prof. Jeffrey Clark Lagarias

REFERENCES

    1. Burns G, Alper AM, Nowick AS. Introduction to group theory with applications. New York: Academic Press; 1977 Jan 1. [Google Scholar]
    2. Chebolu SK. What is special about the divisors of 24?. Mathematics Magazine. 2012 Dec 1;85(5):366-72. [Google Scholar]
    3. Chebolu SK, Mayers M. What is special about the divisors of 12?. Mathematics Magazine. 2013 Apr 1;86(2):143-6. [Google Scholar]
    4. Cohen S. A study of Gaussian integers. [Google Scholar]

    ~

     
    1. Davenport H. Multiplicative number theory. Springer Science & Business Media; 2013 Jun 29. [Google Scholar]
    2. Dresden G, Dymàček WM. Finding factors of factor rings over the Gaussian integers. The American Mathematical Monthly. 2005 Aug 1;112(7):602-11. [Google Scholar]
    3. Gallian J. Contemporary abstract algebra. Chapman and Hall/CRC; 2021 Jan 19. [Google Scholar]
    4. Genzlinger K, Lockridge K. Sophie Germain primes and involutions of ℤn×. Involve, a Journal of Mathematics. 2015 Jun 23;8(4):653-63. [Google Scholar]
    5. Gerjets MS. The distribution of primitive roots in fields of order p². [Google Scholar]
    6. Ginzburg A. Representation of groups by generalized normal multiplication tables. Canadian Journal of Mathematics. 1967 Jan;19:774-91. [Google Scholar]
    7. Godinho L, von Heymann F, Sabatini S. 12, 24 and beyond. Advances in Mathematics. 2017 Oct 15;319:472-521. [Google Scholar]
    8. Koshy T. Elementary number theory with applications. Academic press; 2002. [Google Scholar]
    9. Lagarias JC, Richman DH. The family of a-floor quotient partial orders. InCombinatorial and Additive Number Theory, New York Number Theory Seminar 2022 May 24 (pp. 283-318). Cham: Springer Nature Switzerland. [Google Scholar]
    10. Poonen B, Rodriguez-Villegas F. Lattice polygons and the number 12. The American Mathematical Monthly. 2000 Mar 1;107(3):238-50. [Google Scholar]
    11. Sabuncu C, Táfula C. The multiplication table problem in large dimensions. arXiv preprint arXiv:2608.16163. 2026 Aug 17. [Google Scholar]
    12. Schlitt J. Multiplication Tables for Integers with Restricted Prime Factors. arXiv preprint arXiv:2603.19212. 2026 Mar 19. [Google Scholar]
    13. Wahab MA. Elements of Group Theory and Multiplication Tables. InSymmetry Representations of Molecular Vibrations 2022 Sep 21 (pp. 49-122). Singapore: Springer Nature Singapore. [Google Scholar]
Citation: Kodsueb C (2026). Diagonal Condition in Multiplication Table of Z[i]/(α) . J. Econ. Intell. Math.. Vol.1 Iss.1, November (2026), pp:77-85.
Copyright: © 2026 Dr Chadaphorn Kodsueb. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.