Intereting Posts

Importance of 'smallness' in a category, and functor categories
Every maximal ideal is principal. Is $R$ principal?
Pedagogy: How to cure students of the “law of universal linearity”?
Tiling of regular polygon by rhombuses
How to show that the norm of a fractional ideal is well-defined?
Proving $(A\le B)\vee (B\le A)$ for sets $A$ and $B$
Residue at essential singularity
Monotonic, surjective function
what is the relation of smooth compact supported funtions and real analytic function?
k-regular simple graph without 1-factor
Evaluate a finite sum with four factorials
Proving an entire, complex function with below bounded modulus is constant.
Multiplication of a random variable with constant
Is $\sum\frac1{p^{1+ 1/p}}$ divergent?
Definite integral of an odd function is 0 (symmetric interval)

How many ways are there to write the number $675$ as a difference of two squares?

Is there a way to generalize this?

- Numbers of the form $\frac{xyz}{x+y+z}$
- Why is Euler's Totient function always even?
- How can I prove the Carmichael theorem
- Fermat: Last two digits of $7^{355}$
- 2 is a primitive root mod $3^h$ for any positive integer $h$
- Proof that $a^5 b - b^5 a$ is divisible by $30$ for any integers $a$ and $b$

- Are there infinitely many Mersenne primes?
- If $n\in\mathbb N$ and $k\in\mathbb Z$, solve $n^3-32n^2+n=k^2$.
- Let $a,b \in {\mathbb{Z_+}}$ such that $a|b^2, b^3|a^4, a^5|b^6, b^7|a^8 \cdots$, Prove $a=b$
- If $\gcd(a, b) = 1$ and if $ab = x^2$, prove that $a, b$ must also be perfect squares; where $a,b,x$ are in the set of natural numbers
- Let $a_1,a_2,\cdots,a_n$ be n numbers such that $a_i$ is either 1 or -1.If $a_1a_2a_3a_4+\cdots+a_na_1a_2a_3=0$ then prove that 4|n.
- How to show that $7\mid a^2+b^2$ implies $7\mid a$ and $7\mid b$?
- $\sum_{k=0}^n \binom{n}{k}^2 = \binom{2n}{n}?$
- Division problem
- Computing the Legendre symbol $\bigl(\frac{3}{p}\bigr)$ using Gauss' Lemma
- Does this polynomial evaluate to prime number whenever $x$ is a natural number?

Suppose we have to solve $a^2-b^2 = n$.

Write $n = pq$ where $p$ and $q$ have the same parity ( $p \equiv q \mod 2$) and assume $p \geq q$.

Clearly:

$$\left(\dfrac{p+q}2\right)^2 – \left(\dfrac{p-q}2\right)^2 = pq = n$$.

Now, show that if $p$ and $q$ don’t have the same parity, then $a+b=p$ and $a-b=q$ cannot be solved in integers.

**More information:** In the case of $675 = 25 \times 27 = pq$, we want $p$ and $q$ to be both odd. But all divisors of $675$ are odd. $675$ has $12$ divisors (why?). now only half of them will have $p \geq q$. So $675$ can be written as a difference of two squares in $6$ different ways.

Now let’s explicitly list these $6$ ways using our observation. Notice:

$$675= 675 \cdot 1 = 135 \cdot 5 = 27 \cdot 25 = 75 \cdot 9 = 225 \cdot 3 = 45 \cdot 15=p\cdot q.$$

The corresponding solutions using $a = \dfrac{p+q}2, b = \dfrac{p-q}2$ are:

$$675 = 338^2 – 337^2.$$

$$675 = 70^2 – 65^2.$$

$$675 = 26^2 – 1^2.$$

$$675 = 42^2 – 33^2.$$

$$675 = 114^2 – 111^2.$$

$$675 = 30^2 – 15^2.$$

675 is a small number.

So we can cheat. Let’s examine $(x+1)^2-x^2 \ge 675$. This is the same as $2x+1 \ge 675$ (expand it and check), or $x \ge 337$.

This means that beyond 338, adjacent squares are more than 675 apart. Squares further apart than that will be further than 675 apart as well. So our answer lies at or below 338.

Simply check the difference of squares of every pair of numbers from 1 to 338 — there are only 113 thousand of them. Those that equal 675 are your complete answers.

At this stage, a computer may help.

link to such a program

Output:

```
26^2 - 1^2 = 675
30^2 - 15^2 = 675
42^2 - 33^2 = 675
70^2 - 65^2 = 675
114^2 - 111^2 = 675
338^2 - 337^2 = 675
```

The nice thing about this approach, while inelegant (114 thousand cases to check?!), it requires only convincing yourself that the upper limit is valid and that the program does indeed do the checks of all of the cases.

(The above assumes that the domain in question is the natural numbers (positive integers). If it is a larger domain, there are more answers: negatives in the integers, and in the reals there are plenty of answers. Showing that in the rationals there are no more answers than in the integers is a fun problem.)

I agree with this logic the answer appears to be 6 ways. However there are actually 24 ways because each number to be squared can be either positive or negative, thus producing 24 ways to write the equation.

- Sum of two closed sets in $\mathbb R$ is closed?
- An eigenvalue problem for positive semidefinite matrix
- How to show that a continuous map on a compact metric space must fix some non-empty set.
- Functions determine geometry … Riemannian / metric geometry?
- Symmetric Tridiagonal Matrix has distinct eigenvalues.
- Proving $nk = kn$
- Proving that every countable metric space is disconnected?
- $\sin 1^\circ$ is irrational but how do I prove it in a slick way? And $\tan(1^\circ)$ is …
- Approaching a contour integral with singularities on each axis
- About closure under +
- Proving that any polynomial $p:\mathbb{R}\rightarrow \mathbb{R}$ is not bounded, but its restriction to any bounded set is bounded
- Example of an additive functor admitting no right derived functor
- How do I solve a linear Diophantine equation with three unknowns?
- Problem in Cardinality and Order
- Properties of dual spaces of sequence spaces