On Jun 4, 6:23 am, 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
This might be a cop-out, but: g(x, y) = x, and b0 = (reduce f a0 v). If that's not an adequate answer, could you provide more background? I don't think there's a general-case solution that works if v is not known, but that's purely intuitive. I don't know how to prove it, or even argue it convincingly. (Maybe I'll give that a go while I should be revising...) Mark Reid's solution works if f is commutative and associative. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
