- Welcome to the Harvard Summer School Math S 21a course! The course website is here: t.co/gB4lCLGu5Z First class is on Tuesday morning bright and early at 8:30 AM in Hall E. See you then in the Red Room. (RedRum, RedRum ... ) t.co/8lUGV82H6X
It is now 3 years that a Pari program computes on the Hardy-Littewood prime race, comparing the number of Gaussian primes on Re(z)=0 and Re(z)=1. See t.co/2RRzJPXnkx We have now gone up to 5*10^12, while in the paper t.co/DdS6Le5DvV ,we only went to 1.25*10^11. t.co/SmLDnfpqpP
I have to vent this : I like Starbucks, I also like to pay cash. Yesterday, my 50 dollar bill was refused, in 2 different locations. "Sorry, we can not take this". Do we have to wait until a latte is 20 dollars so that baristas are allowed to accept these bills? t.co/iNWWw2NkgK
- Nice talk of Sabine Hossenfelder (in German). t.co/GoHW3E53Wo Also the book "lost in math" is thought provoking. In the talk, there are many quotes in the talk about ``what is beautiful?", or "what is elegant?" or "what is surprising?" or "what is natural?" in a theory.
Some slides t.co/RSvXByE98f
about Dehn-Sommerville t.co/X80V741bFv.
It is a new approach using Gauss-Bonnet which is the formula
f(G,t)-1 = sum F(S(x),t) for the f-vector of G, where F is the anti derivative of f and the sum is over all unit spheres S(x) of G. t.co/0HsOMwelG2
- Boston Herald has the best photo so far: t.co/2CTaDxpbAF Boston 25 news has some video t.co/lwivDHsiFV My own photos: t.co/chjyurex5p
Pu the baer visits Arlington! So much fun in Boston suburbs. The baer entertains lots of people at the moment. Fireworkers and police arrange for him to go home and stop napping around in trees. t.co/GZ6StsRhKd
Sad news: @RealGrumpyCat is dead. Grumpy Cat lovers behold: if you believe in quantum mechanics, there is an other possibility ... P.S. The beloved cat had a cameo in a math 22 final exam of May 15th
and earlier about discrete PDE's
The average simplex cardinality is a topic, where some combinatorial topology meets arithmetic, statistics and dimension. See t.co/WBdSKtFFBW Also some slides t.co/hqZXv65TQ4. This work was triggered by a result of Betre and Salinger on inductive dimension. t.co/A6ZZDzzTKh
Bernard Fabrot solved the LCS35 crypto puzzle created by Ron Rivest in 1999.t.co/LCeY8oQaQw
t.co/C6xwUCDmc8 Easy in principle to compute 2^(2^t) mod n for a 616 digit number n and t=79685186856218 but it took Fabrot 3 1/2 years. Congrats! t.co/mIYah4X4as