diff --git a/fibonacci_series/Julia/julia_fibonacci.jl b/fibonacci_series/Julia/julia_fibonacci.jl
new file mode 100644
index 0000000..9e121a2
--- /dev/null
+++ b/fibonacci_series/Julia/julia_fibonacci.jl
@@ -0,0 +1,19 @@
+function fibonacci(num::Int)
+    num1 = 0
+    num2 = 1
+    series = 0
+    i = 0
+    while i <= num
+        println(series)
+        num1 = num2
+        num2 = series
+        series = num1 + num2
+        i=i+1
+    end
+end
+
+println("Enter how many numbers needed in Fibonacci series : ") 
+
+num = parse(Int, readline())
+
+fibonacci(num)
\ No newline at end of file
diff --git a/fibonacci_series/Julia/julia_fibonacci_recursive.jl b/fibonacci_series/Julia/julia_fibonacci_recursive.jl
new file mode 100644
index 0000000..4509db9
--- /dev/null
+++ b/fibonacci_series/Julia/julia_fibonacci_recursive.jl
@@ -0,0 +1,16 @@
+# Recursive fibonnaci code
+# this algorithm uses recursion to find the nth term in a fibonacci series
+
+function fibonacci(n::Int)
+    if n <= 1
+        return n
+    else
+        return fibonacci(n-1) + fibonacci(n-2)
+    end
+end
+
+println("Enter the nth term : ") 
+
+num = parse(Int, readline())
+
+println(fibonacci(num))
\ No newline at end of file