Intereting Posts

Is $\ 7!=5040\ $ the largest highly composite factorial?
How to Handle Two-Center Bipolar Coordinates?
Converse of mean value theorem
Number of real roots of $\frac{a_1}{a_1-x}+\frac{a_2}{a_2-x}+…+\frac{a_n}{a_n-x}=2016$ for $0<a_1<…<a_n$?
Zero vector of a vector space
A problem about parametric integral
Higher order derivatives of the binomial factor
Show that the set of all infinite subsets of $\mathbb{N}$ has cardinality greater than $\mathbb{N}$
Dirichlet's Divisor Problem
Angle between 2 points
Expected number of times Random Walk crosses 0 line.
When does the kernel of a function equal the image?
$\int\limits_{a}^{b} f(x) dx = b \cdot f(b) – a \cdot f(a) – \int\limits_{f(a)}^{f(b)} f^{-1}(x) dx$ proof
Find the $n^{\rm th}$ digit in the sequence $123456789101112\dots$
Concept of Linearity

A positive integer $n$ is called a balancing number if

$$1 + 2 + \cdots + (n − 1) = (n + 1) + (n + 2) + \cdots + (n + r) \tag{1}$$

for some positive integer $r$.

- Sword, pizza and watermelon
- Help determining best strategy for game?
- Why General Leibniz rule and Newton's Binomial are so similar?
- Evaluating 'combinatorial' sum
- Sum of odd Fibonacci Numbers
- Sum of the series $\binom{n}{0}-\binom{n-1}{1}+\binom{n-2}{2}-\binom{n-3}{3}+…$

Problem:Find the general solution (closed-form expression) of equation $(1)$, in other words, find $f_1(m)=n, f_2(m)=r$ where $f_1, f_2$ are solution of $(1)$ for any integer $m \in \mathbb Z$.

I have asked a similar question with a constrain involving *Pell’s equation*.

- Are there $a,b>1$ with $a^4\equiv 1 \pmod{b^2}$ and $b^4\equiv1 \pmod{a^2}$?
- Why is “working in $\mathbb {Z}_m$” essentially the same as “working with congruences modulo m”?
- IMO 1988, problem 6
- Prove that given any rational number there exists another greater than or equal to it that differs by less than $\frac 1n$
- Asymptotics of binomial coefficients and the entropy function
- 101 positive integers placed on a circle
- How can I prove that $\gcd(a,b)=1\implies \gcd(a^2,b^2)=1$ without using prime decomposition?
- How do I calculate the number of different combinations of multiple sets' elements (different number of elements on each set)?
- Wanted: Insight into formula involving binomial coefficients
- Manipulation of Bell Polynomials

this question has been repeated quite a bit lately. Here is where these numbers were introduced, in 1999, in The Fibonacci Quarterly. Notice how they say $n$ is such a number if and only if $\sqrt {8n^2 +1}$ is a square. It is not on this page, but the simplest description for isolating $n$ is

the degree two linear recurrence,

$$ n_{j+2} = 6 n_{j+1} – n_j, $$

which means you can write $n_j$ as $A \lambda_1^j + B \lambda_2^j,$ with real constants $A,B$ and the lambdas are the two roots of

$$ \lambda^2 – 6 \lambda + 1 = 0. $$ Alright,

$$ n_j = A \left( 3 + \sqrt 8 \right)^j + B \left( 3 – \sqrt 8 \right)^j$$

with $n_0 = 1, n_1 = 6, n_2 = 35,$ and so on.

Alright, calculated, more convenient to absorb numbers into changing the exponent to $j+1,$ so I get

$$ \color{blue}{ n_j = \frac{1}{2 \sqrt 8} \left( \left( 3 + \sqrt 8 \right)^{j+1} – \left( 3 – \sqrt 8 \right)^{j+1} \right)}$$

Yep, works for $j = 0$ and $j = 1.$

Let us name $w_j = \sqrt{ 8 n_j^2 + 1},$

$$ \color{blue}{ w_j = \sqrt{ 8 n_j^2 + 1} = \frac{1}{2 } \left( \left( 3 + \sqrt 8 \right)^{j+1} + \left( 3 – \sqrt 8 \right)^{j+1} \right)}$$

We also get

$$ w_{j+2} = 6 w_{j+1} – w_j. $$

My memory was not completely wrong, I solved this exact problem last Wednesday, posted it somewhere on MSE. Meanwhile, here is enough information to reconstruct everything. The linear recurrence comes from applying Cayley-Hamilton to the “automorphism matrix” below

```
jagy@phobeusjunior:~$ ./Pell_Target_Fundamental
Automorphism matrix:
3 8
1 3
Automorphism backwards:
3 -8
-1 3
3^2 - 8 1^2 = 1
w_j^2 - 8 n_j^2 = 1
Tue Jul 19 12:21:37 PDT 2016
w_j: 3 n_j: 1 ratio: 3 SEED BACK ONE STEP 1 , 0
w_j: 17 n_j: 6 ratio: 2.83333
w_j: 99 n_j: 35 ratio: 2.82857
w_j: 577 n_j: 204 ratio: 2.82843
w_j: 3363 n_j: 1189 ratio: 2.82843
w_j: 19601 n_j: 6930 ratio: 2.82843
w_j: 114243 n_j: 40391 ratio: 2.82843
w_j: 665857 n_j: 235416 ratio: 2.82843
w_j: 3880899 n_j: 1372105 ratio: 2.82843
w_j: 22619537 n_j: 7997214 ratio: 2.82843
Tue Jul 19 12:22:17 PDT 2016
w_j^2 - 8 n_j^2 = 1
jagy@phobeusjunior:~$
```

$$S=\sum_{k=1}^{n-1}k$$

$$S_1=\sum_{k=1}^r(n+k)$$

the solution of the problem is given by:

$S-S_1=0$ anfd you get:

$$n=r+\dfrac{1}{2}+\dfrac{1}{2}\sqrt{(8r^2+8r+1)}$$

or:

$$n=r+\dfrac{1}{2}-\dfrac{1}{2}\sqrt{(8r^2+8r+1)}$$

As in the other answer, $n = r + 1/2 + 1/2 \cdot \sqrt{2(2r+1)^2-1}$. For $n$ to be an integer we need $t^2 = 2(2r+1)^2-1$ for some odd $t$. The solutions of $t^2-2u^2=-1$ are parameterized by $t+u\sqrt{2} = (1+\sqrt{2})^n$ for odd integers $n$ and will necessarily have $t,u$ odd (examine it mod 8). So for any such $t+u\sqrt{2}$, set $r = (u-1)/2$ and $n = (u-1)/2 + (t+1)/2$

- Codimension 1 homology represented by Embedded Submanifold
- $\varepsilon – \delta$ proof that $f(x) = x^2 – 2$ is continuous – question concerning the initial choice of $\delta$
- A function and its Fourier transform cannot both be compactly supported
- Is there a simple way to prove Bertrand's postulate from the prime number theorem?
- Probability of two people meeting in a given square grid.
- “If $A^2-2AB+B^2=0$, then $(A-B)^2=0$” is true. How about $n$-th degree case?
- The locker problem – why squares?
- Borel Measures: Atoms (Summary)
- A 3-minute algebra problem
- Question of Clifford theory
- Splitting of primes in an $S_3$ extension
- Is this a general structure for constructs?
- Example of quotient mapping that is not open
- The number of ones in a binary representation of an integer
- Finiteness of expected values for independent random variables