ticalc.org
Basics Archives Community Services Programming
Hardware Help About Search Your Account
   Home :: Archives :: File Archives :: Polynomial Division
Polynomial Division

FILE INFORMATION

Ranked as 3080 on our all-time top downloads list with 8852 downloads.
Ranked as 1121 on our top downloads list for the past seven days with 17 downloads.

polydiv1.zip
Filename polydiv1.zip (Download)
Title Polynomial Division
Description POLYDIV: This program divides polynomials. Enter them like: (X^3+X^2+X-3)(X^2+2X+3). You can also enter several polynomials: (117X^4-20X^3-390X^2+20X+273)(X^2-1)(9X+13)(13X-21). The first polynomial will then be divided by the second, and the quotient will be divided by the third, and so on. There are no other limits to the number of polynomials you can enter than memory, and of course the degree of the first polynomial. You will get the coefficients of the quotient and the remainder for each step. You can use any one variable A to theta. The terms can be entered in any order, and there can be more than one of the same degree. POLYDIV1: This is a simpler version of POLYDIV, where you input the coefficients of the polynomials as lists. Only 168 bytes.
Author Anders Tiberg (anders.tiberg@telia.com)
Category TI-83/84 Plus BASIC Math Programs (Algebra)
File Size 1,894 bytes
File Date and Time Thu Oct 25 04:17:45 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
POLYDIV TI-83 Plus.8xp   1026
POLYDIV&POLYDIV1.rtf   1388
POLYDIV1 TI-83 Plus.8xp   227

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