User Portlet User Portlet

Discussions
You can also check [this][1] by Leonid Shifrin: *"Mathematica programming: an advanced introduction"* [1]: http://www.mathprogramming-intro.org/download/MathProgrammingIntro.pdf
congratulations on your first project. It looks great, wish you the best.
Hello, I have been trying to find a way to run faster some recursive functions, and I started by coding Fibonacci. Apart from using memoization and the default definition f[0] = 0; f[1] = 1; f[x_]:=f[x] = f[x-1] + f[x-2]; i also...
Is it the very same function? Did you try straightforward definition and plotting like this? f[x_] := x^2; g[x_] := f[x]*2; Plot[g[f[i]], {i, 1, 100}]
You have done amazing job Sander, respect.
your implementation is correct, there is something missing in the result that you provide as the correct one. If you consider n>2, lets say n=3 you get all the factors of U derivative provided, but some other ones too not listed. ![enter image...
Why don't you build your own distribution? Using a simple -if- you can inflate it in zero, and deflate it elsewhere accordingly, in order to achieve what you want. For instance, suppose that you want to create a zero inflated poisson: ...
For those owning 10.3, how tothey update to 10.3.1? Do they have to purchase mathematica again? Isn't it free update? I am talking about a registered license.
Both ways work perfect, great thinking man, thank you for your assistance!
Thank you, you are right. i really appreciate your help , i will go through what you suggest. Your clarifications are really helpfull. [@Daniel Lichtblau][at0] [at0]: http://community.wolfram.com/web/danl