OEF gcd --- Introduction ---

This module actually contains 18 exercises on gcd (greatest commun divisor) and lcm (lowest commun multiple) of integers.

gcd and existence

, ?

Find gcd

(,).

Find gcd-3

(,,).

Find gcd II

(,).

gcd and lcm

, .

gcd and lcm II

, .

gcd and lcm III

, .

gcd lcm and product

, .
?

gcd lcm and sum

, , .

gcd and multiple

?

gcd and product

, .

gcd and sum

, .

gcd sum and product

, , .

Find lcm

(,).

Find lcm-3

(,,).

lcm and product

, .

lcm and sum

, .

lcm sum and product

, , .

Other exercises on: Gcd and lcm   Integers   Arithmetic  

The most recent version

This page is not in its usual appearance because WIMS is unable to recognize your web browser.

In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press ``Enter''.

Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.

Description: collection of exercises on gcd and lcm of integers. interactive exercises, online calculators and plotters, mathematical recreation and games

Keywords: interactive mathematics, interactive math, server side interactivity, algebra, arithmetic, number_theory, primes, factorization, integers, gcd_lcm