127
|
1 |
// Part 1 about the 3n+1 conjecture
|
15
|
2 |
//=================================
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
3 |
|
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
4 |
|
15
|
5 |
//(1) Complete the collatz function below. It should
|
|
6 |
// recursively calculate the number of steps needed
|
|
7 |
// until the collatz series reaches the number 1.
|
127
|
8 |
// If needed, you can use an auxiliary function that
|
15
|
9 |
// performs the recursion. The function should expect
|
24
Christian Urban <christian dot urban at kcl dot ac dot uk>
diff
changeset
|
10 |
// arguments in the range of 1 to 1 Million.
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
11 |
|
129
|
12 |
//def collatz(n: Long) : Long = ...
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
13 |
|
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
14 |
|
199
|
15 |
//(2) Complete the collatz_max function below. It should
|
127
|
16 |
// calculate how many steps are needed for each number
|
|
17 |
// from 1 up to a bound and then calculate the maximum number of
|
18
|
18 |
// steps and the corresponding number that needs that many
|
127
|
19 |
// steps. Again, you should expect bounds in the range of 1
|
|
20 |
// up to 1 Million. The first component of the pair is
|
18
|
21 |
// the maximum number of steps and the second is the
|
|
22 |
// corresponding number.
|
15
|
23 |
|
129
|
24 |
//def collatz_max(bnd: Long) : (Long, Long) = ...
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
25 |
|
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
26 |
|
199
|
27 |
|