If $a^3+a^2+a=9b^3+b^2+b$ and $a,b$ are integers then show $a-b$ is a perfect cube. If $a^3+a^2+a=9b^3+b^2+b$ and $a,b$ are integers then show $a-b$ is a perfect cube.
My attempt:I factorized it like below:
$(a-b)(a^2+b^2+ab+a+b+1)=8b^3=(2b)^3$
I take $gcd(a-b,a^2+b^2+ab+a+b+1)=d$
If $d=1$ then it is clear that $a-b$ is a perfect cube then consider $d>1$ then there is a $p$ that is prime and $p \mid d$.We have :
$p\mid a-b \Rightarrow p \mid (2b)^3 \Rightarrow p \mid 2b \Rightarrow p\mid 2$ or $p\mid b$
If $p\mid b$ then also $p\mid a$ (as $p\mid a-b$ holds). Then we will get to $p \mid 1$ because:
$ p \mid a^2+b^2+ab+a+b,p \mid a^2+b^2+ab+a+b+1 \Rightarrow p \mid 1$
which is clearly wrong then we have $p\mid 2$ so $p=2$ means $d=2^k$ where $k$ is a natural number including $0$.In the case $d=1$ we have the right result.So assemble $k \ge 1$.Because $2 \mid a-b$ we can conclude that $a,b$ have the same parity @Ghartal showed in his answer that if $a,b$ are both even we have a right result but if $a,b$ are both odd we don't.So maybe we have to prove $a,b$ can,t be both odd.
 A: Note: This is not a complete solution. It may give others some clues.
We have that $$(a-b)(a^2+b^2+ab+a+b+1)=8b^3 \tag{1}$$ Let 
$$d=\gcd(a-b, a^2+b^2+ab+a+b+1).$$
And let $p$ be an odd prime divisor of $d$. Then $p \mid a-b$ and $p \mid b$. It follows that $p|a$. Since $p \mid a^2+b^2+ab+a+b+1$ we get $p \mid 1$. Contradiction. Thus only prime divisor of $d$ is $2$.
From equation $(1)$ observe that $a$ and $b$ have the same parity. Thus $a-b$ is even. So let $a-b=c=2^k (2l+1)$, where $l$ is an integer. Equation $(1)$ becomes.
$$c(3b^2+c^2+3bc+2b+c+1)=8b^3 \tag{2}$$
Notice that if $b$ is an even number then $3b^2+c^2+3bc+2b+c+1$ will be odd. Hence 
$$d=\gcd\big(c, 3b^2+c^2+3bc+2b+c+1\big)=1.$$ And $c$ is a perfect cube. Now, suppose that $b$ is odd. Then, since $3b^2+1 \equiv 0 \pmod{4}$ we get
$$3b^2+c^2+3bc+2b+c+1=3b^2+1+c(c+1+3b)+2b \\ =4m+2b=2(2m+b)$$Thus the highest power of $2$ dividing LHS of equation $(2)$ is $k+1$. And since $v_2($RHS$)=3$ we get that $k=2$. Thus $a-b=4(2l+1)$ cannot be a cube.
Maybe in this case there is no solution for the equation at all.
A: It turns out that there are only two rational solutions of
$a^3+a^2+a = 9b^3+b^2+b$.  One is the obvious integer solution
$(a,b)=(0,0)$, for which $a-b$ is the cube $0$.
The other is $(a,b) = (-7/5, -3/5)$, for which $a-b = -4/5$
is not a cube but $a,b$ are not integers.  So $a-b$ is indeed
a cube for all the integer solutions, as desired.
The proof that there are no other rational solutions is elementary,
but requires Fermat's method of descent.  The equation
$a^3+a^2+a = 9b^3+b^2+b$ defines a smooth cubic curve with
a rational point at $(a,b)=(0,0)$, so it's an elliptic curve
that we can bring to standard form $y^2=\text{cubic}(x)$ by
projecting from the origin.
Let $(a,b)$ be any rational solution other than $(0,0)$.
Then $b\neq 0$ because the nonzero solutions of $a^3+a^2+a$
are not rational (or even real). Write $a=mb$ and divide by $b$ to get
$$
(9-m^3) b^2 + (1-m^2) b + (1-m) = 0.
$$
This equation is quadratic in $b$, so it has rational solutions iff
the discriminant is a square.  The discriminant is
$$
-3 m^4 + 4 m^3 - 2 m^2 + 36 m - 35 = (1-m)(3m-7)(m^2+2m+5).
$$
Taking $m=1$ yields $8b^2 = 0$, so we're back to the $b=0$ solution;
and $m=7/3$ yields $-4(5b+3)^2/27 = 0$, so $b=-3/5$ and $a=-7/5$.
We claim that there are no other solutions.
If $m\neq 1$ we may write $m = 1+(8/x)$ and calculate
$$
-3 m^4 + 4 m^3 - 2 m^2 + 36 m - 35 = \frac{2^8}{x^4} (x^3-2x^2-16x-48),
$$
so we seek rational points on the elliptic curve
$$
y^2 = x^3-2x^2-16x-48 = (x-6)(x^2+4x+8)
$$
other than the "point at infinity".
The point $(x,y)=(6,0)$ brings us back to $m = 1 + (8/6) = 7/3$,
and it turns out there are no others.  Since the cubic on the right-hand side 
has a linear factor, we can try to prove this using Fermat's descent,
which turns out to be enough.  But these days there are other
resources we can try first: Cremona's mwrank or the
LMFDB, and either of these
tells us that there are no other solutions and that Fermat-style descent
suffices to prove it.  In the case of mwrank we'd need a bit of
additional computation to exclude other torsion points, so let's go the
database route: enter the coefficients [0,-2,0,-16,-48] into the
"curve, label or isogeny class label" search window for
elliptic curves
over $\bf Q$, and find the entry for
this curve of
conductor 544 (which is small enough that it's also in Cremona's book).
We find that the curve has only the known two torsion points
and rank zero, and moreover that the 2-part of the Tate-Shafarevich group
is trivial, so a 2-descent suffices to establish rank zero.
This completes the proof.
A: Revised proof:
We have $(a-b)(a^2 + b^2 + ab + a + b + 1) = (2b)^3$
From OP, we see that if $p$ divides $d$ then $p$ divides $2b \implies p \mid 2$ or $p \mid b$. 
Assume $p$ doesn't divide $2$. 
$p \mid b \implies p \mid a$ but then $p$ does not divide $a^2+b^2+ab +a+b+1$. 
Therefore $p=1$ or $p=2$. If $p=1$ then $a-b$ is a cube. 
If $p=2$ then since $p$ does not divide $b$ both $a$ and $b$ are odd. 
Now $a^2 + b^2 + ab + a + b + 1 \ne 0 \mod 4$. Therefore largest power
 of $2$ in $a^2 + b^2 + ab + a + b + 1$ is $2$. 
