We investigate here the representability of integers as sums of triangular numbers, where the n-th triangular number is given by Tn = n(n+1)/2. In particular, we show ...
We describe an algorithm for linear and convex quadratic programming problems that uses power series approximation of the weighted barrier path that passes through the current iterate in order to find ...
A mathematician at Carnegie Mellon University has developed an easier way to solve quadratic equations. The mathematician hopes this method will help students avoid memorizing obtuse formulas. His ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results