Tag Info

New answers tagged

2

With N replaced by n and exact numbers, the function in the Question can be written as f[n_] = Sum[Binomial[n/2 - 1, a]*Binomial[n/2 - 1, a - 1]*(7/20)*(3/10)^(n - a - 1), {a, 2, n, 2}] Although Mathematica can perform the Sum, the result in terms of HypergeometricPFQ is not particularly enlightening. Instead, plot f[n]. ListLogPlot[Table[f[n], {n, ...


2

I evaluated the computational complexity in the two main aspects: Time (Runtime/CPU-Time) Space (Memory) with regard to increasing i for artificial parameters: cpl=Module[{a, b, z}, Table[ a = Range[i]; b = Range[i]; z = RandomReal[{-10., 10.}]; AbsoluteTiming[MaxMemoryUsed[HypergeometricPFQ[a, b, z]]], {i, 1, 500} ]] Time complexity: ...


0

If you're not worried about putting information into the boxes of your Young Tableaux, the FerrersDiagram function will do the job. It takes a partition {a,b,c,...} and prints the Young Diagram in 'dot' form, like in http://en.wikipedia.org/wiki/Partition_%28number_theory%29#Ferrers_diagram The Mathematica documentation is fairly minimal ...



Top 50 recent answers are included