Abstract

Abstract Consider an odd prime number p ≡ 2 ( mod 3 ) p\equiv 2\hspace{0.3em}\left(\mathrm{mod}\hspace{0.3em}3) . In this paper, the number of certain type of partitions of zero in Z / p Z {\mathbb{Z}}\hspace{-0.1em}\text{/}\hspace{-0.1em}p{\mathbb{Z}} is calculated using a combination of elementary combinatorics and number theory. The focus is on the three-part partitions of 0 in Z / p Z {\mathbb{Z}}\hspace{-0.1em}\text{/}\hspace{-0.1em}p{\mathbb{Z}} with all three parts chosen from the set of non-zero quadratic residues mod p p . Such partitions are divided into two types. Those with exactly two of the three parts identical are classified as type I. The type II partitions are those with all three parts being distinct. The number of partitions of each type is given. The problem of counting such partitions is well related to that of counting the number of non-trivial solutions to the Diophantine equation x 2 + y 2 + z 2 = 0 {x}^{2}+{y}^{2}+{z}^{2}=0 in the ring Z / p Z {\mathbb{Z}}\hspace{-0.1em}\text{/}\hspace{-0.1em}p{\mathbb{Z}} . Correspondingly, solutions to this equation are also classified as type I or type II. We give the number of solutions to the equation corresponding to each type.

Highlights

  • The study of Diophantine equations is one of the oldest branches of number theory and the most famous Diophantine equation is the Fermat equation: xn + yn = zn

  • For more than 350 years, many mathematicians have devoted their work on solving this fascinating conjecture and related Diophantine equations

  • We focus on prime numbers p in the form of p = 3m + 2, where m is a positive integer

Read more

Summary

Introduction

Counting certain quadratic partitions of zero modulo a prime number 199 with xyz ≠ 0 in /p and call such a solution a non-trivial solution. We apply formulas developed in [8] to determine the number of non-trivial solutions to equation (1) or that of quadratic solutions to equation (2), modulo any odd prime p ≡ 2 (mod 3). [8] Given positive integers h and k and a prime number p > 2, N(h, k, p) denotes the number of non-trivial solutions to the equation x1h + ⋯ + xkh = 0 in /p , where x1,..., xk ∈ rp. 3. Correspondingly, a solution triple (a, b, c) in /p to any equation is of type I if exactly two of the three numbers are identical. We give a formula for the number of such polynomials

Number of solutions
Solution types and the resulting partitions
Counting monomials in three variables of certain degree in
Conclusions and future directions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.