arXiv (All)
open access
On the Frobenius Coin Problem in Three Variables
The three-variable Frobenius coin problem asks for the largest integer that cannot be represented as a non-negative integer combination of three positive integers $a_1<a_2<a_3$ with $\gcd(a_1,a_2,a_3)=1$. We introduce an algorithmic framework based on two synchronized Euclidean-division sequences. T
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Integer programming on domains containing inseparable ordered pairs#658859
- $13$ unknowns over quadratic integer rings and Lucas congruences#799593
- Skew braces whose left series is not generated by right-normed star products#1037366
- A Polynomial-Time Attack on the McEliece Cryptosystem on Elliptic Codes with Arbitrary Divisors#1011456
- Rotational Symmetric Power Divider and Multiport Power Divider#1025034
Record · ID 972834
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive