Hi, Maybe I'm missing something but doesn't + fit the bill (or any symmetric function)?
(== (reduce + 3 [1 2 3]) (reduce + 3 [3 2 1])) ;; => true In this case f = g = + and a0 = b0 for any choice of a0 and v. Regards, Mark. On Jun 4, 3:23 pm, CuppoJava <patrickli_2...@hotmail.com> wrote: > Hey guys, > I'm really stuck on this math question, and I'm wondering if you guys > know of any links that may help me. > > Given: f(x,y), a0, a list of numbers v. > Find: g(x,y) and b0 such that: > > (reduce f a0 v) = (reduce g b0 (reverse v)) > > Thanks for your help > -Patrick --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
