ticalc.org
Basics Archives Community Services Programming
Hardware Help About Search Your Account
   Home :: Archives :: File Archives :: DEFACTOR&POLYMULT
DEFACTOR&POLYMULT

FILE INFORMATION

Ranked as 24751 on our all-time top downloads list with 1989 downloads.
Ranked as 17044 on our top downloads list for the past seven days with 3 downloads.

defactor.zip
Filename defactor.zip (Download)
Title DEFACTOR&POLYMULT
Description DEFACTOR: This program multiplies linear factors or polynomials. You simply enter the factors like: -3(X-6)(2X+3)(3X+2), or polynomials: (X^3+X^2+X-3)(X^2+2X-3), and you will get the coefficients of the product. You don't have to enter the terms in any special order, and there can be several terms of the same degree. There is no other limit to the number of factors/polynomials than memory. This comes in handy if you want to construct a polynomial with rational roots, and of course if you want to multiply polynomials. You can use any one variable A to theta. POLYMULT: This program is the same as DEFACTOR, except that it gives you the resulting polynomial ( product ) as a string, with the variable of your choice, not just the coefficients.
Author Anders Tiberg (anders.tiberg@telia.com)
Category TI-83/84 Plus BASIC Math Programs (Algebra)
File Size 2,472 bytes
File Date and Time Thu Oct 11 23:45:11 2012
Documentation Included? Yes

SCREEN SHOTS

REVIEWS

There are no reviews for this file.

LEAVE FEEDBACK

Questions, comments, and problems regarding the file itself should be sent directly to the author(s) listed above.

Write a review for this file (requires a free account)

Report inappropriate or miscategorized file (requires an account; or you may email us directly)

If you have downloaded and tried this program, please rate it on the scale below
BadGood
1  2  3  4  5  6  7  8  9  10  

ARCHIVE CONTENTS

Archive Contents
Name Size
DEFACTOR TI-83 Plus.8xp   955
DEFACTOR&POLYMULT.rtf   1520
POLYMULT TI-83 Plus.8xp   1261

  Copyright © 1996-2019, the ticalc.org project. All rights reserved. | Contact Us | Disclaimer