Archimedes's cattle problem
A problem in number theory with a very large solution, attributed to Archimedes
Archimedes's cattle problem (or the problema bovinum or problema Archimedis) is a problem in Diophantine analysis, the study of polynomial equations with integer solutions. Attributed to Archimedes, the problem involves computing the number of cattle in a herd of the sun god from a given set of restrictions.
Nº Q2030594 ★★
Uncommon · Knowledge
Archimedes's cattle problem
A problem in number theory with a very large solution, attributed to Archimedes
Archimedes's cattle problem (or the problema bovinum or problema Archimedis) is a problem in Diophantine analysis, the study of polynomial equations with integer solutions. Attributed to Archimedes, the problem involves computing the number of cattle in a herd of the sun god from a given set of restrictions.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Archimedes's cattle problem (or the problema bovinum or problema Archimedis) is a problem in Diophantine analysis, the study of polynomial equations with integer solutions. Attributed to Archimedes, the problem involves computing the number of cattle in a herd of the sun god from a given set of restrictions. The problem was discovered by Gotthold Ephraim Lessing in a Greek manuscript containing a poem of 44 lines, in the Herzog August Library in Wolfenbüttel, Germany in 1773. The problem remained unsolved for a number of years, due partly to the difficulty of computing the huge numbers involved in the solution. The general solution was found in 1880 by Carl Ernst August Amthor (1845–1916), headmaster of the Gymnasium zum Heiligen Kreuz (Gymnasium of the Holy Cross) in Dresden, Germany. Using logarithmic tables, he calculated the first digits of the smallest solution, showing that it is about 7.76×10206544 cattle, far more than could fit in the observable universe. The decimal form is too long for humans to calculate exactly, but multiple-precision arithmetic packages on computers can write it out explicitly.
Text: Wikipédia, CC BY-SA 4.0. · Image: cmglee, James Keuning (CC BY-SA 4.0) ·
Related cards
Basel problem
Mathematical problem
Nº Q810431 ★★★
Angle trisection
Construction of an angle equal to one third a given angle
Nº Q733081 ★★
Dining philosophers problem
Problem used to illustrate synchronization issues and techniques for resolving them
Nº Q865867 ★★★
Entscheidungsproblem
In computer science, the impossible task of algorithmically determining whether a given statement is provable from the axioms
Nº Q11030584 ★★
Chess problem
Problem made with chess
Nº Q211115 ★★
Hilbert's sixth problem
Whether the mathematical axiomatic method may be extended to physics
Nº Q10370880 ★★