Recently published items

No description given

No description given

Asks the student to give the images/preimages of subsets of the domain/range of a map.

Two slightly more complicated questions on handling fractions.

Finde die Bruchzahl, deren Wert sich von den anderen unterscheidet. Die Nenner sind meistens zwei- oder dreistellig.

Angepasste und übersetzte Version von https://numbas.mathcentre.ac.uk/question/23234/select-the-fraction-not-equivalent-to-the-others-large-denominators/ von Christian Lawson-Perfect.

Suche von den fünf gegebenen Bruchzahlen diejenige aus, die nicht denselben Wert hat wie alle anderen.

Quelle: Angepasste und übersetzte Version von https://numbas.mathcentre.ac.uk/question/23233/select-the-fraction-not-equivalent-to-the-others-small-denominators/ von Christian Lawson-Perfect.

Identify well-known fractional equivalents of decimals. Convert obscure decimals and recurring decimals into fractions.

https://numbas.mathcentre.ac.uk/question/22784/decimals-to-fractions/ by Lauren Richards

Translated to German.

Schreibe $\displaystyle \frac{a} {b + \frac{c}{d}}$ als einen gekürzten Bruch $\displaystyle \frac{p}{q}$ mit ganzen Zahlen $p$ und $q$.

Angepasste, übersetzte und erweiterte Version von https://numbas.mathcentre.ac.uk/question/11701/simplifying-fractions/ von Newcastle University Mathematics and Statistics.

Manipulate fractions in order to add and subtract them. The difficulty escalates through the inclusion of a whole integer and a decimal, which both need to be converted into a fraction before the addition/subtraction can take place.

https://numbas.mathcentre.ac.uk/question/22664/addition-and-subtraction-of-fractions/ by Lauren Richards

Translated to German and Part d) added.

Students are shown a graph with 6 vertices and asked to find the length of the shortest path from A to a random vertex.

There is only one graph, but all of the weights are randomised.

They can find the length any way they wish. In the advice, the steps of Dijkstra's algorithm used in solving this problem are displayed. It is not a complete worked solution but it should be sufficient to figure out the shortest path used to reach each vertex.