User anonymous - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-19T00:28:33Z http://mathoverflow.net/feeds/user/16510 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/133410/hecke-equidistribution/133447#133447 Answer by Anonymous for Hecke equidistribution Anonymous 2013-06-12T01:20:08Z 2013-06-12T01:20:08Z <p>A very down-to-earth treatment of this result of Hecke is in Chapter 5 of the nice book <em>Geometric and Analytic Number Theory</em>, by Hlawka, Schoißengeier, and Taschner. By down-to-earth, I mean that they deal directly with this specific case of Hecke's result, and that they prove it using very little -- the method is a modification of the Korevaar--Newman--Zagier approach to the prime number theorem, and so doesn't need any quantitative zero-free region (just a statement that there are no zeros of the appropriate objects on the line $\Re(s)=1$).</p> http://mathoverflow.net/questions/83916/a-generalized-mobius-function/83923#83923 Answer by Anonymous for A generalized Möbius function? Anonymous 2011-12-20T05:15:33Z 2011-12-20T05:15:33Z <p>The partial sums of $\mu_k(n)$ are estimated in a paper of Addison:</p> <p>A Note on the Compositeness of Numbers, A. W. Addison, Proceedings of the American Mathematical Society, Vol. 8, No. 1 (Feb., 1957), pp. 151-154,</p> <p>Article Stable URL: <a href="http://www.jstor.org/stable/2032831" rel="nofollow">http://www.jstor.org/stable/2032831</a></p> <p>Most of the paper treats $\zeta^{\Omega(n)}$, but the (slightly different) function you are interested in is discussed in the closing paragraph. </p> http://mathoverflow.net/questions/82533/a-question-related-to-hilberts-irreducibility-theorem/82535#82535 Answer by Anonymous for A question related to Hilbert's Irreducibility Theorem Anonymous 2011-12-03T04:12:10Z 2011-12-03T04:22:12Z <p>The answer is yes, assuming that the two-variable polynomial $f_n(x)T^n + \dots + f_1(x)T + f_0(x)$ is irreducible over $K$.</p> <p>This follows from the version of Hilbert's irreducibility theorem for number fields proved as Theorem 46 of p.298 of Schinzel's book <em>Polynomials with special regard to reducibility</em>: the relevant passage can be viewed on Google Books</p> <p><a href="http://books.google.ca/books?id=kca0JqBhnsIC&amp;lpg=PA298&amp;vq=hilbert" rel="nofollow">http://books.google.ca/books?id=kca0JqBhnsIC&amp;lpg=PA298&amp;vq=hilbert</a>'s%20irreducibility%20theorem&amp;pg=PA298#v=onepage&amp;q&amp;f=false</p> <p>In fact, if I'm reading it correctly, it looks like one has irreducibility for all rational integers $\alpha$ belonging to an appropriate residue class.</p> http://mathoverflow.net/questions/82296/explicit-lower-bounds-on-l1-chi/82299#82299 Answer by Anonymous for explicit lower bounds on $|L(1,\chi)|$ Anonymous 2011-11-30T18:32:48Z 2011-11-30T18:32:48Z <p>This is discussed on page 47 of Narkiewicz's new book (Rational Number Theory in the 20th Century); see</p> <p><a href="http://books.google.ca/books?id=3SWNZaDM6iMC&amp;lpg=PP1&amp;dq=rational%20number%20theory%20in%20the&amp;pg=PA47#v=onepage&amp;q&amp;f=false" rel="nofollow">http://books.google.ca/books?id=3SWNZaDM6iMC&amp;lpg=PP1&amp;dq=rational%20number%20theory%20in%20the&amp;pg=PA47#v=onepage&amp;q&amp;f=false</a></p> <p>Reference [4268] is to </p> <p>Metsankyla, T.: Estimations for L-functions and the class numbers of certain imaginary cyclic fields, Ann. Univ. Turku, Ser. AI 140, 1--11 (1970)</p> <p>[3995] is</p> <p>Louboutin, Stéphane(F-CAEN) Minoration au point 1 des fonctions L et détermination des corps sextiques abéliens totalement imaginaires principaux. (French) [Lower bound at the point 1 of L-functions and determination of the principal totally imaginary abelian sextic fields] Acta Arith. 62 (1992), no. 2, 109–124. </p> <p>and [338] is</p> <p>Barrucand, Pierre; Louboutin, Stéphane(F-CAEN) Minoration au point 1 des fonctions L attachées à des caractères de Dirichlet. (French) [Lower bound at the point 1 of L-functions associated with Dirichlet characters] Colloq. Math. 65 (1993), no. 2, 301–306. </p> http://mathoverflow.net/questions/82046/about-integer-polynomials-which-are-sums-of-squares-of-rational-polynomials/82294#82294 Answer by Anonymous for About integer polynomials which are sums of squares of rational polynomials... Anonymous 2011-11-30T17:47:06Z 2011-11-30T17:47:06Z <p>In fact, if $P(x)$ is a polynomial with integer coefficients and if every arithmetic progression contains an integer $n$ for which $P(n)$ is a sum of two rational squares, then $P(x) = u_1(x)^2 + u_2(x)^2$ identically, where $u_1(x)$ and $u_2(x)$ are polynomials with integral coefficients. This follows from a theorem of Davenport, Lewis, and Schinzel; see the Corollary to Theorem 2 in <em>Polynomials of certain special types</em> (Acta Arith. IX, 1964, 107--116). </p> <p>(In my restatement of their result, I use that being a sum of two rational squares is equivalent to being a sum of two integer squares. This is easy to prove directly from the characterization; alternatively, it follows from a lemma in Serre's book, attributed to Davenport--Cassels, used to prove the three squares theorem. Also, Davenport, Lewis, and Schinzel seem to have an argument similar to Gjergji's implicitly in mind in their proof of the Corollary above. So Gjergji's answer is the "real" one; but maybe this paper will interest others.)</p> http://mathoverflow.net/questions/81772/how-are-these-number-theoretical-constants-actually-distributed/81935#81935 Answer by Anonymous for How are these number-theoretical constants actually distributed? Anonymous 2011-11-26T02:25:48Z 2011-11-26T02:25:48Z <p>This paper by Kowalski also looks highly relevant: <a href="http://arxiv.org/abs/0805.4682?context=math" rel="nofollow">http://arxiv.org/abs/0805.4682?context=math</a></p> http://mathoverflow.net/questions/72180/what-dirichlet-doesnt-tell/72191#72191 Answer by Anonymous for What Dirichlet doesn't tell... Anonymous 2011-08-05T16:34:41Z 2011-08-05T16:34:41Z <p>Let me sketch a proof. If you <strong>fix</strong> a bound $z$, then the events $P(\ell^2)$ for different $\ell \leq z$ <strong>are</strong> uncorrelated; this is just a consequence of the prime number theorem for progressions and the multiplicativity of Euler's function. This reduces the problem to "understanding the tails"; in other words, we have to show that as $z\to\infty$, the relative upper density of the primes divisible by $\ell^2$ for some $\ell > z$ tends to zero.</p> <p>Consider the primes $p \leq x$. By the Brun--Titchmarsh inequality, the number of such $p$ for which $p-1$ is divisible by $\ell^2$ for some prime $\ell$ with $z &lt; \ell \leq x^{1/4}$ (say) is $$\ll \sum_{z&lt; \ell \leq x^{1/4}} \frac{x}{\phi(\ell^2)\log{(x/\ell^2)}} \ll \pi(x) \sum_{z > \ell} \frac{1}{\ell^2} \ll \frac{\pi(z)}{x}.$$ Also, the number of $p$'s with $p-1$ divisible by $\ell^2$ for some $\ell > x^{1/4}$ can be estimated trivially: We just count how many $n \leq x$ are divisible by some $\ell^2$ with $\ell > x^{1/4}$, which is clearly at most $\sum_{\ell > x^{1/4}} \lfloor x/\ell^2\rfloor \ll x^{3/4}$. This is negligible for us. Hence, the relative upper density in the previous paragraph is $\ll 1/z$. So it does indeed tend to zero as $z\to\infty$.</p> http://mathoverflow.net/questions/71155/multiplicative-functions-whose-dirichlet-series-have-essential-singularities/71183#71183 Answer by Anonymous for Multiplicative functions whose Dirichlet series have essential singularities Anonymous 2011-07-25T04:36:47Z 2011-07-25T04:36:47Z <p>Hi Robert. For your particular $f$, you'll want to look at this article:</p> <p>A Note on the Compositeness of Numbers<br> A. W. Addison<br> Proceedings of the American Mathematical Society<br> Vol. 8, No. 1 (Feb., 1957), pp. 151-154<br> Article Stable URL: <a href="http://www.jstor.org/stable/2032831" rel="nofollow">http://www.jstor.org/stable/2032831</a></p> <p>Addison gives the details for the case when $f(p)=\omega$, where $\omega$ is a primitive $3$rd root of unity, but remarks that the the case of $f(p)=i$ (or in general, any $\zeta_n$) is similar.</p> http://mathoverflow.net/questions/70647/approximate-primitive-roots-mod-p/70711#70711 Answer by Anonymous for Approximate primitive roots mod p Anonymous 2011-07-19T05:37:21Z 2011-07-19T06:12:50Z <p>A result of Erdos and Murty asserts that if $\epsilon(p)$ is any decreasing function tending to zero, then $I(p) \leq p^{1/2-\epsilon(p)}$ for almost all primes $p$ (i.e., all but $o(\pi(x))$ primes $p \leq x$). </p> <p>Kurlberg and Pomerance (see Lemma 20 in the paper mentioned below) show that for a positive proportion of primes $p$, one has the stronger bound $I(p) \leq p^{0.323}$. This follows from a result of Baker and Harman on shifted primes with large prime factors.</p> <p>The Erdos--Murty paper is #77 at</p> <p><a href="http://www.mast.queensu.ca/~murty/index2.html" rel="nofollow">http://www.mast.queensu.ca/~murty/index2.html</a></p> <p>and the Kurlberg--Pomerance paper is</p> <p><a href="http://www.math.dartmouth.edu/~carlp/PDF/par13.pdf" rel="nofollow">http://www.math.dartmouth.edu/~carlp/PDF/par13.pdf</a></p> <p>See also Theorem 23 of this paper (which is conditional on GRH).</p> http://mathoverflow.net/questions/70371/greatest-common-divisor-of-a2n-1-and-b2n-1/70534#70534 Answer by Anonymous for Greatest common divisor of a^{2^n}-1 and b^{2^n}-1 Anonymous 2011-07-17T01:45:47Z 2011-07-17T01:45:47Z <p>A comment on one of Joe's questions: Let $B$ be any real number. It is known unconditionally that there are infinitely many $m$ for which $\phi(m)$ is a square and for which the smallest prime factor of $m$ exceeds $B$. One can even take $m$ as a product of two primes here; see, e.g., article 4 from </p> <p><a href="http://www.integers-ejcnt.org/vol11a.html" rel="nofollow">http://www.integers-ejcnt.org/vol11a.html</a></p> <p>or an arXiv preprint of Tristan Freiberg.</p> <p>If we choose $B$ larger than $|a|$ and $|b|$, then $m \mid \gcd(a^{\phi(m)}-1, b^{\phi(m)}-1)$, and so there is a prime $> B$ in the support of $\gcd(a^{n^2}-1, b^{n^2}-1)$. </p> http://mathoverflow.net/questions/83168/what-can-be-said-about-number-theoretic-properties-of-the-solid-angle-measures-of Comment by Anonymous Anonymous 2011-12-11T22:31:08Z 2011-12-11T22:31:08Z @Theo: I learned about it on math.stackexchange: Two proofs are at <a href="http://math.stackexchange.com/questions/79861/arctan2-a-rational-multiple-of-pi" rel="nofollow" title="arctan2 a rational multiple of pi">math.stackexchange.com/questions/79861/&hellip;</a> http://mathoverflow.net/questions/83168/what-can-be-said-about-number-theoretic-properties-of-the-solid-angle-measures-of Comment by Anonymous Anonymous 2011-12-11T20:19:31Z 2011-12-11T20:19:31Z It seems your pessimism is justified. If theta is a rational multiple of $\pi$, then $2\cos(\theta)$ is an algebraic integer. But if $\theta = \arctan(\sqrt{3}/5)$, then $2\cos(\theta) = 5/\sqrt{7}$. http://mathoverflow.net/questions/80367/primes-and-ackermanns-function Comment by Anonymous Anonymous 2011-12-10T05:31:48Z 2011-12-10T05:31:48Z Timothy, I think you'd enjoy looking at the paper Iterated exponents in number theory, by D.B. Shapiro and S.D. Shapiro: <a href="http://www.math.osu.edu/~shapiro/IE.pdf" rel="nofollow">math.osu.edu/~shapiro/IE.pdf</a> http://mathoverflow.net/questions/80865/least-prime-in-a-arithmetic-progression/80867#80867 Comment by Anonymous Anonymous 2011-11-14T20:24:21Z 2011-11-14T20:24:21Z Two quick comments. It's maybe interesting to note that for prime $q$, it's easy to establish the Monthly bound: <i>Any</i> prime divisor $p$ of $2^q-1$ works. Also, I'm skeptical of the bound attributed to Oesterle. I'd wager that the best bounds, on ERH, are those in ams.org/journals/mcom/1996-65-216/ Note that their upper bound is bigger than $q^2$, and so doesn't settle the OP's problem. The discussion in this paper also suggests the result attributed to Oesterle is based on a misunderstanding or a typo. http://mathoverflow.net/questions/71155/multiplicative-functions-whose-dirichlet-series-have-essential-singularities/71183#71183 Comment by Anonymous Anonymous 2011-07-25T14:03:36Z 2011-07-25T14:03:36Z As for your general question, it appears that certain sorts of essential singularities (e.g., the sort that appear in this example) can be handled by the Selberg--Delange method, which is described in Chapter II.5 of Tenenbaum's book. http://mathoverflow.net/questions/70647/approximate-primitive-roots-mod-p/70711#70711 Comment by Anonymous Anonymous 2011-07-21T21:13:17Z 2011-07-21T21:13:17Z I think that's right. The proof of Lemma 20 in that paper shows that you could improve $0.323$ to $\epsilon$ if you knew that there were infinitely many shifted primes $p-1$ with prime factors $&gt; p^{1-\epsilon}$. Of course we think that $p-1$ is infinitely often twice a prime, which is much stronger and which would give the boundedness you originally asked for -- but this still seems hopeless. (However, progress towards this sort of conjecture plays a key role in the proof of the Heath--Brown proof you mentioned, and in the earlier work of Gupta and Murty.) http://mathoverflow.net/questions/70371/greatest-common-divisor-of-a2n-1-and-b2n-1/70534#70534 Comment by Anonymous Anonymous 2011-07-17T02:04:18Z 2011-07-17T02:04:18Z Well, I guess I've actually made things too hard here, since $\gcd(a^n-1, b^n-1) \mid \gcd(a^{n^2}-1, b^{n^2}-1)$; hence the support problem is trivial, again by Fermat's little theorem. I'll leave my answer up for now though.