I want to check if $21$ is a square $\mod 25$, so the Jacobi symbol is: ${21 \choose 25}$. $25$ is not a prime, so I can't split up the numerator yet for the Legendre symbol. So I prime factorize the denominator into ${21 \choose 5} {21 \choose 5}$. I can use the Legendre symbol now, so we get ${3 \choose 5} {7 \choose 5} {3 \choose 5} {7 \choose 5}$. Is this correct usage/justification of the steps so far? I want to make sure I am using the steps for the correct reasons, and not obtain the correct results just by coincidence.
2026-03-28 04:01:46.1774670506
Am I using the Legendre/Jacobi symbols correctly?
649 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in MODULAR-ARITHMETIC
- How do I find the least x that satisfies this congruence properties?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- Remainder of $22!$ upon division with $23$?
- Does increasing the modulo decrease collisions?
- Congruence equation ...
- Reducing products in modular arithmetic
- Product of sums of all subsets mod $k$?
- Lack of clarity over modular arithmetic notation
- How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$
- Can $\mathbb{Z}_2$ be constructed as the closure of $4\mathbb{Z}+1$?
Related Questions in QUADRATIC-RESIDUES
- Prove: $k^2 \equiv 1 \mod p \implies k \equiv \pm1 \mod p$
- Number of solution is twice $(x,y)$
- Prove $\sum\limits_{j=1}^{p-1} j\left(\frac{j}{p}\right) = 0 $ for an odd prime $p$ with $p\equiv 1\text{ mod } 4$
- Understanding quadratic reciprocity
- Show that there's a solution to $x^2 \equiv -1 \pmod {p^2}$
- Number of solutions for quadratic polynomials in $\mathbb{F}_p$
- The existence of a solution of a quadratic congruence modulo $p$
- How many quadratic residues of $\mathbb{F}_{p^n}$ are in the kernel of a morphism $\mathbb{F}_{p^n}^+\to \mathbb{F}_p^+$?
- A question about the Legendre symbol $\left(\frac{1+a}{p}\right)$
- How many $k$ satisfy the equation $(p \cdot k)^2 \equiv 0 \pmod{p^n}$ where $k < p^n$ and $p$ is prime
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The$\newcommand\leg[2]{\left(\frac{#1}{#2}\right)}\newcommand\Z{\mathbb Z}$ Jacobi symbol is not useful for determining whether something is a quadratic residue modulo a composite number. For example, if $p$ is prime, then $\leg a{p^2}$ is defined as $$\leg ap\cdot\leg ap=\leg ap^2$$ and thus it is always $0$ or $1$, even if $a$ is a non-residue modulo $p^2$.
A first check would be whether $21$ is a square modulo $5$. Indeed, $21\equiv1^2\pmod5$. There are two ways to proceed:
Trial and error. Try to find $a$ such that $a^2\equiv21\pmod{25}$. Because you need $a^2\equiv1\pmod5$, you only have to check the values of $a$ that are $\equiv\pm\,1\pmod5$.
It turns out that $11^2=121\equiv21\pmod{25}$.
A clever argument. The group $(\Z/25\Z)^\times$ has even order and is known to be cyclic. Hence exactly half of its elements are squares.
On the other hand, if $a$ is a square modulo $25$, then $a$ is a square modulo $5$. Exactly half of the elements in $(\Z/5\Z)^\times$ are squares.
This implies that if $5\nmid a$ then $a$ is a square modulo $25$ if (and only if) $a$ is a square modulo $5$.
Because $21$ is a square modulo $5$, we are done.
Remark. In general we have: