Question

Can we expect to find $r,$ large enough, so, $\sum_{n\in \mathbb Z} \frac{(1+n^{2})^{s}}{1+(n-y)^{r}}\leq C (1+y^{2})^{s} $ for all $y\in \mathbb R$?

score 40 · Answer 1 · 2014-08-08 07:24:05

40

Views

Can we expect to find $r,$ large enough, so, $\sum_{n\in \mathbb Z} \frac{(1+n^{2})^{s}}{1+(n-y)^{r}}\leq C (1+y^{2})^{s} $ for all $y\in \mathbb R$?

Published on 08 Aug 2014 - 7:24

score 1.2k · Answer 2 · 2014-08-08 08:04:30

1.2k

Views

Smallest prime factor of a Mersenne number

Published on 08 Aug 2014 - 8:04

score 43 · Answer 3 · 2014-08-08 09:25:38

43

Views

Inequality $k!\pi+\frac{\pi}{6}\le{m!}\le{k!}\pi+\frac{5\pi}{6}$

Published on 08 Aug 2014 - 9:25

score 270 · Answer 4 · 2014-08-08 20:15:35

270

Views

Computing infinite product over primes

Published on 08 Aug 2014 - 20:15

score 548 · Answer 5 · 2014-08-10 04:01:57

548

Views

Divisor function asymptotics

Published on 10 Aug 2014 - 4:01

score 148 · Answer 6 · 2014-08-10 22:13:18

148

Views

Is any elementary proof important (beside Selberg's work) ?

Published on 10 Aug 2014 - 22:13

score 280 · Answer 7 · 2014-08-12 18:23:39

280

Views

Upper bounds for Euler's totient function on a set of numbers with unbounded number of prime divisors

Published on 12 Aug 2014 - 18:23

score 2.6k · Answer 8 · 2026-03-27 23:30:44

2.6k

Views

Twisting modular forms by Dirichlet characters

Published on 27 Mar 2026 - 23:30

score 69 · Answer 9 · 2014-08-13 17:03:54

69

Views

Asymptotic behaviour of $\prod_{p \leq x} (1 + 4/(3p) + C p^{-3/2})$

Published on 13 Aug 2014 - 17:03

score 3.3k · Answer 10 · 2014-08-14 04:29:26

3.3k

Views

Upper bound for Euler's totient function on composite numbers

Published on 14 Aug 2014 - 4:29

score 337 · Answer 11 · 2014-08-14 05:01:23

337

Views

Upper bound for Euler's totient function on composite Mersenne numbers

Published on 14 Aug 2014 - 5:01

score 1k · Answer 12 · 2014-08-14 21:10:05

1k

Views

Euler's totient function and limits

Published on 14 Aug 2014 - 21:10

score 391 · Answer 13 · 2026-03-29 14:07:06

391

Views

Can anyone recommend an easy to read algebraic number theory book?

Published on 29 Mar 2026 - 14:07

score 183 · Answer 14 · 2014-08-15 00:49:21

183

Views

Bounding error when iterating a function

Published on 15 Aug 2014 - 0:49

score 342 · Answer 15 · 2026-03-27 23:31:13

342

Views

On the square coeffecients of a modular form

Published on 27 Mar 2026 - 23:31

List Question

Can we expect to find $r,$ large enough, so, $\sum_{n\in \mathbb Z} \frac{(1+n^{2})^{s}}{1+(n-y)^{r}}\leq C (1+y^{2})^{s} $ for all $y\in \mathbb R$?

Smallest prime factor of a Mersenne number

Inequality $k!\pi+\frac{\pi}{6}\le{m!}\le{k!}\pi+\frac{5\pi}{6}$

Computing infinite product over primes

Divisor function asymptotics

Is any elementary proof important (beside Selberg's work) ?

Upper bounds for Euler's totient function on a set of numbers with unbounded number of prime divisors

Twisting modular forms by Dirichlet characters

Asymptotic behaviour of $\prod_{p \leq x} (1 + 4/(3p) + C p^{-3/2})$

Upper bound for Euler's totient function on composite numbers

Upper bound for Euler's totient function on composite Mersenne numbers

Euler's totient function and limits

Can anyone recommend an easy to read algebraic number theory book?

Bounding error when iterating a function

On the square coeffecients of a modular form

Trending Questions

Popular # Hahtags

Popular Questions