« first day (4034 days earlier)      last day (1284 days later) » 

00:00
@TedShifrin perhaps, the only thing that wasn't a waste about that experience if so
Yeah, measure theory is quite formal.
@TedShifrin perhaps, the only thing that wasn't a waste about that experience if so
formalizing the reals is indeed one of the more empty and unrewarding tasks in mathematics. they can be approached axiomatically without a construction.
I am merely trying to answer my own question, I have no pûrpose
thankfully, I also managed to pick up a degree of geometric thinking along the way
oops, double send, my internet just stuttered
00:01
Got it, Thor.
Did you learn any linear algebra, @rapasite?
yeah 101 but not soo mutch more
Since you have physics interest, maybe some intro diff geo might be more fun for you.
I did vector space eigenvalue and other basic stuff
thorgott i've been having that a lot too. not just here but on office stuff.
OK, cool. Plenty.
00:03
I believe learning a construction of the reals is something one should've seen at some point in their lives, but without any sense of urgency
Download my free diff geo notes, @rapasite. Link in profile.
goemetry diferantial?
@Thorgott I disagree, for the typical math student.
I'm just not a fan of working with objects whose existence you've never proven in the long run (emphasis on "in the long run")
ha, my wife just went looking for some new clothes and the cat was in a hamper of folded laundry and attacked her when she looked inside of it. feel free to ask me more about the benefits of cat ownership.
00:13
My cat is growing yuger and mostly bites me.
livvy jumped out of the hamper, grabbed my wife's leg, bit it, and then ran away. there will be a bruise.
cats are very strange, in evolutional terms. they're horrible but somehow we have them domestically.
They can be affectionate, but the hunter instinct is there. My cats in GA actually did hunt outside and then were mostly sweet inside. Sadly, the coyotes were also hunting them, outside.
ted thanks for you course but what is the link between the exemple
growing up we had a cat who would leave us pieces of squirrels on the doorstep. we don't let livvy out for this reason.
she likes watching wildlife from the window, and killing spiders and moths as she finds them in the house. that's enough.
god, it was digusting. i'd get ready for school, open the door, and it's four squirrel limbs and a tail on the doormat.
cats are predators.
I don’t understand your question, @rapasite. Nothing to do with constructing real numbers. Just more interesting mathematics.
That is less abstract.
00:24
never mind it start to make sense at page
Yes, I had mice and the occasional bird, too, leslie. Ugh.
First pages are lots of examples of parametric curves. Most are important for later.
00:57
ted I can see the tangent vector T and the curvature as the rayon of the tangent circle, what is the intuition for Torsion? the angle between them?
they should be perpendicular
01:10
No, torsion is twisting of the osculating plane.
osculating?
ok so it's kind of a curvature of this plane
i feel like i should know this, but
obviously, there are rational points on a circle. but the only one i know (assuming 0<x<y<1 for definiteness) which has a finite decimal expansion is (0.6,0.8)
Are there any others? I don't think so but it seems unlikely
01:26
rational points?
Infinitely many … see exercises at end of section 1.1 of my diff geo notes. A recipe for all Pythagorean triples.
yeah. coming up with rational points is easy
but the examples i know would have repeating decimal representations
(0.28,0.96) is another one
You’re asking for finite decimals. I see.
ahh, nice
01:30
So you need factors of 2 and 5 only for the hypotenuse.
right
and that's not too bad, come to think of it
The rational parametrization of the circle should generate these.
since the hypotenuse in a pythagorean triple needs to itself be a sum of squares
my example is just the square of your example, I realized
I don't know whether powers of this example are the only examples
any heard about total order please?
01:33
Plugging rationals into the rational parametrization gives all points. Just plug in appropriate rationals.
so, I'm trying to figure out if there exists functions that fill up intervals of the real line in the following way: (of course, they don't ever finish filling it up)
a
			f(3)
		f(1)
			f(4)
	f(0)
			f(5)
		f(2)
			f(6)
