1. Home
  2. Material Detail: Bezout

Material Detail

Bezout

Bezout

This page contains an interactive tool that computes arithmetic relations between 2 integers or polynomials: greatest common divisor, least common multiple, performs euclidean division, and checks for Bezout relation.

Keywords:
least common multiple, greatest common divisor, lcm, gcd, Euclidan algorithm
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • Peer Review
  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Simulation
Date Added to MERLOT:
September 19, 2004
Date Modified in MERLOT:
June 12, 2018
Author:
 
Submitter:
Sergey Belyi
Primary Audience:
College General Ed
Technical Format:
Website, Java Applet
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Creative Commons:
No

Browse...

Disciplines with similar materials as Bezout
People who viewed this also viewed
Other materials like Bezout

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.