diff --git a/README.md b/README.md
index 45aa284..78dea58 100644
--- a/README.md
+++ b/README.md
@@ -4,3 +4,5 @@ assignment_ruby_warmup
 Dice, dice, baby.
 
 [A Ruby assignment from the Viking Codes School](http://www.vikingcodeschool.com)
+
+Student name: Ilana Pearlman
diff --git a/assignment.rb b/assignment.rb
new file mode 100644
index 0000000..8a59871
--- /dev/null
+++ b/assignment.rb
@@ -0,0 +1,113 @@
+=begin
+Rolling Dice
+
+Write a method roll_dice which returns the result of rolling N 6-sided dice where N is the input to the method (the default should be 1). For example:
+
+> roll_dice(4)
+#=> 18          # Rolled 4 dice
+> roll_dice(2)
+#=> 4           # Rolled 2 dice
+> roll_dice
+#=> 1           # Rolled 1 die
+=end
+
+def roll_dice(n)
+  (1..n).reduce(0) {|acc, _val| acc += rand(1..6)}
+end
+
+=begin
+Rolling Dice Outcomes
+
+Now write a method dice_outcomes which takes the number of dice to roll and the number of times to roll them, then outputs a visual chart of how many times each possible number comes up. For example:
+
+> dice_outcomes(3,100)
+3:  ##
+4:  #
+5:  #
+6:  ####
+7:  ###
+8:  #################
+9:  ###########
+10: #########
+11: ############
+12: ##########
+13: ##########
+14: #########
+15: ######
+16: ##
+17: ##
+18: #
+=end
+def dice_outcomes(dice, throws)
+  hash = Hash.new(0)
+  1..throws.times do
+    hash[roll_dice(dice)] += 1
+  end
+  hash.each do |key, val|
+    puts "#{key}:  #{"#" * val}"
+  end
+  ##NEED TO FORMAT RESULTS BETTER WITH PADDING
+end
+
+=begin
+#=> {3=>2, 4=>1, 5=>1, 6=>4, 7=>3, 8=>17, 9=>11, 10=>9, 11=>12, 12=>10, 13=>10, 14=>9, 15=>6, 16=>2, 17=>2, 18=>1}
+Fibonacci
+
+Write a method fibonacci which outputs the Fibonacci Sequence members out to the specified number of members. For example:
+
+> fibonacci(7)
+#=> [1, 1, 2, 3, 5, 8, 13]
+=end
+def fibonacci(n)
+  arr = [1]
+  while arr.length < n
+    if arr.length == 1
+      arr << 1
+    else
+      arr << (arr[-1] + arr[-2])
+    end
+  end
+  arr
+end
+
+=begin
+Stock Picker
+
+Write a method stock_picker which takes an array of stock prices (prices on days 0, 1, ...) and outputs the most profitable pair of days on which to first buy the stock and then sell the stock, for example:
+
+> stock_picker([44, 30, 24, 32, 35, 30, 40, 38, 15])
+#=> [2, 6]
+=end
+
+def stock_picker(arr)
+  min = 0
+  max = 
+end
+
+=begin
+Anagram Testing
+
+Write a method anagrams which returns an array of anagrams that can be made with the specified string. Assume the input is only a single word (e.g. "loot" not "William Shakespeare").
+
+Download enable.txt, a popular Scrabble dictionary, and load it in as your dictionary of choice. If you haven't encountered Ruby's file I/O yet, you can test your method by simply providing an array of known anagrams like those below to check that it works properly.
+
+You can use Dir.pwd to output the current directory. If you can't find the dictionary, double check the directory you're executing your script from within.
+
+Example:
+
+# Note: "pears" doesn't appear in the output
+> anagrams("pears")
+# => ["APERS","APRES","ASPER","PARES","PARSE","PRASE","PRESA","RAPES","REAPS","SPARE","SPEAR"]
+
+> anagrams("zygote")
+#=> []
+Finishing Up
+
+When you're finished with all tasks, push your changes up to your fork (aka $ git push origin master).
+To submit your assignment, create a pull request from your fork to the main upstream repository.
+Solution
+
+The solution will be available here on Github once you've submitted your pull request.
+
+
+=end