0

How do I solve this by prime factorization?

I came across a similar problem on MSE just recently, but I can't find it and I thoroughly searched for it. If anyone can find it, please post it in the comment so that I can delete this question.


Update: I don't know if it makes a difference, but please note that this is cubed root


3 Answers3

1

suppose so then

$$m^3 = 3n^3$$

but if that's true then the prime 3 divides $m$, so write $m = 3m'$ and we have

$$9m'^3 = n^3$$

and so n is a multiple of 3 too, put $n = 3n'$ and we have

$$m'^3 = 3n'^3$$

but this $(m',n')$ pair is smaller than $(m,n)$ so we have infinite descent proving there is no solution

shobon
  • 755
1

Let $r=\frac{m}{n}$ s.t $\gcd(m,n)=1$ and $r^3=1$ then we have $m^3=3n^3$ and since $\gcd(m^3,n^3)=1$ then $3$ divides $m^3$ and since $3$ is prime number then $3$ divides $m$ so $m=3m'$ and then we have $9m'^3=n^3$ and $\gcd(m',n)=1$ so $3$ divides $n$ which is absurd.

0

Suppose there is such a rational number. We may assume that $r = \frac{m}{n}$ where $\gcd(m,n) = 1$. Whence, $m^3 = 3n^3$ so that $3 \mid m$. Set $m = 3m_1$, the previous equality implies $9m_1^3 = n$ so that $3 \mid n$, a contradiction to the assumption that $\gcd(m,n) = 1$.