TITLE

# Letters to the Editor

AUTHOR(S)
Hitotumatu, Sin
PUB. DATE
June 2003
SOURCE
Mathematical Intelligencer;Summer2003, Vol. 25 Issue 3, p4
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
Presents an alternative proof for the sum of the first n squares and for the sum of the first n factorials of order two. Association of n squares with the triangular number; Representation of the sum of the first n squares using the tetrahedral number.
ACCESSION #
10265630

## Related Articles

• Recurrence relations for the expansion of Slater-type orbitals about displaced centers. Rico, J. Fernández; López, R. // Journal of Chemical Physics;11/15/1986, Vol. 85 Issue 10, p5890

We show here that the coefficients for the expansion of any Slater-type function over a displaced center can be obtained by three simple (and numerically stable) recurrence relations starting at the expansion coefficients of the 1s or 2s orbitals. We present also compact (and very fast to...

• 100.12 Visual proof of the limit of f-mean recurrence sequences. PLAZA, ÁNGEL // Mathematical Gazette;Mar2016, Vol. 100 Issue 547, p139

In this article, the author prove visually the limit of recurrence sequences obtained by iterative application of any of means such as arithmetic mean, geometric mean and harmonic mean and presents several mathematical formulas and diagrams to prove the same.

• ï¿½-Calculus with Explicit Points and Approximations. DAM, MADS; GUROV, DILIAN // Journal of Logic & Computation;Apr2002, Vol. 12 Issue 2, p255

We present a Gentzen-style sequent calculus for program verification which accommodates both model checking-like verification based on global state space exploration, and compositional reasoning. To handle the complexities arising from the presence of fixed-point formulas, programs with...

• Fibonacci Numbers from a Long Division Formula. Amini, Abbas Roohol // Mathematical Spectrum;2007/2008, Vol. 40 Issue 2, p59

The article focuses on finding the Fibonacci numbers from a long division formula. It states that the Fibonacci sequence has properties too numerous to list, and each property has almost as many ways of proving it. It presents the golden ratio. According to the article, the coefficients, which...

• Circulant determinant sequences with binomial coeÂ±cients. Rabago, Julius Fergy T. // Scientia Magna;2013, Vol. 9 Issue 1, p31

In this note we introduce the concept of circulant determinant sequences with binomial coeÂ±cients and derive formulas for the n-th term of the given sequences as well as the sum of the first n terms.

• Unizeral Numbers. Rose, Mike // Mathematics in School;

The article concerns palindromic number problems, which the article refers to as unizeral numbers. One question asked is if the reader can find two 12-digit palindromic numbers which are exactly divisible by 111. A second question asks if the reader can construct 20-digit palindromic numbers...

• Ultra g-Bessel Sequences in Hubert Spaces. ABDOLLAHPOUR, MOHAMMAD REZA; NAJATI, ABBAS // Kyungpook Mathematical Journal;Mar2014, Vol. 54 Issue 1, p87

In this paper, we introduce ultra g-Bessel sequences and study some properties of this kind of sequences in Hubert spaces. We also show that every g-frame for a finite dimensional Hubert space is an ultra g-Bessel sequence.

• Smarandache bisymmetric geometric determinat sequences. Bueno, Aldous Cesar F. // Scientia Magna;2013, Vol. 9 Issue 3, p107

In this paper, the Smarandache bisymmetric geometric determinant sequence was defined and the formula for its n-th term was obtained.

• A threshold phenomenon for embeddings of $${H^m_0}$$ into Orlicz spaces. Martinazzi, Luca // Calculus of Variations & Partial Differential Equations;Dec2009, Vol. 36 Issue 4, p493

Given an open bounded domain $${\Omega\subset\mathbb {R}^{2m}}$$ with smooth boundary, we consider a sequence $${(u_k)_{k\in\mathbb{N}}}$$ of positive smooth solutions towhere Î» k â†’ 0+. Assuming that the sequence is bounded in $${H^m_0(\Omega)}$$ , we study its blow-up behavior. We...

Share