chore: Adjust result to be the smallest positive solution in ChineseRemainderTheorem

Author: SuprHUlk

src/test/java/com/thealgorithms/maths/ChineseRemainderTheoremTest.java

@@ -1,8 +1,9 @@
 package com.thealgorithms.maths;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
-import java.util.List;
+
 import java.util.Arrays;
+import java.util.List;
 import org.junit.jupiter.api.Test;
 
 public class ChineseRemainderTheoremTest {
@@ -19,7 +20,7 @@ public void testCRTSimpleCase() {
     public void testCRTLargeModuli() {
         List<Integer> remainders = Arrays.asList(1, 2, 3);
         List<Integer> moduli = Arrays.asList(5, 7, 9);
-        int expected = 131;
+        int expected = 156;
         int result = ChineseRemainderTheorem.solveCRT(remainders, moduli);
         assertEquals(expected, result);
     }
@@ -37,7 +38,7 @@ public void testCRTWithSingleCongruence() {
     public void testCRTWithMultipleSolutions() {
         List<Integer> remainders = Arrays.asList(0, 3);
         List<Integer> moduli = Arrays.asList(4, 5);
-        int expected = 15;
+        int expected = 8;
         int result = ChineseRemainderTheorem.solveCRT(remainders, moduli);
         assertEquals(expected, result);
     }
@@ -46,7 +47,7 @@ public void testCRTWithMultipleSolutions() {
     public void testCRTLargeNumbers() {
         List<Integer> remainders = Arrays.asList(0, 4, 6);
         List<Integer> moduli = Arrays.asList(11, 13, 17);
-        int expected = 782;
+        int expected = 550;
         int result = ChineseRemainderTheorem.solveCRT(remainders, moduli);
         assertEquals(expected, result);
     }