While investigating something about square numbers, I started to wonder which numbers $n$ have quadratic residues of $n-1$. Obviously all $n$ of the form $m^2+1$ will work. But there are other numbers such as $13$, is there a pattern to them? Any insights on this would be great.
2026-03-25 23:51:47.1774482707
Quadratic residues mod $n$ of $n-1$
104 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
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-RECIPROCITY
- 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$
- Elementary Number Theory: Quadratic Reciprocity
- Prove that there exists a number $x$ such that $x^2 \equiv 2$ (mod $p$) and $x^2 \equiv 3$ (mod $q$)
- Use quadratic reciprocity to decide whether the following congruences are solvable
- $3$ is a quadratic residue $\bmod p$ iff $ p \equiv \pm 1 \bmod12$
- Quadratic Reciprocity problem.. help!
- Condition for Quintic Reciprocity
- Prove that $\forall x\in\mathbb{N}\ \text{ there always exists a prime }p\equiv1 \pmod 6 \text{ s.t. }p|(2x)^2+3;$
- Diophantine equations for septic $(7$th$)$ power reciprocity
- Writting Legendre Symbol as an element of group cohomology of $\mathbb{Q}$
Related Questions in SQUARE-NUMBERS
- Squares of two coprime numbers
- Perfect Square and its multiple
- constraints to the hamiltonian path: can one tell if a path is hamiltonian by looking at it?
- Is square root of $y^2$ for every $y>0,y\in\mathbb{R}$?
- A square root should never be negative by convention or can be proved?
- Does $x+\sqrt{x}$ ever round to a perfect square, given $x\in \mathbb{N}$?
- Proof verification: Let $gcd(x,y)=1$. If $xy$ is a perfect square, then $x$ and $y$ are perfect squares.
- How to reduce calculation time for iterative functions that involve squaring a number in every iteration. Working with numbers in millions of digits
- Digits in a perfect square problem
- Trouble with a proof. I cannot prove this without inf many proofs for each and every case.
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?
In very short:
The equation $\,x^2=-1\pmod p\,,\;p\,$ a prime, has solution iff $\,p=1\pmod 4\,$ or $\,p=2\,$ (this is already a very nice exercise), and from here, with the prime factorization of $\,n\in\Bbb N\,$ , you get the corresponding condition for $\,x^2=-1\pmod m\,$.