Theorem :
If Mersenne number can be uniquely written in the form : $x^2+3 \cdot y^2$ ,
where $\gcd(x,y)=1$ and $x,y \geq 0$ then that number is a prime number .
Primality test for Mersenne numbers written in Maple code :
My question : Why this test is considered to be less practical than Lucas-Lehmer primality test ?