Intereting Posts

Conjectured new primality test for Mersenne numbers
A problem on positive semi-definite quadratic forms/matrices
What is the relation between $ \kappa$-monolithic and monotonically monolithic?
$\operatorname{span}(x^0, x^1, x^2,\cdots)$ and the vector space of all real valued continuous functions on $\Bbb R$
Proving that closed (and open) balls are convex
Why are the differences between consecutive squares equal to the sequence of odd numbers?
Eigenvalues of linear operator $F(A) = AB + BA$
Average distance between two points on a unit square.
Find sagitta of a cubic Bézier-described arc
Solving a ODE from a diffeomorphism numerically
A map is continuous if and only if for every set, the image of closure is contained in the closure of image
$\lim_{x \to 2} \frac{x^{2n}-4^n}{x^2-3x+2}$
$\int \ln (\cos x)\,dx$
Show that $1/\sqrt{1} + 1/\sqrt{2} + … + 1/\sqrt{n} \leq 2\sqrt{n}-1$
Example of eigenvectors in different bases (follow-up question)

Find one integer solution to the Diophantine equation

\begin{equation*}

18x+14y+63z=5.

\end{equation*}

If this were only a linear equation over $\mathbb{Z}^2$, then I could easily solve it by using the extended Euclidean algorithm… but I have no idea how to do this with more than 2 unknowns…

- Finding all positive integer solutions to $(x!)(y!) = x!+y!+z!$
- Find all $x,y\in \mathbb{N}$ such that: $2^x+17=y^2$.
- For which primes $p$ does $px^2-2y^2=1$ have a solution?
- Solving $a^2+3b^2=c^2$
- Integers can be expressed as $a^3+b^3+c^3-3abc$
- Solve the equation $(2^m-1) = (2^n-1)k^2$

- Proof without induction of the inequalities related to product $\prod\limits_{k=1}^n \frac{2k-1}{2k}$
- How to solve the equation, $(x+y)(y+z)(x+z) = 13xyz$ for $x,y,z \in Z$.
- Show that $a^n \mid b^n$ implies $a \mid b$
- Concatenating squares - is this solution unique?
- an invertible element $i$ in $\mathbb Z_n$ must be coprime to $n$
- Mathematical proof for long-term behavior of a sequence of integer vectors
- Primitive roots of unity
- $2017$ as the sum of two squares
- Showing that a homomorphism between groups of units is surjective.
- Prove that $112$ divides the integral part of $4^m-(2+\sqrt{2})^m$

You solve $18 u + 14 v = 2 = \gcd(18,14).$ Solve $2 w + 63 z = 1.$ Combine to get $18 x + 14 y + 63 z = 1.$ Then multiply all by $5.$

[For the following paragraphs, please refer to the figure at the end of the last paragraph (the figure is also available in PDF).]

The manipulations performed from steps (0) to (17) were designed to create the linear system of equations (0a), (5a), (11a) and (17a). The manipulations end when the absolute value of a coefficient of the latest equation added is 1 (see (17)).

Equation (0a) is given. It is possible to infer equations (5a), (11a) and (17a) from (0), (5) and (11) respectively without performing manipulations (0) to (17) directly. In every case, select the smallest absolute value coefficient, generate the next equation by replacing every coefficient with the remainder of the coefficient divided by the selected coefficient (smallest absolute value coefficient) – do the same with the right-hand constant – and add the new variable whose coefficient is the smallest absolute value coefficient. If the new equation has a greatest common divisor greater than one, divide the equation by the greatest common divisor (it may be necessary to divide this greatest common divisor from previous equations). Stop when the absolute value of a coefficient of the latest equation added is 1.

Then proceed to solve the linear systems of equations.

**Hint** $\ \color{#c00}{18\!-\!14}\,\mid\, 63\!+\!1 $ $\, \Rightarrow\,16\,(18\!-\! 14)-63 = 1.\,$ Scale that by $\,5\,$ to finish.

**Remark** $\ $ The idea is simply to search for a “small” linear combination $\,n = \color{#c00}{ia+jb}\,$ of two elements $\,a,b\,$ of $\,\{14,18,63\}\,$ such that the 3rd element satisfies $\ c\equiv \pm1 \pmod n,\,$ hence $\, \pm1 = c+kn = c + ki\,a + kj\,b\,$ thus scaling by $\pm n\,$ yields $n$ as a linear combination of $a,b,c.\,$ Above the first “small” number we see $\, n = \color{#c00}{18\!-\!14} = 4\,$ works since $63\equiv -1\pmod {\!4}.$

The reason for choosing $n$ “small” is that this increases the probability that $\,c\equiv \pm1\pmod{\! n},\,$ e.g. $100\%$ chance if $n = 2,\,$ $67\%$ if $n = 3.\,$ We know (by Bezout) that the smallest such $n$ is $\,\gcd(a,b)\,$ but – as we saw above – often simpler choices work such as $\,b-a.$

More *algorithmically,* we can use the Extended Euclidean Algorithm to compute $\rm\,gcd(63,18,14) = 1\,$ in a couple steps

$$\begin{array}{rrr}

[1]&\ 63& 1& 0& 0\\

[2]&\ 18& 0& 1& 0\\

[3]&\ 14& 0& 0& 1\\

[2] -[3]\, =\, [4]& 4& \!\!0& 1& -1\\

16[4] -[1]\, =\,[5]& 1& -1& 16& \!\!\!\!-16

\end{array}\qquad\qquad\qquad\quad$$

where the row $\ n\,\ a\,\ b\,\ c\,\ d\ $ denotes that $\ n = 63a + 18 b + 14 c.\ $ Thus the final row yields

$$\quad 1 = -63 +16(18) – 16(14)$$

- A Galois Group Problem
- What is the optimal path between $2$ fixed points around an invisible obstructing wall?
- Complete ordered field
- Coordinate functions of Schauder basis
- Requesting abstract algebra book recommendations
- Sums of independent Poisson random variables
- Relationship between Binomial and Bernoulli?
- Solving $\phi(n)=84$
- How does Local Cohomology detect UFD?
- Complex numbers and Roots of unity
- Prove $(a_1+b_1)^{1/n}\cdots(a_n+b_n)^{1/n}\ge \left(a_1\cdots a_n\right)^{1/n}+\left(b_1\cdots b_n\right)^{1/n}$
- what is the current state of the art in methods of summing “exotic” series?
- Normal subgroups of free groups: finitely generated $\implies$ finite index.
- What does the math notation $\sum$ mean?
- Prove that $a^{2^n}=1 \mod 2^{n+2}$