Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Calvin T. Long"'
Mathematical Reasoning for Elementary Teachers presents the mathematical content needed for teaching within the context of the elementary classroom, giving future teachers the motivation they need while also showing them the bigger picture of when th
Long/DeTemple/Millman's Mathematical Reasoning for Elementary Teachers presents the mathematical content needed for teaching within the context of the elementary classroom, giving future teachers the motivation they need while also showing them the b
Autor:
Calvin T. Long
Publikováno v:
The Mathematical Gazette. 76:371-377
Twelve golf balls appear identical, but eleven weigh exactly the same while one ball is either lighter or heavier than the others. Determine the “odd ball” and whether it is lighter or heavier than the others in just three weighings of the balls
Autor:
Calvin T. Long
Publikováno v:
The Mathematical Gazette. 75:299-303
Mathematical magic, properly used, can play an important role in the mathematics classroom. Students need to be motivated to study mathematics (or any subject), and unusual and unexpected results, though sometimes frivolous, often provide more effect
Autor:
William D. Jamski, Calvin T. Long
Publikováno v:
Mathematics Teaching in the Middle School. 4:40-42
A light fare to whet your mathematical appetite.
Autor:
William A. Webb, Calvin T. Long
Publikováno v:
Applications of Fibonacci Numbers ISBN: 9789401061070
In this paper we consider the number of fundamental solution possessed by the Pell equation $$ {u^2} - 5{v^2} = - 4{r^2} $$ (1) where r is a given positive integer. In [2], it is shown that (1) has only the fundamental solutions \( \pm r + r\sqrt 5 \
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07e9c06757d108c00647b5a688f43e37
https://doi.org/10.1007/978-94-011-5020-0_31
https://doi.org/10.1007/978-94-011-5020-0_31
Autor:
Calvin T. Long, William A. Webb
Publikováno v:
Applications of Fibonacci Numbers ISBN: 9789401061070
The Euclidean algorithm has been analyzed in detail, particularly with regard to the number of steps needed. In 1845 Lame proved that if the Euclidean algorithm for (a,b) with a > b > 0 requires exactly n divisions and the number a is minimal, then a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52c16e85a56e88be738e0ea3c1956d96
https://doi.org/10.1007/978-94-011-5020-0_30
https://doi.org/10.1007/978-94-011-5020-0_30
Autor:
Calvin T. Long
Publikováno v:
Applications of Fibonacci Numbers ISBN: 9789401073523
Interest in binomial Fibonacci identities goes back at least to E. Lucas [8] who obtained formulas like $$\sum\limits_{i = 0}^r {\left( {_i^r} \right)} {F_{n + 1 = }}{F_{n + 2r}} and \sum\limits_{i = 0}^r {\left( {_i^r} \right){L_{n + i}}} = {L_{n +
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dae989e2afa793cb6453bda73f0161f0
https://doi.org/10.1007/978-94-009-1910-5_28
https://doi.org/10.1007/978-94-009-1910-5_28
Autor:
Boyd Henry, Calvin T. Long
Publikováno v:
The College Mathematics Journal. 32:135
has rational solutions if and only if n = r(F2m+i ? 1) and the solutions are F2m/(F2m+i ? 1) and ? F2m+2/(F2m+i ? 1) independent of r where Fk denotes the kth Fibonacci number. This and similar results can be found in [2] and eventually lead to a rem
Publikováno v:
The Mathematics Teacher. 72:34-38