On computing the measurable amounts of the two jugs problem

DOI10.1007/S11786-015-0242-0MaRDI QIDQ904536zbMATH OpenOpenAlexFDO

Authors Yiu-Kwong Man

Publication date 13 January 2016

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-015-0242-0

zbMATH Keywords

Diophantine equationjugs filling problemmathematical algorithmmeasurable amountsstaircase diagram

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16) Diophantine equations (11D99)

Recommendations

• Measuring with jugs
• Solving the water jugs problem by an integer sequence approach
• Jug measuring: algorithms and complexity
• Sharing jugs of wine
• scientific article; zbMATH DE number 140086

Cites work

• scientific article; zbMATH DE number 5967590 (Why is no real title available?)
• scientific article; zbMATH DE number 3266283 (Why is no real title available?)
• scientific article; zbMATH DE number 3099224 (Why is no real title available?)
• Sharing jugs of wine
• Solving the water jugs problem by an integer sequence approach

Cited in

(3)

• Solving the water jugs problem by an integer sequence approach
• Jug measuring: algorithms and complexity
• Measuring with jugs

Describes a project that uses

Uses Software

• Excel

This page was built for publication: On computing the measurable amounts of the two jugs problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904536)