Coin problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Coin problem" in English language version.

Last modified: 18:27:44, 26 March 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1010doi.org

2^nd place

33semanticscholar.org

15^th place

8^th place

33arxiv.org

49^th place

31^st place

32wolfram.com

1,091^st place

1,169^th place

31oup.com

292^nd place

233^rd place

22jstor.org

23^rd place

15^th place

22archive.org

6^th place

11combinatorics.org

low place

11icm.edu.pl

1,395^th place

4,083^rd place

11adsabs.harvard.edu

14^th place

9^th place

11emis.de

low place

11mathedpage.org

low place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Ustinov, A. (2009). "The solution of Arnold's problem on the weak asymptotics of Frobenius numbers with three arguments". Sbornik: Mathematics. 200 (4): 131–160. Bibcode:2009SbMat.200..597U. doi:10.1070/SM2009v200n04ABEH004011.

archive.org (Global: 6^th place; English: 6^th place)

Sylvester, James Joseph (1884). "Question 7382". Mathematical Questions from the Educational Times. 41: 21.
Picciotto, Henri (1987). "Math McPuzzle". Games Magazine. 85 (April/May): 52.

arxiv.org (Global: 49^th place; English: 31^st place)

M. Beck; S. Zacks (2004). "Refined upper bounds for the linear Diophantine problem of Frobenius". Adv. Appl. Math. 32 (3): 454–467. arXiv:math/0305420. doi:10.1016/S0196-8858(03)00055-1. S2CID 119174157.
Moscariello, A.; Sammartano, A. (2015). "On a Conjecture by Wilf About the Frobenius Number". Mathematische Zeitschrift. 280 (1–2): 47–53. arXiv:1408.5331. doi:10.1007/s00209-015-1412-0.
Lee, S.H.; O'neill, C.; Van Over, B. (2019). "On arithmetical numerical monoids with some generators omitted". Semigroup Forum. 98 (2): 315–326. arXiv:1712.06741. doi:10.1007/s00233-018-9952-3. S2CID 119143449.

combinatorics.org (Global: low place; English: low place)

D. Beihoffer; J. Hendry; A. Nijenhuis; S. Wagon (2005). "Faster algorithms for Frobenius numbers". Electronic Journal of Combinatorics. 12: R27. doi:10.37236/1924.

doi.org (Global: 2^nd place; English: 2^nd place)

Ravi Kannan (1992). "Lattice translates of a polytope and the Frobenius problem". Combinatorica. 12 (2): 161–177. doi:10.1007/BF01204720. S2CID 19200821.
D. Beihoffer; J. Hendry; A. Nijenhuis; S. Wagon (2005). "Faster algorithms for Frobenius numbers". Electronic Journal of Combinatorics. 12: R27. doi:10.37236/1924.
Sylvester, James Joseph (1882). "On subinvariants, i.e. Semi-Invariants to Binary Quantics of an Unlimited Order". American Journal of Mathematics. 5 (1): 134. doi:10.2307/2369536. JSTOR 2369536.
Skupień, Zdzisław (1993). "A generalization of Sylvester's and Frobenius' problems" (PDF). Acta Arithmetica. LXV.4 (4): 353–366. doi:10.4064/aa-65-4-353-366.
Tripathi, A. (2017). "Formulae for the Frobenius number in three variables". Journal of Number Theory. 170: 368–389. doi:10.1016/j.jnt.2016.05.027.
M. Beck; S. Zacks (2004). "Refined upper bounds for the linear Diophantine problem of Frobenius". Adv. Appl. Math. 32 (3): 454–467. arXiv:math/0305420. doi:10.1016/S0196-8858(03)00055-1. S2CID 119174157.
Ustinov, A. (2009). "The solution of Arnold's problem on the weak asymptotics of Frobenius numbers with three arguments". Sbornik: Mathematics. 200 (4): 131–160. Bibcode:2009SbMat.200..597U. doi:10.1070/SM2009v200n04ABEH004011.
Wilf, H.S. (1978). "A Circle-Of-Lights Algorithm for the "Money-Changing Problem"". The American Mathematical Monthly. 85 (7): 562–565. doi:10.2307/2320864. JSTOR 2320864.
Moscariello, A.; Sammartano, A. (2015). "On a Conjecture by Wilf About the Frobenius Number". Mathematische Zeitschrift. 280 (1–2): 47–53. arXiv:1408.5331. doi:10.1007/s00209-015-1412-0.
Lee, S.H.; O'neill, C.; Van Over, B. (2019). "On arithmetical numerical monoids with some generators omitted". Semigroup Forum. 98 (2): 315–326. arXiv:1712.06741. doi:10.1007/s00233-018-9952-3. S2CID 119143449.

