--- a/cws/core_cw01.tex	Mon Nov 10 16:24:46 2025 +0000
+++ b/cws/core_cw01.tex	Thu Nov 13 17:44:58 2025 +0000
@@ -8,7 +8,7 @@
 
 \begin{document}
 
-\section*{Core Part 1 (Scala, 3 Marks)}
+\section*{Core Part 1 (Scala, 1.5 Marks)}
 
 \mbox{}\hfill\textit{``The most effective debugging tool is still careful thought,}\\
 \mbox{}\hfill\textit{coupled with judiciously placed print statements.''}\smallskip\\
@@ -62,7 +62,7 @@
 
 
 \newpage
-\subsection*{Core Part 1 (3 Marks, file collatz.scala)}
+\subsection*{Core Part 1 (1.5 Marks, file collatz.scala)}
 
 This part is about function definitions and recursion. You are asked
 to implement a Scala program that tests examples of the
@@ -118,15 +118,15 @@
   try out this function with large numbers, you should use
   \texttt{Long} as argument type, instead of \texttt{Int}.  You can
   assume this function will be called with numbers between $1$ and
-  $1$ Million. \hfill[1 Mark]
+  $1$ Million. \hfill[0.5 Marks]
 
 \item[(2)] Write a second function that takes an upper bound as
   an argument and calculates the steps for all numbers in the range from
   1 up to this bound (the bound including). It returns the maximum number of
   steps and the corresponding number that needs that many steps.  More
   precisely it returns a pair where the first component is the number
-  of steps and the second is the corresponding number. \hfill\mbox{[1
-    Mark]}
+  of steps and the second is the corresponding number. \hfill\mbox{[0.5
+    Marks]}
 
 \item[(3)] Write a function that calculates \emph{hard
     numbers} \here{https://medium.com/cantors-paradise/the-collatz-conjecture-some-shocking-results-from-180-000-iterations-7fea130d0377}
@@ -149,7 +149,7 @@
   \[113, 340, 170, \,\fbox{85}\,, 256, 128, 64, 32, 16, 8, 4, 2, 1\]
 
   The \textit{last-odd} function will only be called with numbers that are not
-  powers of 2 themselves.\hfill\mbox{[1 Mark]}
+  powers of 2 themselves.\hfill\mbox{[0.5 Mark]}
 \end{itemize}
 
 \noindent