diff --git a/README.md b/README.md
index ff2c855..943a060 100644
--- a/README.md
+++ b/README.md
@@ -19,4 +19,6 @@ I would like you to complete what you can prior to next Wednesday's Lecture.
 #### Recursion
 
 * Write a program that takes an integer, and prints the factorial of the integer.  ex: 5 factorial is 5*4*3*2*1
-* Write a 
+* Write a program that will calculate the number of cannon balls in a trinagular pyramid that has the intered integer number of rows.
+(Note: this means that any layer of the pyramid has an equalateral triangle of cannonballs.  The top layer has 1 cannon ball, the one below that has 3, etc.)
+* Use recursion to determin if a string passed in is a palindrome.  Your program will be given a string.
diff --git a/bkeller17/FtoC b/bkeller17/FtoC
new file mode 100644
index 0000000..3208eca
--- /dev/null
+++ b/bkeller17/FtoC
@@ -0,0 +1,16 @@
+import java.util.Scanner;
+
+public class LAB4Q2{
+public static double ConvertFtoC(int Input){
+        return (Input-32) * 5/9.0;
+}
+             public static void main(String [] args)
+             {
+                Scanner scan = new Scanner(System.in);
+                int input = scan.nextInt();
+
+                int F = input;
+
+                System.out.println(ConvertFtoC(F));
+             }
+}
diff --git a/jifland/test b/jifland/test
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/jifland/test
@@ -0,0 +1 @@
+