emis.de (Global: low place; English: low place)

Ong, Darren C.; Ponomarenko, Vadim (2008). "The Frobenius Number of Geometric Sequences". INTEGERS: The Electronic Journal of Combinatorial Number Theory. 8 (1): A33. Retrieved 2010-01-04.

icm.edu.pl (Global: 1,395^th place; English: 4,083^rd place)

matwbn.icm.edu.pl

Skupień, Zdzisław (1993). "A generalization of Sylvester's and Frobenius' problems" (PDF). Acta Arithmetica. LXV.4 (4): 353–366. doi:10.4064/aa-65-4-353-366.

jstor.org (Global: 23^rd place; English: 15^th place)

Sylvester, James Joseph (1882). "On subinvariants, i.e. Semi-Invariants to Binary Quantics of an Unlimited Order". American Journal of Mathematics. 5 (1): 134. doi:10.2307/2369536. JSTOR 2369536.
Wilf, H.S. (1978). "A Circle-Of-Lights Algorithm for the "Money-Changing Problem"". The American Mathematical Monthly. 85 (7): 562–565. doi:10.2307/2320864. JSTOR 2320864.

mathedpage.org (Global: low place; English: low place)

Wah, Anita; Picciotto, Henri (1994). "Lesson 5.8 Building-block Numbers" (PDF). Algebra: Themes, Tools, Concepts. p. 186.

oup.com (Global: 292^nd place; English: 233^rd place)

academic.oup.com

Ramírez Alfonsín, Jorge L. (1 December 2005). The Diophantine Frobenius Problem. Oxford University Press. ISBN 9780191718229. Retrieved 8 December 2025.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Ravi Kannan (1992). "Lattice translates of a polytope and the Frobenius problem". Combinatorica. 12 (2): 161–177. doi:10.1007/BF01204720. S2CID 19200821.
M. Beck; S. Zacks (2004). "Refined upper bounds for the linear Diophantine problem of Frobenius". Adv. Appl. Math. 32 (3): 454–467. arXiv:math/0305420. doi:10.1016/S0196-8858(03)00055-1. S2CID 119174157.
Lee, S.H.; O'neill, C.; Van Over, B. (2019). "On arithmetical numerical monoids with some generators omitted". Semigroup Forum. 98 (2): 315–326. arXiv:1712.06741. doi:10.1007/s00233-018-9952-3. S2CID 119143449.

Coin problem (English Wikipedia)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

combinatorics.org (Global: low place; English: low place)

doi.org (Global: 2^nd place; English: 2^nd place)

emis.de (Global: low place; English: low place)

icm.edu.pl (Global: 1,395^th place; English: 4,083^rd place)

matwbn.icm.edu.pl

jstor.org (Global: 23^rd place; English: 15^th place)

mathedpage.org (Global: low place; English: low place)

oup.com (Global: 292^nd place; English: 233^rd place)

academic.oup.com

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

wolfram.com (Global: 1,091^st place; English: 1,169^th place)

mathworld.wolfram.com

Coin problem (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

combinatorics.org (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

emis.de (Global: low place; English: low place)

icm.edu.pl (Global: 1,395th place; English: 4,083rd place)

matwbn.icm.edu.pl

jstor.org (Global: 23rd place; English: 15th place)

mathedpage.org (Global: low place; English: low place)

oup.com (Global: 292nd place; English: 233rd place)

academic.oup.com

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

wolfram.com (Global: 1,091st place; English: 1,169th place)

mathworld.wolfram.com

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

icm.edu.pl (Global: 1,395^th place; English: 4,083^rd place)

jstor.org (Global: 23^rd place; English: 15^th place)

oup.com (Global: 292^nd place; English: 233^rd place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

wolfram.com (Global: 1,091^st place; English: 1,169^th place)