             :restricted ["intersection"]
             :description "Write a function which returns the intersection of two sets.  The intersection is the sub-set of items that each set has in common."
             :approved true
-            :tags ["easy" "sets"]
+            :tags ["easy" "set theory"]
             :tests ["(= (__ #{0 1 2 3} #{2 3 4 5}) #{2 3})"
 		    "(= (__ #{0 1 2} #{3 4 5}) #{})"
 		    "(= (__ #{:a :b :c :d} #{:c :e :a :f :d}) #{:a :c :d})"]})

                    "(= true (__ false true false))"
                    "(= false (__ true true true))"
                    "(= true (__ true true true false))"]})
      
      (insert! :problems
          {:_id 84
           :title "Create an Equation"
           :times-solved 0
           :description "Write a function which takes three or more integers.  Using these integers, your function should generate clojure code representing an equation.  The following rules for the equation must be satisfied:\n\n    1. All integers must be used once and only once.\n    2. The order of the integers must be maintained when reading the equation left-to-right.\n    3. The only functions you may use are +, *, or =.\n    4. The equation must use the minimum number of parentheses.\n    5. If no satisfying equation exists, return nil."


      
      (insert! :problems
           {:_id 86
            :title "Power Set"
            :times-solved 0
            :description "A power set is the set of all subsets of a given set. Given a list, produce a set of sublists while preserving the order of elements."
