|
|
![]() |
![]() |
||
|
|
||||
| ::.. | ||||
![]() |
This module uses 3D technology for a better understanding of the Pitagoras' Theorem. Has TOP10 and theoretical lectures available. |
|||
| ::.. | ||||
![]() |
The computer writes a number in Chinese
numbering or in normal numbering and |
|||
| ::.. | ||||
![]() |
In the magical squares
the sum by main line, by column and by diagonal is equal. The goal is to
complete them. Time counts. They are 4x4 squares and with 10000 different
probabilities in each game. There is always an updated TOP10. |
|||
| ::.. | ||||
![]() |
Catch the butterflies
that carry the correct numbers, in the least time. Each game has 3 stages
(prime numbers, divisors, etc...). Whenever a wring butterfly is caught there will be a 30 second penalty. There is always an updated TOP10. Try to be among the best! |
|||
| ::.. | ||||
![]() |
The goal in this
module is to verify the veracity of Goldbach's Conjecture. In order to do so the user will have to initially choose any even number among the numbers given by the computer. Then the user will have to find the two prime numbers whose sum is the initially selected number. |
|||
| ::.. | ||||
![]() |
In this module the user will have to follow the computer's instructions. There is a sequence of counts that will have to be done from a randomly chosen number. Surprise yourself with the "magical" ability of the program to guess the result of your counts. | |||
| ::.. | ||||
![]() |
This module is for two players. Each player has 3 tries to find the correct answer to the question presented by the computer. The closer to the solution the more points the user wins. | |||
| ::.. | ||||
![]() |
The goal of this module is to find the pairs of amicable numbers. To make the task easier it is possible to use a calculator integrated in the module which among other functions determines the list of a number's divisors. | |||
| ::.. | ||||
![]() |
The goal in this module is to represent in Egyptian numbering (hieroglyphs) the numbers in Arabic numbering (used by us) given by the computer. | |||
| ::.. | ||||
![]() |
This module is for two players. One of them writes in Arabic numbering while the other will have to represent the same number in Roman numbering. | |||
| ::.. | ||||
![]() |
In the prime numbers module the user will have to try to get right all prime numbers between 1 a 25 or 100. There will be penalties every time the user commits a mistake. | |||
| ::.. | ||||
![]() |
No módulo dos números primos o utilizador terá que tentar acertar em todos os números primos de 1 a 25 ou 100. Sempre que errar ser-lhe-ão descontados pontos. | |||
| ::.. | ||||
![]() |
In this module the user must find the missing number, knowing that the sum by main line, column and diagonal is always equal. The squares are 3x3. | |||
| ::.. | ||||
![]() |
The goal is very simple: answer correctly the questions of the two themes presented (Bridges and Space Trips). | |||
| ::.. | ||||
![]() |
|
* They
use Flash Player
5
Last Change: 10/02/2002 |
|