396
|
1 |
// Core Part 1 about the 3n+1 conjecture
|
343
|
2 |
//============================================
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
3 |
|
396
|
4 |
object C1 {
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
5 |
|
428
|
6 |
// ADD YOUR CODE BELOW
|
|
7 |
//======================
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
8 |
|
428
|
9 |
|
|
10 |
//(1)
|
343
|
11 |
def collatz(n: Long) : Long = ???
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
12 |
|
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
13 |
|
428
|
14 |
//(2)
|
343
|
15 |
def collatz_max(bnd: Long) : (Long, Long) = ???
|
|
16 |
|
428
|
17 |
//(3)
|
343
|
18 |
def is_pow_of_two(n: Long) : Boolean = ???
|
|
19 |
|
|
20 |
def is_hard(n: Long) : Boolean = ???
|
|
21 |
|
|
22 |
def last_odd(n: Long) : Long = ???
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
23 |
|
281
|
24 |
}
|
11
Christian Urban <christian dot urban at kcl dot ac dot uk>
parents:
diff
changeset
|
25 |
|