I am trying to find all integers $m$ such that $m$ is relatively prime to 30, and $m=6x^2+5y^2$ for some integers $x,y$. Note that we must have: $y$ is odd, $(y,3)=1=(x,5)$. Using these conditions, I was able to show that $m=11$ or $29$ mod $30$. So I was first trying to handle the case $m=11$ mod 30. Note that $11=6\cdot1^2+5\cdot1^2$, but $41$ is not of the form $6x^2+5y^2$. So I was wondering, for which $n$ do we have $30n+11=6x^2+5y^2$? Also, for such $n$, can we obtain $x$ and $y$ satisfying $30n+11=6x^2+5y^2$?
2026-03-30 09:51:14.1774864274
Bumbble Comm
On
For what integers $n$, do we have $30n+11=6x^2+5y^2$ for some integers $x,y$?
125 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
Bumbble Comm
On
if n>0, then left hand side is positive, and 30n+11 chooses an ellipse from right-hand side which contains an ellipse for each value in $\{ (x,y) | f(n,x,y)=g(n,x,y), (n,x,y) \in (Z,Z,Z) \}$ where $f(n,x,y)=30n+1$ and $g(n,x,y)=6x²+5y²$. After you realize that it's just an ellipse for positive values of the left hand side, then the next step is to realize that the integers are a grid that needs to intersect the ellipse.
Related Questions in ELEMENTARY-NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- How do I show that if $\boldsymbol{a_1 a_2 a_3\cdots a_n \mid k}$ then each variable divides $\boldsymbol k $?
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- Algebra Proof including relative primes.
- 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)
- algebraic integers of $x^4 -10x^2 +1$
- What exactly is the definition of Carmichael numbers?
- Number of divisors 888,888.
Related Questions in QUADRATICS
- Do you have to complete the square before using the quadratic formula?
- Roots of the quadratic eqn
- Questions on positivity of quadratic form with orthogonal constraints
- Conjugate quadratic equations
- Do Irrational Conjugates always come in pairs?
- Quadratic Equations and their roots.
- Solving a quadratic equation with square root constants.
- What would the roots be for this quadratic equation $f(x)=2x^2-6x-8$?
- Polynomial Equation Problem with Complex Roots
- Solve $\sin^{-1}x+\sin^{-1}(1-x)=\cos^{-1}x$ and avoid extra solutions while squaring
Related Questions in INTEGERS
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Which sets of base 10 digits have the property that, for every $n$, there is a $n$-digit number made up of these digits that is divisible by $5^n$?
- Ring of remainders definition
- Proof of well-ordering property
- Compute a division with integer and fractional part
- Solving for 4 variables using only 2 equations
- For any natural numbers a, b, c, d if a*b = c*d is it possible that a + b + c + d is prime number
- Can I say this :$e^{{(294204)}^{1/11}}-{(294204)}^{1/11}$ integer number or almost integer?
- Pack two fractional values into a single integer while preserving a total order
- What will be the difference?
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
Related Questions in SUMS-OF-SQUARES
- How many variations of new primitive Pythagorean triples are there when the hypotenuse is multiplied by a prime?
- If $x^2-dy^2 = -1$ has a solution in $\mathbb{Z^2}$, then $d$ is the sum of two coprime squares.
- How to interpret this visual proof for Archimedes' derivation of Sum of Squares?
- consecutive integers that are not the sum of 2 squares.
- Sum of the Squares of the First n square Numbers is not a perfect square number
- How many sub-square matrices does a square matrix have and is there a simple formula for it?
- On near-Pythagorean triples $(n^5-2n^3+2n)^2 + (2n^4-2n^2+1)^2 = n^{10} + 1$
- Closed form for the sum $\sum_{n=-\infty}^{\infty}\sum_{m=-\infty}^{\infty}{\left(n^2+m^2\right)^{-{p}}}$
- Prove that any power of $10$ can be written as sum of two squares
- Can Gauss-Newton algorithm give better optimization performances than Newton algorithm?
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 values to look for are mod 120, specifically $11, 29, 59, 101 \pmod{120}.$ There is a fairly clean theory about primes that are represented by a binary form. Since the class number $h(\mathbb Z[\sqrt{-30}]) = 4$ but there is one form in each genus, the primes $p = 5 x^2 + 6 y^2 $ are described precisely by congruences.
Other than the primes $2,3,5,$ the primes such that $(-120|p) = 1$ are represented as such:
$$ \begin{array}{ccccccc} 1. & 1,&31,&49,&79, & \pmod{120}& :: \; \; x^2 + 30 y^2 \\ 2. & 17,&23,&47,&113, & \pmod{120}& :: \; \; 2x^2 + 15 y^2 \\ 3. & 13,&37,&43,&67, & \pmod{120}& :: \; \; 3x^2 + 10 y^2 \\ 6. & 11,&29,&59,&101, & \pmod{120}& :: \; \; 5x^2 + 6 y^2 \\ \end{array} $$
Products of such primes are represented by one of the four forms, specified by Gauss composition. For example, $11 \cdot 29 = 319 = 17^2 + 30 \cdot 1^2 = 7^2 + 30 \cdot 3^2.$ Suppose we call the forms 1,2,3,6, where the last one is for $6 y^2 + 5 x^2.$ For a product of such "good" primes, write each one with a code 1,2,3,6. Then multiply, table $1^2 = 2^2 = 3^2 = 6^2 = 1.$ Next $2 \cdot 3 = 6$ and $2 \cdot 6 = 3.$ Finally $3 \cdot 6 = 2.$ Well, here is a $2 \cdot 3 = 6.$ As in $17 \cdot 13 = 221 = 5 \cdot 5^2 + 6 \cdot 4^2 = 5 \cdot 1^2 + 6 \cdot 6^2 $
$$ \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc $$
$$ \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc \bigcirc $$