meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year |
| seen | May 22 at 21:03 | |
| stats | profile views | 55 |
Associate professor of math at UMich, very active on Mathoverflow.
|
May 15 |
comment |
FourierSeries for rational function looks wrongFourierCoefficient[1/(x^2 + 1), x, 1, Assumptions -> -Pi < x < Pi] gives the correct answer. |
|
May 15 |
comment |
FourierSeries for rational function looks wrong Edited my example to use FourierCoefficient, so that I don't have to muck around in the interior of FourierSeries output. Thanks! |
|
May 15 |
revised |
FourierSeries for rational function looks wrong added 875 characters in body |
|
May 15 |
answered | FourierSeries for rational function looks wrong |
|
May 7 |
awarded | Yearling |
|
May 1 |
awarded | Necromancer |
|
Apr 25 |
comment |
How to improve the performance of solutions to Project Euler (#39)? Here are the list of all "record setters", perimeters which achieve higher values than any previous perimeter, for $n \leq 10^6$: {12, 60, 120, 240, 420, 720, 840, 1680, 2520, 4620, 5040, 9240, 18480, 27720, 55440, 110880, 120120, 166320, 180180, 240240, 360360, 720720} |
|
Apr 25 |
comment |
How to improve the performance of solutions to Project Euler (#39)? For $p \leq 10^6$, the answer is always of the form $2^a \times 3^b \times 5 \times 7 \times 11 \times 13 \times \cdots \times p_r$ for some $(a,b,r)$. If we could figure out the pattern in the exponents $(a,b)$, there might be a much faster method. |
|
Mar 28 |
asked | Why is Flattening a CoefficientArray so slow? |
|
Mar 14 |
awarded | Nice Answer |
|
Mar 14 |
awarded | Necromancer |
|
Mar 13 |
revised |
Which DirichletCharacter is KroneckerSymbol? deleted 6 characters in body |
|
Mar 12 |
awarded | Revival |
|
Mar 12 |
revised |
Which DirichletCharacter is KroneckerSymbol? deleted 177 characters in body |
|
Mar 12 |
answered | Which DirichletCharacter is KroneckerSymbol? |
|
Mar 12 |
comment |
Which DirichletCharacter is KroneckerSymbol? A warning note for anyone working on this. The documentation for DirichletCharacter[] (version 8) reads "Real Dirichlet characters modulo $k$ have index $1$ or $\phi(k)/2+1$." THIS IS FALSE. There are $4$ Dirichlet characters modulo $8$ and all of them are real. It looks like the true statement is that the Dirichlet characters of index $1$ and $\phi(k)/2+1$ are real, but so are some other ones. (Run Table[DirichletCharacter[8, j, Range[8]], {j, 1, 4}] if you'd like to see for yourself.) |
|
Mar 12 |
comment |
What is the confidence limit on this convergence? I left an answer over on MO explaining what Mathematica may be thinking. |
|
Mar 1 |
comment |
Permanent minors Ah, so you did. |
|
Mar 1 |
revised |
Permanent minors added 619 characters in body |
|
Feb 28 |
answered | Permanent minors |
