8 citations · 13 across the 3 of their papers we have counts for
3 papers
math.CO2006★ 4 cited
Calculus proofs of some combinatorial inequalities
Tomislav Došlić, Darko Veljan
Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling n…
math.CO2006★ 1 cited
Logarithmic behavior of some combinatorial sequences
Tomislav Došlić, Darko Veljan
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is ba…
math.MG2004★ 8 cited
Geometry of pentagons: from Gauss to Robbins
Dragutin Svrtan, Darko Veljan, Vladimir Volenec
An almost forgotten gem of Gauss tells us how to compute the area of a pentagon by just going around it and measuring areas of each vertex triangles (i.e. triangles whose vertices…