Peer Review for material titled "Bezout"
User Rating for material titled "Bezout"
Member Comments for material titled "Bezout"
Personal Collections for material titled "Bezout"
Learning Exercises for material titled "Bezout"
Accessibility Info for material titled "Bezout"
Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help



Search > Material Results >




Logo for 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.
Material Type: Simulation
Technical Format: Java Applet
Date Added to MERLOT: September 19, 2004
Date Modified in MERLOT: May 06, 2011
Send email to
Submitter: Sergey Belyi
Keywords: lcm, Euclidan algorithm, greatest common divisor, least common multiple, gcd


  • Peer review 4 rating
    Peer Reviews: 4 rating
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (none)
  • Accessibility Info (none)


Primary Audience: College General Ed
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: no
Accessiblity Information Available: no
Creative Commons: unsure


QR Code for this Page

Browse in Categories


Discussion for Bezout

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

Return to Top of Page