Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 37555

Real-valued functions of real variable, analytic properties of functions and sequences, limits, continuity, smoothness of these.

1 vote

Lebesgue measure of the set $\frac{1+x}{1+y}$ with $x,y$ in a fat Cantor

Call a set $A\subseteq[a,b]$ thick in the interval $[a,b]$, if for all $t\in(a,b)$ we have $|A\cap[a,t]|>0.6(t-a)$ and $|A\cap[t,b]|>0.6(b-t)$. The pigeon hole principle implies that if $A, B$ are thi …
Jan-Christoph Schlage-Puchta's user avatar
5 votes
Accepted

Unknown bias in a distribution related to prime numbers

The number of totient divisors of $n$ is $d(n-1)-d((n-1, \varphi(n))$. As $n$ gets large, then almost all $n$ have the property that $\varphi(n)$ is divisble by all small primes. The average number of …
Jan-Christoph Schlage-Puchta's user avatar
3 votes
Accepted

Collection of graduate research projects in Real Analysis

Make Weyl-van der Corput estimates explicit: Let $f:[a,b]\rightarrow\mathbb{R}$ be a somewhat smooth function, and assume that you have some bounds on certain derivatives of $f$. Then give an upper b …
3 votes
Accepted

Prove that $\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2})$

Write the function $x\mapsto\{x\}-\frac{1}{2}$ as a Fourier series, and approximate this series by a smoothed finite sum using Vaaler's lemma. You obtain something of the form $$ \sum_{a<n\leq b}\left …
Jan-Christoph Schlage-Puchta's user avatar
1 vote

The weighting function for the infinite product of necklaces

The number of necklaces of size $p$ is $\frac{a^p}{p}+\mathcal{O}(a^{p/2})$, hence $$ \prod_{p=1}^nN(p,a)=\frac{a^{n(n+1)/2}}{n!}\prod_{p=1}^n\left(1+\mathcal{O}(a^{-p/2})\right) = \left(c+\mathcal{O} …
Jan-Christoph Schlage-Puchta's user avatar
1 vote
Accepted

Pros and cons of probability model for permutations

Which formula to prefer depends mainly on what you want to do with it. Do you need high precision, or do you have to do complicated things with the approximation? The expansion in Hermite-polynomials …
Jan-Christoph Schlage-Puchta's user avatar