Recently published items

Per capire il tuo livello di geografia

In the first part, the student must write any linear equation in three unknowns. Each distinct variable can occur more than once, and on either side of the equals sign. It doesn't check that the equation has a unique solution.

In the second part, they must write three equations in two unknowns. It doesn't check that they're independent or that the system has a solution. The marking algorithm on each of the gaps just checks that they're valid linear equations, and the marking algorithm for the whole gap-fill checks the number of unknowns.

No description given

This question aims at getting the students to demonstrate their ability to apply the Euclidean algorithm to find the GCD between two numbers.

We provide two randomly generated numbers and ask the students to enter the steps of the Euclidean algorithm, as well as the GCD between the numbers.

Question 3 from module 1 mid module assessment task

No description given

Gentle intro to modular arithmetic through quotients and remainders

No description given

No description given

No description given