b
etc, where [a,b] is an interval on the real line. anyone has a clue? above, f(0) is halfway between a and b, f(1) is halfway between f(0) and a, f(4) is halfway between f(0) and f(1), etc.
eh. that moves the problem back to finding t such that (1-t^2)/(1+t^2) and 2t/(1+t^2) have finite decimal expansions
which doesn't seem much easier
@shintuku this feels Cantor-ish
so basically looking for a function which would index Cantor's set
shin, you're describing an enumeration of the dyadic rationals if a=0,b=1
You need $t$ so that $1+t^2$ is divisible only by 2 and 5?
bless you both for these search terms
01:36
given that 0<t<1, that's definitely not the correct way to understand that
unless divisibility of rationals means something different
No, $t$ can be an integer, silly.
um
f?
oh. true (assuming you meant t)
You parametrize the circle by $\Bbb R$.
I hate typing on phone.
fair
yeah, that works
had to convince myself that the minus signs in the usual parametrization were irrelevant
I have no idea what you’re talking about.
01:42
for t>1, x = (1-t^2)/(1+t^2) would be negative
but that's just b/c of how i wrote the parametrization. could've just as well done (t^2-1)/(1+t^2)
Oh. Then you use $1/t$.
sure, but then you're back to having 0<t<1
But you found it with integers.
@rapasite Read section 1.2. Planes don’t have curvature. Rate of turning of its normal, yes.
01:57
there's probably a more efficient way for me to do this, but doing a brute-force check of whether $2^j 5^k=1+t^2$ for rational $t$ has only given me $t=2,7$ so far (checking j,k up to 200)
t=2 is the usual (0.6,0.8) example, t=7 is the (0.28,0.96) example
so maybe there's no other examples? (not that checking this much is anywhere near definitive)
I haven’t tried. I would start with the modular arithmetic and Chinese remainder.
Or just let the computer run. I don’t be even know why this is a good question.
since it depend on our decimal writing i am not sure it's fundamental
Yup, excellent comment.
because it's interesting if there's only a finite number of examples for a given base
 