Largest power of $2$ in $a-b$ should be $4$ (as $b$ is odd)
So one possibility is $a-b = 4m^3$ and $a^2 + b^2 + ab + a + b + 1 = 2n^3$ where $b = mn$
I guess I am stuck at this point. 
A: Let us consider the Diophantine equation
$$(a-b)(a^2+ab+b^2+a+b+1) = 8b^3.\tag1$$
Let $\ \gcd(a,b) = d.$
$\text{If }\mathbf {d > 1,}\text{ then }a=md,\quad b=nd,\quad \gcd(m,n) = 1,$
$$(m-n)\left((m^2+mn+n^2)d^2 + (m+n)d + 1\right) = 8d^2n^3.\tag2$$
${\text{If }\mathbf{2\mid d},\ \text{then}}$ 
$$2\mid m-n,\quad 2\nmid (m^2+mn+n^2)d^2 + (m+n)d + 1,$$
$$d\mid m-n,\quad \gcd(d, m^2+mn+n^2)d^2 + (m+n)d + 1) = 1,$$
so
$$m-n=\pm8d^2,\quad (m^2+mn+n^2)d^2 + (m+n)d + 1 = \pm n^3,$$
$$a-b = \pm8d^3 = (\pm2d)^3.$$
$\text{If }\mathbf {(d > 2)\wedge (d\nmid2),}\text{ then the case } (2\nmid m+n)\text{ contradicts with (2), so }$
$$2\nmid m,\quad 2\nmid n,\quad (m-n=\pm 2d^2) \vee (m-n = \pm4d^2),$$
$$\left[\begin{align}
&\begin{cases}
m = n\pm2d^2\\
4d^6 - 3d^2n(n\pm2d^2) + 2d(n\pm d^2) + 1 = \pm4n^3
\end{cases}\\
&\begin{cases}
m = n\pm4d^2\\
16d^6 - 3d^2n(n\pm4d^2) + 2d(n\pm2d^3) + 1 = \pm2n^3,
\end{cases}
\end{align}\right.$$
$$\left[\begin{align}
&\begin{cases}
m = n\pm2d^2\\
\mp4n^3 - 3d^2n^2 + 2d(1\mp3d^3)n + 4d^6 \pm2d^3  + 1 = 0
\end{cases}\\
&\begin{cases}
m = n\pm4d^2\\
\mp2n^3 - 3d^2n^2 + 2d(1\mp6d^2)n + 16d^6 \pm4d^3 + 1 = 0,
\end{cases}
\end{align}\right.$$
and both of systems leads to the same equation without solutions
$$d^2n^2+1\equiv0\pmod4.$$
$\text{If }\mathbf {d = 1,}\text{ then the proof of the previous case is valid. Solutions also do not.}$
Thus, the issue equation has the integer solutions only in the case $\mathbf{2\nmid \gcd(a,b)},$
when $\mathbf{a-b}\ $ is a perfect cube.
