Would of def gotten these done if I had more time I'm just slow

LoopFun.java

@@ -8,7 +8,13 @@ public class LoopFun
        * @return the factorial of the number
        */
       public int factorial(int number){
-          return -1;
+          int total = 0;
+          for(int i = 1; i < number; i++ ){
+              
+            total = i * number; 
+        
+            }
+            return total;
       }
 
       /**
@@ -19,8 +25,38 @@ public class LoopFun
        * @return Upper case string of the first letter of each word
        */
       public String acronym(String phrase) {
-          return null;
-      }
+         /* String x1="";
+          String [] container = phrase.split(" ");
+          for(int i= 0; i < container.length ; i++)
+            {   
+                
+                x1 = container.charAt(0,1);
+                
+                
+            }
+          String letters = x1;
+          return letters.toUpperCase();*/
+          
+         //String result = phrase.replaceAll("\\B |\\P{L}","").toUpperCase();
+         //return result;
+          
+          String [] container = phrase.split(" ");
+          
+          String a_c = "";
+          for(int i= 0; i < container.length ; i++)
+            {   
+                
+                 a_c +=Character.toString(container[i].charAt(0));
+                
+                
+            }
+          
+          
+         
+         return a_c;
+         
+        }
+      
 
       /**
        * To prevent anyone from reading our messages, we can encrypt it so it will only be readable by its
@@ -35,6 +71,10 @@ public class LoopFun
        * @return the encrypted string by shifting each character by three character
        */
       public String encrypt(String word) {
-          return null;
-      }
+          
+        //  char alph = (((alph - 'a' + 3) % 26) + 'a');
+        
+          
+        return null;
+        }
 }

MathUtilities.java

@@ -6,7 +6,7 @@ public class MathUtilities{
    * @return the sum of the two numbers
    */
   public int add(int num1, int num2){
-      return -1;
+      return num1 + num2;
   }
 
   /**
@@ -16,7 +16,7 @@ public class MathUtilities{
    * @return the sum of the two numbers
    */
   public double add(double num1, double num2){
-      return -1;
+      return num1 + num2;
   }
 
   /**
@@ -25,7 +25,7 @@ public class MathUtilities{
    * @return the half of the number in double
    */
   public double half(int number) {
-      return -1;
+      return number / 2;
   }
 
   /**
@@ -34,9 +34,16 @@ public class MathUtilities{
    * @return true if the number is odd, false if it is even
    */
   public boolean isOdd(int number){
-      return false;
-  }
-
+            
+      boolean odd = true;
+      if(number % 2 == 0){
+                odd = false;
+                
+            }else if(number % 2 != 0){
+                odd = true;
+            }
+      return odd;
+    }
 
   /**
    * Multiply the number by itself
@@ -44,7 +51,8 @@ public class MathUtilities{
    * @return the result of the number multiply by itself
    */
   public int square(int number) {
-      return -1;
+      //return (int)Math.sqrt(number);
+      return number * number;
   }
 
 }

StringUtilities.java

@@ -1,13 +1,31 @@
 public class StringUtilities {
    public Character getMiddleCharacter(String word){
-       return null;
+       int middle = word.length();
+       int x;
+       char m = 0; 
+       
+       if(middle % 2 == 0){
+            x = middle / 2 - 1;
+            m = word.charAt(x);
+        }else if (middle % 2 != 0){
+            x = middle / 2;
+            m = word.charAt(x);
+        }
+        return m;
    }
    
    public String removeCharacter(String value, char charToRemove){
-     return null;  
+       // String newestword = value.replaceAll(charToRemove,"");
+        //return newestword;
+        return null;
+        
    }
    
    public String getLastWord(String value) {
-       return null;
+       
+       String [] container = value.split(" "); 
+       String x =  container[container.length -1];
+       return x; 
+       
    }
 }