I have a question about number bases and square numbers. When considering quadratic residues in a given modulus (without eliminating residues that are not relatively prime to the modulus), it is evident that in a number of smaller moduli the squares that are less than the modulus comprise all the quadratic residues that it has, such that there are not any "false squares." This is the same question as asking whether a square when written in a given number base can only have a square in the one's place. For example, in base ten this is not the case, since a square can end in 0,1,4,5,6,9, and 5 and 6 are not squares. On the other hand, in both the duodecimal and hexadecimal systems a square can only end in 0,1,4,9, all of which are squares in themselves. For which number bases is this always the case, and is there a standard proof for it?
2026-03-27 19:32:23.1774639943
Quadratic residues that are also squares themselves
98 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 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.
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 observations on small numbers do lead to a proof. First, the number $d(n)$ of positive divisors of $n$ satisfies $d(n) < 2 \sqrt n,$ simply because each divisor $u > \sqrt n$ pairs up with a divisor $\frac{n}{u} < \sqrt n.$ Even if $n$ itself is a square, you get just one extra.... We may need a stronger one, $$ d(n) \leq 48 \sqrt[3]{\frac{n}{2520}} $$ with equality only at $n= 2520.$
Now, suppose $B \geq 17.$ For every number $x$ with $\sqrt B < x < \sqrt{2B}, $ we see $x^2$ lies between $B$ and $2B.$ Furthermore, the reduction $\pmod B$ is then exactly $x^2 - B .$ How often can this be a square? If so, we have some $y < \sqrt B$ such that $$ x^2 - B = y^2 $$ or $$ x^2 - y^2 = (x+y)(x-y) = B $$ Every time we find such an $x,y$ we have a (disticnt) divisor $(x+y),$ one for each value of $x$ that works out. The count of $x$ values is $\sqrt{2B} - \sqrt B \approx \frac {\sqrt B}{\sqrt 2 + 1}.$
For large enough $B$ this is much more than $48 \sqrt[3]{\frac{B}{2520}} $ and there are $x$ values that do not lead to divisors of $B;$ such an $x$ means failure.
Enough for now.
just numerical illustration, I ran all $B \leq 1000000. $ The bound with the cube root says $d(1000000) < 352.73 \; \; .$ In comparison, $\sqrt{2000000} - \sqrt{1000000} \approx 414.21 \; \; , $ which is already bigger than the cube root thing.