bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 4 years, 3 months |
seen | Oct 11 '12 at 4:58 | |
stats | profile views | 2,272 |
Jan 18 |
awarded | Yearling |
Oct 29 |
awarded | Popular Question |
Jul 30 |
awarded | Favorite Question |
Jun 25 |
awarded | Excavator |
Jan 18 |
awarded | Yearling |
Sep 26 |
comment |
Your experience of Computer Science/Programming in Mathematics Education?
How old is she educationally? (tenth grade US?, asking purely for academic purposes, not trying to fix her up.) How much time did it take (rough estimate of coding-testing-tutorial-homework breakdown would be nice to know.) Gerhard "Really, My Interest Is Educational" Paseman, 2012.09.26 |
Sep 4 |
comment |
Gandhi's quote formalized
Yes... if you change your notion of "best possible" accordingly. Gerhard "Still It Makes Little Sense" Paseman, 2012.09.04 |
Aug 30 |
comment |
Constructing an injective reduction of equivalence relations
I find some similarity between the posted problem and a lopsided version of Hall's marriage Theorem. Do you see it also? If so, there are some concerns in the infinite case, and I do not know of any constructive versions of proofs of Hall's theorem. I would be interested in your thoughts on the matter. Gerhard "Ask Me About System Design" Paseman, 2012.08.30 |
Aug 25 |
comment |
What are the limits of the Erdős-Rankin method for covering intervals by arithmetic progressions?
Also, Westzynthius uses a similar argument to get bounds close to what Rankin and Erdos have. I will review the paper and post something summarizing the differences between W's method and the one you outline above (which may very well be no difference). Gerhard "Ask Me About System Design" Paseman, 2012.08.25 |
Aug 25 |
comment |
What are the limits of the Erdős-Rankin method for covering intervals by arithmetic progressions?
I am still working through the literature myself, so I don't know the answer. I take it you know of the further advances on prime gap lower bounds (Pomerance, Maier, Pintz, I think?), and that they bear no resemblance to Rankin's method? Also, have you checked Hagedorn's 2009 paper on computing Jacobsthal's function to make sure there is nothing you want there? Gerhard "Just Checking On The Obvious" Paseman, 2012.08.25 |
Aug 17 |
comment |
Fast Algorithms for Distinguishing Squarefrees
It might be prudent to try a primality test and/or a perfect power test before trial factorization or some other factorization method. If you suspect a large square factor, testing primality and or perfect power after each small factor is removed might be prudent. Gerhard "Ask Me About System Design" Paseman, 2012.08.16 |
Aug 15 |
comment |
Approximating $\prod_{i=1}^{n-1} (1-ai)$ for large $n$
You could group terms in pairs to get terms like (1 - (n+1)a + ba^2). For small values of a this might help you with your error estimates. Gerhard "Ask Me About System Design" Paseman, 2012.08.15 |
Jul 24 |
revised |
Better error bounds for partial sums of reciprocals of primes?
added 989 characters in body; deleted 6 characters in body |
Jul 20 |
asked | Better error bounds for partial sums of reciprocals of primes? |
Jul 11 |
comment |
functions from Q to itself with derivative zero
I have a feeling that f(x)=1/q^2 when x=p/q in lowest terms will be a guiding example, if not a counterexample. Gerhard "Ask Me About System Design" Paseman, 2012.07.10 |
Jan 19 |
awarded | Nice Question |
Jan 19 |
awarded | Yearling |
Dec 2 |
answered | Can you randomly sample graphs with quadratic growth? |
Dec 2 |
comment |
A limit from an Erdos paper
Jacques Carette has provided a nice suggestion. However, unless you specify what sort of help you need, I and others are going to think this question unsuitable for MathOverflow. (It may be unsuitable after you provide motivation or explain your difficulty, but you may get more sympathetic treatment. Also, if you have trouble with Jacques answer, you may find it best to ask on math.stackexchange instead.) Gerhard "Ask Me About System Design" Paseman, 2011.12.02 |
Nov 28 |
comment |
Help with what is most likely an easy PDE
You're right! That does look like some sort of differential equation! Uh, what is the question? Gerhard "Ask Me About System Design" Paseman, 2011.11.27 |