1 hour later…
03:38
For something entirely different from that
i just stumbled across an example of two polytopes which are combinatorially equivalent (same number of vertices, edges, ..., facets) but not affinely equivalent
so that's neat
i mean, it's obvious that it can occur just judging from the 2D case of rectangles and squares. rather rmore startling to have it show up in a 8D case
(i also have no idea why they're combinatorially equivalent, i'm just going based on Polymake)
03:55
But rectangles and squares are affinely equivalent.
I have no knowledge of this stuff …
...yes, that was dumb
squares and trapezoids
They are too.
really? take the unit square [0,1]^2 and move the (1,1) vertex to (1,2). that's a trapezoid, but there's no linear transformation that would send (0,0)->(0,0), (0,1)->(1,0), (0,1)->(0,1), and (1,1)->(1,2)
Affine transformation, not linear.
i'm still confused. affine transformations should preserve parallelism, shouldn't they?
04:04
Yes. I need to check my algebra book to see what I’m vaguely remembering.
also if (0,0) -> (0,0) then x-> Ax+b requires b=0, so linear. (of course i'm assuming (0,0) -> (0,0) which is a bit of a cheat)
Oh, all trapezoids are affinely equivalent to an isoceles traoezoid.
hmm. yeah, i can see that
Parallelepiped affinely equivalent to cube.
I'd share the underlying example, but 1) I think it might be too boring, and 2) I'm writing it up as a question right now
04:09
No problem.
04:46
@Semiclassical There are infinite examples. The primitives triples (a, b, c) with c a power of 5. The next one is (44, 117, 125). See here
yeah, i figured that out. next one should be (336,527,625)
ooo, but that is a snazzy way to do it
yeah, i devolved to having mathematica do it for me
and it does validate the idea that doing the (3,4,5) case suffices to generate the rest
just higher and higher powers of 3-4i
Triads can be organised into a tree. en.wikipedia.org/wiki/Tree_of_primitive_Pythagorean_triples That article mentions a couple of solutions.
huh, nice, i haven't seen that before
04:51
We just need to show there's no triad with $c=2^n$. That's not too hard.
i thought as much but didn't immediately see how to deduce it
(though i didn't really think about it)
Pythagorean triads are a fun application of Gaussian integers.
i'm guessing the point is that, while you can write $c=a^2+b^2$ in that case, you'll never have coprime $a,b$
so it always reduces down to a smaller case
$(u+iv)^=(u^2-v^2) + 2uvi$ and $|(u^2-v^2) + 2uvi| = u^2+v^2$, which leads us to the standard way to generate triads.
nice
actually, it looks like the case of $2^n$ divides into two
04:59
The "problem" is that the Gaussian factorization of 2 is $(1+i)(1-i)$. So when we take even powers of either factor, we don't get mixed complex Gaussians (which would give us a triad), just pure reals or pure imaginaries. I.e., one of the legs of our triad is always zero.
if $n$ is even, then $c=2^{2k}=(2^k)^2$ and it doesn't seem as if $c$ can be written as a sum of two squares
if $n$ is odd, then $c=2^{2k}=(2^k)^2+(2^k)^2$ which doesn't generate a valid triple
so I think $2^n$ can never be written as a sum of distinct squares
Right
I take it that's the analogue what you just said, without any details to back it up :P
if we take $c=2\cdot 5^k$, is it obvious that that reduces to the case $c=5^k$?
the case $c=4\cdot 5^k$ definitely does
05:05
The Gaussian integers are a unique factorization domain. And only (real) primes not of the form 4n+3 can be factorized in the Gaussians. And of course, that factorization gives us a sum of 2 squares.
2 is the oddball case. It's not 4n+3, so it can be factored. But it's not 4n+1, and it's (obviously) the only one where the real & imag parts of the factor are equal.
I think Conway said: "All primes apart from 2 are odd, and 2 is the oddest prime of all".
so this is a problem that's doable but awkward
b/c of the 2's
Well, once we show that 2 gives us a degenerate triad for $0^2 + 2^2=2^2$, we're basically done, because none of the higher even powers can work either.
Otherwise, there'd be an alternative Gaussian factorization of that power of 2, which is impossible.
ah, neat
05:24
I'm getting lots of timeout errors here. My last 2 posts just disappeared. :( Oh well.
Multiplying two complex numbers on the unit circle corresponds to rotation. And for these rational points like $(.6+.8i)$, each $(.6+.8i)^n$ is unique, so we know that $\tan^{-1}(.6/.8)$ can't be a rational multiple of $2\pi$.
05:45
A silly way to plot the complex unit circle is to choose any point on it, take the square root, randomly choose to multiply by -1, plot & repeat. You quickly cover a high proportion of the points. This is basically the backwards iteration method of plotting the Julia set of $z^2 - 1 = 0$
Sorry. That should be $z = z^2$. Oops
It's been a while since I played with this stuff...
in Python on Stack Overflow Chat, Oct 11 '18 at 14:58, by PM 2Ring
Here's a silly circle drawing program I put together a couple of hours ago. It's based on the old formula for generating Pythagorean triads: a=u²-v², b=2uv, c=u²+v². Also note that for complex z=u+iv, z² =a+ib, so if (u,v) is a point on the unit circle with angle θ from the +ve X axis, then (a,b) is also on the unit circle with angle 2θ.
That program is doing the forward iteration, starting from $(1+2i)/\sqrt5$
06:21
Here's a variation in Sage. It uses translucent points so you can (sort of) see which regions get hit the most.
06:43
If we have : $ 5^3 X 5^2 ÷7^2 $
Then , can we write$ 5^{3+2} $ ÷ $7^2$
 
1 hour later…
07:49
@schn By itself, the definition of little-o says $\lim\limits_{hu\to0}\frac{f(h,u)}{(hu)^m}=0$. However, in my answer, there is the context of the integral in which the estimate is being used. The difficulty is that this concept cannot be abstracted into a calculus in the way that you seem to want to do. Context tells us whether $h$ and $u$ are each bounded away from $0$ or not.
 
1 hour later…
08:58
0
Q: If $P$ is a Sylow $2$-subgroup of $D_{2n}$ then $N_{D_{2n}}(P)=P$.

Peter John Let $2n= 2^ak$ where $k$ is odd. Prove that the number of Sylow 2-subgroups of $D_{2n}$ is $k$. [Prove that if $P\in Syl_2(D_{2n})$ then $N_{D_{2n}}(P)=P$.] This question was already asked here. But none of the answers proved $N_{D_{2n}}(P) = P$. I want to prove the statement by proving $N_{D_{...

Question related to Sylow theorem. The question was asked before but I found none of the answers proved the statement by proving the suggested hint.
 
1 hour later…
10:17
1
Q: Getting strict inequality in $|f(x)|\le \frac 1x$, $x\gt 0$, where $f(x)=\int_x^{x+1} \sin t^2 \, dt$

KoroGiven that $f(x)=\int_x^{x+1} \sin t^2 \, dt$ Substituting $u=t^2$ gives: $f(x)=\int_{x^2}^{(x+1)^2}\frac{\sin u}{2\sqrt u}\,du=\frac{\cos x^2}{2x}-\frac{\cos (x+1)^2}{2(x+1)}-\int_{x^2}^{(x+1)^2}\frac{\cos u}{4u^{3/2}}\, du$ It follows that $|f(x)|\le\frac 1{2x}+\frac 1{2(x+1)}+\frac 1{2x}-\frac...

How do I prove the strict inequality?
A slightly more compact way to put it: show that $\Big|\int_x^{x+1} \sin(t^2)\,dt\Big|<1/x$ for $x>0$
more compact titles are generally better
any suggestion on how to solve the inequality problem @Semiclassical
6 mins ago, by Koro
1
Q: Getting strict inequality in $|f(x)|\le \frac 1x$, $x\gt 0$, where $f(x)=\int_x^{x+1} \sin t^2 \, dt$

KoroGiven that $f(x)=\int_x^{x+1} \sin t^2 \, dt$ Substituting $u=t^2$ gives: $f(x)=\int_{x^2}^{(x+1)^2}\frac{\sin u}{2\sqrt u}\,du=\frac{\cos x^2}{2x}-\frac{\cos (x+1)^2}{2(x+1)}-\int_{x^2}^{(x+1)^2}\frac{\cos u}{4u^{3/2}}\, du$ It follows that $|f(x)|\le\frac 1{2x}+\frac 1{2(x+1)}+\frac 1{2x}-\frac...

the strict inequality looks correct desmos.com/calculator/1xx7qgrvam
one idea is to rewrite the problem as showing $-1<g(x)<1$ where $g(x)=x f(x)$
with the advantage that now you can find critical points
hmm
actually, i say that but
the condition becomes $g'(x)=f(x)+x f'(x)=0$
and good luck solving that
it complicates things a lot. doesn't it?
actually, i take that back somewhat. If $g'(x)=0$ then the value at this $x$ is $g(x)=-xf'(x)=x \sin(x^2)-x\sin((x+1)^2)$
no, this is nonsense
10:31
:(
i mean, it's not wrong but it's not useful
10:47
How hard is it to read mathematical french?
Is there something I should look out for? I have read this paper by Deligne
might be easier to read than mathematical german, less declensions
best i can see (which is interesting but not exactly useful) is that, if you linearize $t^2$ about $t=x+1/2$, then the integral comes out to $f_1(x)=(x+1/2)^{-1} \sin(x+1/2)\sin((x+1/2)^2)$
which is quite a good approximation of the original integral, getting better as $x$ increases
11:07
one other somewhat interesting point, derived from the above and some numerical experimentation: $|f(x)|$ seems to almost satisfies the stronger inequality $|f(x)|<1/(x+1/2)$
11:22
it only fails at about $x=4.33$, and even there only by about $4\times 10^{-4}$. but it does fail there. (by contrast, $f_1(x)$ does satisfy this bound. both satisfy the weaker $<1/x$ bound)
12:07
Can scan someone help me with this series?
((x^2n)/sqrt(n))log(17x²/sqrt(n))
help you do what with it?
how can i proceed? I calculated the limit of an and it tends to 0, so they converge. i don't know how to calculate for which x to converge
so evidently you're asking for the interval of convergence of that series. (if you don't say that in the first place we have no way of knowing)
that said...yeah, that looks yikes
the big red flag being that x^2 inside the log
i'm also not seeing how you're so confident of the limit. plotting with wolfram, it looks like the terms diverge as n->infinty when x>1:
the growth is slower if you reduce x from 2 to 1.1, but it still inexorably diverges
12:37
lim of that logarithm came to me 0 :(
Polar form of -2i and -4
What is Polar form of -2i and -4??
I wrote it as 2(cos pi/2 + i sin pi/2) and 4(cos 3pi/2 + i sin 3pi/2)
But my answer is incorrect
what are sin(pi/2) and sin(3pi/2)? (and cos(3pi/2), for that matter)
@MarkosAndres the log by itself would, sure. but you're multiplying it by x^(2n)
take x=2, for instance. then you've got 4^n/sqrt(n) * log(68/sqrt(n))
actually, ignore what i said about "the log by itself"
there's two points to consider here. first, it is of course true that log(68/sqrt(n)) is initially decreasing: you're making 68/sqrt(n) smaller. but once sqrt(n)>68, i.e., n>68^2, then log(68/sqrt(n)) will become increasingly more and more negative. so log(68/sqrt(n)) will eventually start getting bigger in magnitude
second is 4^n/sqrt(n). the sqrt(n) will make things decrease, sure, but 4^n grows much much faster
so you've got one function which slowly gets small and then slowly gets bigger, and one function which is always getting bigger and bigger
together, that means the function blows up
(assuming x>1. if x<1 then x^(2n) rapidly shrinks, so goes to zero. if x=1 you've got 1/sqrt(n) * log(17/sqrt(n)), and the 1/sqrt(n) out front will ensure it the function converges to zero. but it'll converge much more slowly)
 
1 hour later…
14:24
Happy Friday
Let $f$ be an essentially bounded function on a measure space $(X, \mu)$ (we can assume $\mu(X) < \infty$ if necessary). I know the simple functions form a dense set in $L^{\infty}(X,\mu)$, so there exists a sequence of simple functions $\phi_n$ converging to $f$ in $||\cdot||_{\infty}$. May I conclude from this that $\int_{X} f d \mu = \lim_{n \to \infty} \int_{X} \phi_n d \mu$?
15:14
yeah. |int f - int phi_n| <= int |f - phi_n| <= mu(X) ||f - phi_n|| which by hypothesis goes to zero.
unless i'm missing something.
sorry for not texing that.
15:53
@robjohn , thanks for the reply. Interestingly, I would have said, based on equation 1 in your answer, that little-o by itself says $\lim\limits_{hu\to0}\frac{f(hu)}{(hu)^m}=0$, that is, $f(hu)$ instead of $f(h,u)$. I guess the notation $f(hu)$ implies $f(h,u)$, as in $f(hu)=(hu)^m=f(h,u)$. However, probably not the other way around; $f(h,u)=h^2+u^2\neq f(hu)$.
16:09
I realize $f(h,u)$ could not possibly imply $f(hu)$, since the former denotes a function with two inputs whereas the latter only a function with one input. Hence, the not-equals sign does not make much sense.
16:31
When $f(h,u)$ actually is a function where $h$ and $u$ appear as a product, then $f(h,u)$ could probably be denoted as $f(hu)$.
 
1 hour later…
18:01
@schn Only if all occurrences of $h$ and $u$ are as $hu$ could it be interpreted that way. If that were the case, why have both $h$ and $u$?
18:41
hi
Bye ted
Sayonara
18:53
godspeed
Hey so Lie was interested in studying symmetries of PDE
And Noether's theorem is in that vein
But do lie groups still get used for that?
porhlara
it means damn in portuguese
19:08
Huh when I googled it all I got was porn
you have to type it into google translate
co-manifold
did you know Belgium has better computers than the rest of the world.
what's an example of a measure-preserving map
why is it easier to verify a solution than to construct a solution?
what's an example of a measure preserving map $f:\Bbb R^2 \to \Bbb R^2$ other than the constant map
19:37
a rotation or translation
is a large kernal space for an integral transform a good property for an integral transform to have?
probably not
Fourier, Laplace, Mellin are all isometries on L^2
and have trivial kernel on L^p, i think
similarly for the ones that are propagators for PDE
Constant map? Definitely not measure-preserving. Think, man.
nevermind
in addition to what leslie said, any translation
20:17
Leslie included translations?
20:39
Give a subset of $\Bbb R$ that, when given the subspace topology is homeomorphic to $\Bbb Z$, and when given the order topology is homeomorphic to $\Bbb Q$
(I think this one's fun)
20:50
@TedShifrin perhaps his identity is constant and so he mixed up the identity and constant maps?
21:17
@geocalc33 expanding twice in $y$ and contracting $\frac12$ in $x$.
@AkivaWeinberger p-adics?
@robjohn Those aren't a subset of $\Bbb R$
oh, yeah. nvm
21:36
It's interesting how $[0,1]\cup(2,3]$ is connected in the order topology
By the way, from a friend:
A puzzle I do not know the answer to
@AkivaWeinberger right, $[0,1]$ is closed but not open and $(2,3]$ is open but not closed.
@robjohn As opposed to the subspace topology, where they're both open.
@AkivaWeinberger: but adding $2$ to the set disconnects it?
21:52
Yeah @robjohn
Yeah, I was confuzled because first I read it as $[2,3]$.
22:20
what do I need for a sum (not necessarily converging) that alternates what terms it adds? like 1/i for all even i, then 1/(2*i+3) for all odd i. or just keep it seperate and add at the end?
@SAJW you could define a piecewise function from $\mathbb{N}$ to $\mathbb{N}$ that is the sequence of partial sums of your desired sum
whoops, it doesn't need to go to $\mathbb{N}$, it could go to $\mathbb{R}$, so $f: \mathbb{N} \to \mathbb{R}$
@SAJW I am not sure what you mean by "what do I need". What is the desired thing that you want? Are you asking about $\sum\limits_{i=i}^\infty(-1)^ia_i$?
a summation that adds different terms based on conditions:

f:N->R

f(x)=1/x if x is even
f(x)=1/(2x+3) if x is odd

does $\sum_{i=0}^{k} f(i)$ make sense then?
22:35
Sure, that makes sense as long as you specify that $x\in\mathbb{Z}$.
in that example for x=0 there would have to be another condition, but that's not the point, thanks
@shintuku thanks you too :)
@SAJW yes, your sum would have to start at $1$.
is there some trick that multiplies by 0 if even and by 1 if odd?
then I could express it only with a sum
not that it would improve readability... just curious
You can define a function to be $0$ for evens and $1$ for odds. There are many ways to do so with existing functions: $\frac{1-(-1)^n}2$, $n\bmod2$, and lots of others.
or you can just define a function to be that.
$$\sum_{n=1}^\infty\left(\frac{1+(-1)^n}{2n}+\frac{1-(-1)^n}{4n+6}\right)$$
what is better mod 2 or $\frac{1-(-1)^n}{2}$?
with a computer
my guess is mod 2 because it just looks at the bit at the end of the number
22:50
they are both the same. A computer might work better with ($n$ bitwise and $1$) equals $1$
in C, (n&1)==1
actually, you could just use n&1 since anything other than 0 is considered true.
23:21
@AkivaWeinberger fascinating!
do there exist infinitely many series' that converge to Pi?
yes or to any other number.
and how are decimal places proven? that they don't change when iterating further or how?
@SAJW continuum-many, actually, so more than $\mathbb{N}$-infinity
23:37
@leslie any ideas on DogAteMy (Akiva)’s challenge?
@SAJW i was just reading Hardy's An Introduction to the Theory of Numbers, might want to check chapter 9 where he discusses exactly all those questions you've just asked
nothing comes immediately to mind, but that's good. point set topology was never my strong suit.
Hello everyone. I don't have a lot of experience in plotting, but I still want to visualize the Worm domain, which lives in complex dimension 2. It consists of two complex parameters z_1 and z_2 and now I want to plot a slice of dimension 3 and let Im(z_2) change over time. I tried this in Mathematica, but it's really slow - when I change Im(z_2) only a little bit, the whole thing takes at least half a minute to plot again, so a smooth transition is not in sight right now. Any tips?
Yeah, but this is just $\Bbb R$!!
it's annoying, i ought to be able to do this.
23:42
I taught point set at least 6 times, so worse that I can’t see it :)
Seems paradoxical
23:54
$f: \mathbb{N} \to B$ is surjective and $g: B \to \mathbb{N}$ is injective. Is there a reason why Author uses, for $b \in B$, $f^{-1}(\{b\})$ to designate $\{a \in \mathbb{N}: f(a) = b\}$, or could we also use $f^{-1}(b)$?
when f is not invertible, f^{-1} is a set mapping but not necessarily a point mapping. that may be the reason for the notational change. i would understand the two to be the same thing.
when i say set mapping, i mean, f^{-1} may not be a function from B to N. it is at a minimum a function from subsets of B to subsets of N.
hm, what would distinguish a point-mapping from a set-mapping?
in so far as a point-mapping is a function and a set-mapping is simply a relation, i.e. $\langle x, y_1 \rangle, \langle x, y_2 \rangle \in f^{-1}$ does not necessarily imply $y_1 = y_2$? (if I understood your last comment correctly)
@shintuku will do that eventually

« first day (4034 days earlier)      last day (1284 days later) »