I wasted like 60 seconds a day marking drafts in Thunderbird as read after using the <a href="https://addons.mozilla.org/en-us/thunderbird/addon/send-later-3/" target="_blank">SendLater</a>-Plugin. The following <a href="http://www.autoitscript.com/site/" target="_blank">AutoIt</a>-Scripts that runs in background now saves this precious amount of time!
```autoit
$x_offset = 80
$y_offset = 140
TraySetIcon('C:\Program Files (x86)\Mozilla Thunderbird\thunderbird.exe', 1)
While 1
WinWait('[TITLE:Send this email later; CLASS:MozillaDialogClass]')
WinWaitActive('[REGEXPTITLE:Mozilla Thunderbird]')
Sleep(1000)
$tb_pos = WinGetPos('[REGEXPTITLE:Mozilla Thunderbird]')
$mouse_pos = MouseGetPos()
MouseClick('right', $tb_pos[0]+$x_offset, $tb_pos[1]+$y_offset, 1, 0)
Send('{UP 4}{ENTER}')
MouseMove($mouse_pos[0], $mouse_pos[1], 0)
WEnd
```
After discovering <a href="http://docs.mathjax.org/en/latest/tex.html#action">the toggle command</a> available in <a href="http://mathjax.org">MathJax</a>, I immediately went to <a href="http://tex.stackexchange.com/questions/91104/maction-for-pdf-files">asked the capable people</a> of <a href="http://tex.stackexchange.com/">tex.stackexchange</a> whether this could be done inside a PDF file. And indeed: It can be done!
```Latex
\documentclass{article}
\usepackage{animate}
\begin{document}
\begin{animateinline}[step]{1}
\strut$x=1$
\newframe
\strut$x=2$
\newframe
\strut$x=3$
\end{animateinline}
\end{document}
```
Now, what do I want with this package? I want to do <a href="http://en.wikipedia.org/wiki/Abstract_nonsense">abstract nonsense</a>. A diagram-based proof should, in my opinion, be a slideshow. You start with the diagram that is your assumption and by simply interacting with the diagram (clicking it), in each step, a new arrow is constructed from some universal property.
I wanted to write a neat animated PDF with an abstract nonsense proof of the famous <a href="http://en.wikipedia.org/wiki/Snake_lemma">Snake Lemma</a>, and there is a <a href="http://books.google.com/books/about/Handbook_of_Categorical_Algebra_2.html?id=La3gAAAAMAAJ&redir_esc=y">great book by Francis Borceux</a> containing a proof, but <a href="http://math.stackexchange.com/q/314693/11653">unfortunately, I was unable to overcome a difficulty with the proof</a>, so that will have to wait until someone answers my question.
Looking at <a href="http://lehnhof.net/blog/">Roman's beautiful blog</a>, I really couldn't take it no more. I finally removed that scourge of a tiny font size from the blag, now it is actually possible to read everything on a commonly shaped screen. At this point I wished this had been done in <a href="http://www.lesscss.de/">LESS</a>, because then I would probably only have to change two variables in order to achieve, what now took me, approximately one hour.
Let $K\subseteq L$ be a field extension, and let $V$ be a $K$-vector space. The <b>extension of $V$ by scalars in $L$</b> is the tensor product $E=V\otimes_KL$. I will prove that every $L$-vector spaced is obtained as some extension in this way and that $\dim_L(E)=\dim_K(V)$.
<a href="https://blag.nullteilerfrei.de/2013/02/26/extension-by-scalars-and-dimension/#more-1390" class="more-link">Do you want to know more?</a>
I learned three new Windows shortcuts today:
* Win + Pause: System Properties
* Alt + Space, n: Minimize window
* Alt + Space, x: Maximize window
Especially the latter two are very useful for me.
On Android Smartphones you can use <a href="http://www.google.com/mobile/maps/">GoogleMaps app</a> for Navigation — unfortunately, it requires an internet connection and this can be very expensive if you use this outside your home country. Therefore, I was looking for a free app which supports downloading the entire maps for certain regions. I think <a href="http://www.navmii.com/gpsnavigation">Navfree</a> does the job.
Most people probably know about <a href="http://stacks.math.columbia.edu/browse">the stacks project</a>, but fewer might have heard about <a href="http://people.fas.harvard.edu/~amathew/cr.html">the CRing project</a>. Now, there might be certain disadvantages to having a large number of contributors to a single document, but I would like to put some emphasis on the one, big advantage: You <i>actually</i> end up with a <i>very</i> complete reference, not just the narrower standpoint of one or two authors. If done correctly, group efforts of this sort are the perfect way to cover all basic (whatever that means) knowledge in some field. I really hope to see more areas pick up on the idea.
I was doing some math with Lars and during our session, we came up with the following inequality. Let $a_1,\ldots,a_r\in\mathbb N$ be integer numbers with $a_i\ge k$. Then,
\[ \frac{\sum_{i=1}^r a_i}{\prod_{i=1}^r a_i} = \sum_{i=1}^r \frac{1}{\prod_{j\ne i} a_j} \le \frac{r}{k^{r-1}}= \frac{rk}{k^r} \]
The inequality is completely obvious, but I found it useful and didn't want to forget about it.
# Why TaskWarrior?
After I've heard of the software <a title="TaskWarrior Homepage" href="http://http://taskwarrior.org/" target="_blank" rel="noopener">TaskWarrior</a> in summer of 2012, I started using it instantly. My main reasons are:
* Since I'm a big fan of self quantification, I wanted the data to be accessible and independent of the existence of any software company. The TaskWarrior stores its data in <em>text</em>, which is imho the most future proof format.
* Everything from the system described in David Alan's book "<a title="Get the book from amazon" href="http://www.amazon.com/Getting-Things-Done-Stress-Free-Productivity/dp/0142000280" target="_blank" rel="noopener">Getting things done</a>" (short GTD) can be implemented with TaskWarrior.
* It is cool and geeky to use (via command line!). This has a real advantage too: you have the full power of your shell at hand and the programm itself also has powerfull batch processing capabilities.
---
<a href="https://blag.nullteilerfrei.de/2012/12/31/taskwarrior/#more-1199" class="more-link">Do you want to know more?</a>
On the second day of <a href="https://events.ccc.de/congress/2012/wiki/Main_Page">29c3</a>, we talked about the group law on an elliptic curve based on our old script (in German) called "<a href="http://blag.nullteilerfrei.de/2012/12/28/29c3/ectalk/" rel="attachment wp-att-1169">Das Gruppengesetz auf Elliptischen Kurven</a>". Today, we explained to some people <a href="http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization">how elliptic curves can be used to factorize</a> the product of two primes, i.e. attack weak RSA keys. When we were done, we let the flipchart paper taped to the wall and sat down. Few minutes passed before two people in passing showed an unusual interest in our notes. A few words into the conversation, I bluntly asked them about their mathematical background, which was met with an amused
> I'm a math professor, does that suffice?
These people turned out to be <a href="http://www.hyperelliptic.org/tanja/">Tanja Lange</a> and <a href="http://cr.yp.to/djb.html">Daniel Bernstein</a>, two scientists who are rather big shots in mathematical cryptography. I am ashamed to say that I did not even know that, but I certainly understood that they knew a <b>lot</b> more about elliptic curves than me and they were willing to share. To be precise, they were really friendly, and good at explaining it. That's rare. Of course, I eagerly listened as they began elaborating on the advantages of <a href="http://en.wikipedia.org/wiki/Edwards_curve">Edwards coordinates on elliptic curves</a>. The two of them had attended the talk by Edwards introducing the concept in 2007 and observed the cryptographic potential:
Basically (and leaving out some details), it's all about the fact that
\[ x^2+y^2 = 1+dx^2y^2 \]
defines an elliptic curve, with all relevant points visible in the affine plane; <a href="http://www.wolframalpha.com/share/clip?f=d41d8cd98f00b204e9800998ecf8427et3m89ilv26">check out the picture</a>. Choosing $(0,1)$ as your neutral element, a group law on this curve is given by
\[ (x_1,y_1) \oplus (x_2,y_2) := \left( \frac{x_1y_2+x_2y_1}{1+dx_1x_2y_1y_2}, \frac{y_1y_2+x_1x_2}{1+dx_1x_2y_1y_2}\right). \]
With this shape, you never have to mention projective coordinates, the group law can be explained in a very elementary kind of way — and then it turns out that this shape also yields faster algorithms for point multiplication. In short: If you're into curves, cryptography or both, I <b>thoroughly</b> encourage you to check out <a href="http://www.hyperelliptic.org/tanja/newelliptic/newelliptic.html">their summary page about Edwards coordinates</a>.
We have arrived at the <a href="https://events.ccc.de/congress/2012/wiki/Main_Page">29C3</a> and <a href="https://events.ccc.de/congress/2012/wiki/Integral_domain">set up shop</a>. We will talk a bit about elliptic curves and stuff, but whenever you find us hanging out in <b>1C</b>, you can stick around and talk to us about anything.
It seems that you can't ((<a href="http://superuser.com/questions/396846/force-windows-8-metro-apps-to-run-lower-resolutions-below-1024x768" target="_blank">Force Windows 8 Metro Apps to run lower resolutions below 1024x768</a>)) ((<a href="http://www.clickonf5.org/14830/windows-8-metro-style-apps-running-on-low-screen-resolution-netbooks/" target="_blank">Windows 8 Metro style apps running on low screen resolution netbooks</a>)) ((<a href="http://liliputing.com/2011/09/how-to-enable-windows-8-metro-style-apps-on-an-older-netbook.html" target="_blank">How to enable Windows 8 Metro style apps on an older netbook</a>)) ((<a href='http://www.google.de/search?q="this+app+cannot+open"+"windows+8"' target="_blank">Google-Suche</a>)). If you are ok with a squeezed look, set all registry values of `Display1_DownScalingSupported` to <b>1</b> and change the screen resolution to at least 1024x768.
I was asked today if one could make LaTeX skip all occurances of the value <b>13</b>, in all counters, as <a href="http://en.wikipedia.org/wiki/Thirteenth_floor">some buildings do</a>. Well, of course you can:
```latex
\let\stepc\stepcounter\renewcommand{\stepcounter}[1]{%
\ifthenelse{\equal{\value{#1}}{12}}{\stepc{#1}}{}\stepc{#1}}
```
Here, we first save the `\stepcounter` macro in `\stepc`, then we renew its definition by stepping the counter twice if its current value equals 12, therefore effectively omitting the 13th occurance. Also, you should watch <a href="http://www.imdb.com/title/tt0139809/?ref_=fn_al_tt_1">the thirteenth floor</a>, it's a nice movie if you're into scifi.