In the Google module, students discover the secret of the world's most popular search engine. Google's success lies in the PageRank algorithm, the functionality of which is discovered by the students in the workshop. This algorithm ensures that the web pages that are displayed for a search term fit particularly well. PageRank determines a rank for each website that contains the search term. Thus, the pages for a search term appear in an order given by the ranks.

At the beginning, the Internet is searched from any page and a ranking list of the found pages is created. By experimenting with small networks, the underlying mathematical theory is explored. In particular, the networking of different contents from the fields of stochastics, linear algebra and analysis is the focus of this workshop. Among other things, the students create a ranking for their own small network.

The module is recommended for mathematics courses at the upper level, which deal with stochastic transition matrices at the time of the CAMMP days. The module can then be used as a varied supplement to the lessons.
However, the module can also be carried out without understanding matrices.

Duration: from 4 hours
Contents: Stochastics (probability concept), analysis (limit value), algebra (transition matrices)
Previous knowledge: Establishment of systems of equations, probability calculation
Target group: Upper secondary mathematics courses
Created by: Kai Krycki, Sarah Schönbrodt
Registration: Appointments can be made individually by e-mail at KIT or RWTH Aachen University.

Source of the image: https://pixabay.com/de/illustrations/google-suchmaschine-browser-suchen-76517/

Material

The interactive learning material can be accessed via the online platform workshops.cammp.online. How to create an account on the platform and use the
material is explained in this video. In addition, accompanying material is provided for teachers on the online platform, which can be accessed via a password that can be requested by e-mail.