most recent 30 from http://mathoverflow.net 2013-05-25T03:34:21Z http://mathoverflow.net/feeds/user/5098 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/21003/polynomial-bijection-from-qxq-to-q Z.H. 2010-04-11T12:03:13Z 2013-04-29T16:31:35Z

<p>Is there any polynomial $f(x,y)\in{\mathbb Q}[x,y]{}\ $ such that $f:\mathbb{Q}\times\mathbb{Q} \rightarrow\mathbb{Q}$ is a bijection?</p>

http://mathoverflow.net/questions/128433/resources-on-wolstenholmes-theorem Z.H. 2013-04-23T04:54:53Z 2013-04-23T04:54:53Z

<p>In Wikipedia entry on Wolstenholme's theorem, it says</p> <p><code>The second formulation $\binom{ap}{bp}=\binom{a}{b}\pmod{p^3}$ of Wolstenholme's theorem is due to J. W. L. Glaisher.</code></p> <p>But there is no reference to it. Does anyone know which paper of J. W. L. Glaisher contains the above statement?</p>

http://mathoverflow.net/questions/62524/is-it-possible-to-use-aks-test-in-integer-factorization Z.H. 2011-04-21T11:55:10Z 2011-04-23T03:12:25Z

<p>Agrawal-Kayal-Saxena use the identity $$(X+a)^n=X^n+a \pmod{n, X^r-1}$$ for some small $a$'s to determine primes. Is it possible to improve this method and use it for integer factorization? Are there any research in this way? Thanks. </p> <p>[Edit] More specifically, Is it possible to find a constructive proof (rather than the original existence proof) of AKS theorem, which will reveal some information for composite numbers.</p>

http://mathoverflow.net/questions/128433/resources-on-wolstenholmes-theorem Z.H. 2013-04-23T09:09:24Z 2013-04-23T09:09:24Z

Thanks. I have added these references to the Wikipedia page.