On a linear Diophantine problem of Frobenius.
Tripathi, Amitabha (2006)
Integers
Similarity:
Displaying similar documents to “Full subsets of .”
On a linear Diophantine problem of Frobenius.
A simple proof of the geometric-arithmetic mean inequality.
Uchida, Yasuharu (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
A common generalization of some identities.
Zhang, Zhizheng, Wang, Jun (2005)
Integers
Similarity:
On variants of Conway and Conolly's meta-Fibonacci recursions.
Isgur, Abraham, Rahman, Mustazee (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Characterizing Frobenius semigroups by filtration.
Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)
Journal of Integer Sequences [electronic only]
Similarity:
A curious identity involving binomial coefficients.
Sun, Zhiwei (2002)
Integers
Similarity:
Two coefficients of the Dyson product.
Lv, Lun, Xin, Guoce, Zhou, Yue (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some local asymptotic laws for the Cauchy process on the line.
Okoroafor, A.Chukwuemeka (2007)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Concerning the convergence of a modified Newton-like method.
Argyros, Ioannis K. (1999)
Zeitschrift für Analysis und ihre Anwendungen
Similarity:
A new part-metric-related inequality chain and an application.
Yang, Xiaofan, Sun, Fangkuan, Tang, Yuan Yan (2008)
Discrete Dynamics in Nature and Society
Similarity:
A counterexample to a conjecture of Erdős, Graham and Spencer.
Guo, Song (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regular Expression Quantifiers - m to n Occurrences
Michał Trybulec (2007)
Formalized Mathematics
Similarity:
This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: m to n occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0...
Totally greedy coin sets and greedy obstructions.
Cowen, L.J., Cowen, Robert, Steinberg, Arthur (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: