So solutions to \( x^4 \equiv 1 \pmod{17} \) are \( x \equiv 4, 13, 13, \ldots \) â wait: \( 4, 13 \), and also check \( 16 \equiv -1 \): \( (-1)^4 = 1 \), but excluded.
["Solving ( x^4 \equiv 1 \pmod{17} ): Complete Guide to All Solutions", "When solving modular equations like ( x^4 \equiv 1 \pmod{17} ), it’s crucial to find all residue classes modulo 17 that satisfy the congruence. This equation asks: Which integers ( x ) between 0 and 16 satisfy ( x^4 \equiv 1 ) when computed modulo 17?", "In this detailed article, we explain how to solve ( x^4 \equiv 1 \pmod{17} ), analyze the solutions properly, and clarify common misunderstandings.", "---", "### Understanding ( x^4 \equiv 1 \pmod{17} )", "We work in the finite field ( \mathbb{Z}/17\mathbb{Z} ), where ( 17 ) is a prime — so every nonzero element has a multiplicative inverse and solutions are finite and symmetric.", "The congruence ( x^4 \equiv 1 \pmod{17} ) means we seek all ( x <br/>\not\equiv 0 \pmod{17} ) such that raising ( x ) to the 4th power yields 1 modulo 17.", "This equation can be rewritten as:", "[\nx^4 - 1 \equiv 0 \pmod{17} \quad \Rightarrow \quad (x^2 - 1)(x^2 + 1) \equiv 0 \pmod{17}\n]", "Thus, ( x^4 \equiv 1 ) if either:", "1. ( x^2 \equiv 1 \pmod{17} ), or\n2. ( x^2 \equiv -1 \pmod{17} )", "Let’s analyze each case.", "---", "### Step 1: Solve ( x^2 \equiv 1 \pmod{17} )", "This is straightforward:", "[\nx^2 \equiv 1 \implies x \equiv \pm 1 \pmod{17}\n]", "So solutions are:", "[\nx \equiv 1 \pmod{17}, \quad x \equiv -1 \equiv 16 \pmod{17}\n]", "Note: ( 16 \equiv -1 ), and as noted: ( (-1)^4 = 1 ), so 16 is a solution — but it’s not excluded as stated; actually, ( 16 \equiv -1 ) is valid and included.", "Wait — correction: the initial note said “excluded” but clearly ( 16^4 \equiv (-1)^4 = 1 \pmod{17} ), so it is a solution.", "So solutions from this case: ( x \equiv 1, 16 \pmod{17} )", "---", "### Step 2: Solve ( x^2 \equiv -1 \pmod{17} )", "We ask: Does (-1) have a square root modulo 17?", "For a prime modulus ( p ), ( -1 ) is a quadratic residue modulo ( p ) if and only if ( p \equiv 1 \pmod{4} ).", "Since ( 17 \equiv 1 \pmod{4} ), ( -1 ) is a quadratic residue mod 17 — so solutions exist!", "Now find all ( x ) such that ( x^2 \equiv -1 \pmod{17} ), i.e., ( x^2 \equiv 16 \pmod{17} )", "Try small numbers:", "- ( 1^2 = 1 )\n- ( 2^2 = 4 )\n- ( 3^2 = 9 )\n- ( 4^2 = 16 \equiv -1 ) ← Yes!\n- So ( x \equiv 4 \pmod{17} ) is one", "Then, since if ( x^2 \equiv -1 ), then ( (-x)^2 \equiv (-1)^2 \cdot x^2 \equiv 1 \cdot (-1) = -1 ), so ( -4 \equiv 13 \pmod{17} ) also works.", "Indeed, ( 13^2 = 169 \equiv 169 \mod 17 )", "( 17 \ imes 9 = 153 ), ( 169 - 153 = 16 ), so ( 169 \equiv 16 \equiv -1 \pmod{17} )", "Thus:", "[\nx^2 \equiv -1 \pmod{17} \implies x \equiv 4 \pmod{17} \quad \ ext{or} \quad x \equiv 13 \pmod{17}\n]", "---", "### Combined Solutions", "From ( x^2 \equiv 1 ): ( x \equiv 1, 16 )", "From ( x^2 \equiv -1 ): ( x \equiv 4, 13 )", "Therefore, the full set of solutions modulo 17 is:", "[\nx \equiv 1, 4, 13, 16 \pmod{17}\n]", "Note: these are all distinct modulo 17.", "---", "### Why the Confusion Over “( x \equiv 13, 13 \ldots )”?", "The original note says: “solutions are ( x \equiv 4, 13, 13, \ldots )” — likely a typo or formatting error.", "These are not multiple values of one solution — ( 13 ) appears once, not repeatedly. Possibly meant to reflect symmetry or part of a larger pattern, but here the distinct solutions are clearly 1, 4, 13, 16.", "Also, 16 ≡ -1 is valid — so it is included. It satisfies ( (-1)^4 = 1 ), clearly a solution.", "---", "### Final Answer", "The complete list of solutions to ( x^4 \equiv 1 \pmod{17} ) is:", "[\nx \equiv 1, ; 4, ; 13, ; 16 \pmod{17}\n]", "These are the only integers between 0 and 16 satisfying the congruence.", "---", "### Bonus: Why Only These?", "The multiplicative group modulo 17 is cyclic of order 16. The number of solutions to ( x^k \equiv 1 \pmod{p} ) is exactly ( \gcd(k, p-1) ). Here, ( k = 4 ), ( p-1 = 16 ), so ( \gcd(4,16) = 4 ), so there are exactly 4 solutions — which matches our count.", "They form a subgroup of order 4 in ( (\mathbb{Z}/17\mathbb{Z})^\ imes ), generated by ( 4 ) (since ( 4^1 = 4 ), ( 4^2 = 16 \equiv -1 ), ( 4^4 = (-1)^2 = 1 \mod 17 )).", "Indeed:", "- ( 4^1 = 4 )\n- ( 4^2 = 16 \equiv -1 )\n- ( 4^3 = 4 \cdot (-1) = -4 \equiv 13 )\n- ( 4^4 = (-1)^2 = 1 )", "Similarly, ( 13 = 4^3 ), and ( 16 = 4^2 ), closing the cycle.", "---", "### Summary", "- ( x^4 \equiv 1 \pmod{17} ) has exactly 4 solutions: ( x \equiv 1, 4, 13, 16 \pmod{17} )\n- Among them: ( 1 ), ( 16 \equiv -1 ), ( 4 ), and ( 13 \equiv -4 )\n- The note about “16 being excluded” is incorrect; ( 16 ) is a solution\n- Understanding quadratic residues and group theory helps solve such modular equations efficiently", "---", "Keywords:\n( x^4 \equiv 1 \pmod{17} ), solutions modulo 17, modular equations, finite field, quadratic residues, modular arithmetic, prime moduli, order of elements in ( \mathbb{Z}_{17}^\ imes )", "---", "Understanding these solutions enhances number theory skills vital in cryptography, coding theory, and discrete math."]
