๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Investigating Polynomials and Systems of Equations with the Graphing Calculator

โœ Scribed by Paul A. Kennedy


Book ID
114978867
Publisher
School Science and Mathematics Association
Year
1993
Tongue
English
Weight
209 KB
Volume
93
Category
Article
ISSN
0036-6803

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The alternating polynomials and their re
โœ M.A. Fiol; E. Garriga; J.L.A. Yebra ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB

Given a graph F on n = IV/`l vertices, the distance between two subgraphs F 1,/'2 c /', denoted by c~(F t,/'2), is the minimum among the distances between vertices of F 1 and F 2. For some integers 1 ~< s, t ~< n, the conditional (s, t)-diameter of F is then defined as D(~,t)=maxr,,r~.r{~(Fa,F2): IV

On a Class of Polynomials and Its Relati
โœ M.A. Fiol; E. Garriga; J.L.A. Yebra ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 602 KB

Let \* 1 >\* 2 > } } } >\* d be points on the real line. For every k=1, 2, ..., d, the k-alternating polynomial P k is the polynomial of degree k and norm Because of this optimality property, these polynomials may be thought of as the discrete version of the Chebychev polynomials T k and, for parti