diff --git a/AP1403 - WarmUp/.idea/.name b/AP1403 - WarmUp/.idea/.name
new file mode 100644
index 0000000..961c0bf
--- /dev/null
+++ b/AP1403 - WarmUp/.idea/.name	
@@ -0,0 +1 @@
+Exercises.java
\ No newline at end of file
diff --git a/AP1403 - WarmUp/.idea/misc.xml b/AP1403 - WarmUp/.idea/misc.xml
index fdc35ea..09accc2 100644
--- a/AP1403 - WarmUp/.idea/misc.xml	
+++ b/AP1403 - WarmUp/.idea/misc.xml	
@@ -8,7 +8,7 @@
       </list>
     </option>
   </component>
-  <component name="ProjectRootManager" version="2" languageLevel="JDK_21" default="true" project-jdk-name="21" project-jdk-type="JavaSDK">
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_23" project-jdk-name="23" project-jdk-type="JavaSDK">
     <output url="file://$PROJECT_DIR$/out" />
   </component>
 </project>
\ No newline at end of file
diff --git a/AP1403 - WarmUp/src/main/java/Exercises.java b/AP1403 - WarmUp/src/main/java/Exercises.java
index 923d44a..e365bb1 100644
--- a/AP1403 - WarmUp/src/main/java/Exercises.java	
+++ b/AP1403 - WarmUp/src/main/java/Exercises.java	
@@ -1,11 +1,28 @@
 public class Exercises {
-
-    /*
-        complete this function to check if the input number is prime or not
-     */
+    
     public boolean isPrime(long n) {
-        // todo
-        return false;
+        if(n <= 1)
+        {
+            return false;
+        }
+        if(n == 2 || n == 3)
+        {
+            return true;
+        }
+        if(n % 2 == 0 )
+        {
+            return false;
+        }
+        else
+        {
+            for (long i = 3; i * i <= n ; i += 2) {
+                if (n % i == 0) {
+                    return false;
+                }
+
+            }
+        }
+        return true;
     }
 
     /*
@@ -15,8 +32,36 @@ public boolean isPrime(long n) {
         if the input is not a fibonacci number with description above, return -1
      */
     public long fibonacciIndex(long n) {
-        // todo
-        return -1;
+        if(n < 0 )
+        {
+            return -1;
+        }
+        if(n == 0)
+        {
+            return 0;
+        }
+        if(n == 1)
+        {
+            return 1;
+        }
+
+        long fib1 = 0;
+        long fib2 = 1;
+        long index = 1;
+        while(fib2 < n)
+        {
+            long temp = fib2;
+            fib2 = fib1+fib2;
+            fib1 = temp;
+            index++;
+        }
+        if(fib2 == n)
+        {
+            return index;
+        }
+        else {
+            return -1;
+        }
     }
 
     /*
@@ -38,8 +83,21 @@ public long fibonacciIndex(long n) {
         the output has to be a two-dimensional array of characters, so don't just print the triangle!
      */
     public char[][] generateTriangle(int n) {
-        // todo
-        return null;
+
+        if (n <= 0) return new char[0][0];
+        char[][] triangle = new char[n][];
+        for (int i = 0; i < n; i++) {
+            triangle[i] = new char[i + 1];
+
+            for (int j = 0; j <= i; j++) {
+                if (j == 0 || j == i || i == n - 1) {
+                    triangle[i][j] = '*';
+                } else {
+                    triangle[i][j] = ' ';
+                }
+            }
+        }
+        return triangle;
     }
 
     public static void main(String[] args) {