From charlesreid1

Revision as of 21:19, 17 June 2026 by Admin (talk | contribs) (Create Project Euler/251 - Cardano Triplets (via create-page on MediaWiki MCP Server))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem Statement

Cardano Triplets

A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:

∛(a + b√c) + ∛(a - b√c) = 1

For example, (2,1,5) is a Cardano Triplet.

There exist exactly 149 Cardano Triplets for which a+b+c ≤ 1000.

Find how many Cardano Triplets exist for which a+b+c ≤ 110,000,000.

Flags