Primitive Integer Solutions of x^4 + 3y^3 + 2z^3 = 0
We determine the primitive integer solutions of x^4 + 3y^3 + 2z^3 = 0. They are exactly (1,-1,1) and (-1,-1,1), where primitivity means gcd(x,y,z)=1. A fourth-power descent in Q(∛12) produces four plane quartics. A congruence modulo 4 excludes two of them for primitive input. We determine the rational points on the other two by elliptic descent, finite reduction sieves, and elliptic Chabauty. For the final quartic, an explicit nonzero Cassels–Tate pairing sharpens a rank-three descent bound to rank one. All finite certificates and their verification programs accompany the proof.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2609.00132
curl -X POST /api/v1/records/hexagon/2609.00132/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2609.00132/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'