A Use for the Useless
-
I look more than a little like Mr. Zorg, quiaff?
-
-
Outtake from yesterday morning.
-
Tagged by @marbus-maximus, so here I am.
-
Are you a morning or night shower person… A sunset or lightning watching kind of person.. A chocolate or caramel person
(via 2quads1snatchh)
-
Reblog if your best friend is pretty.
sometimes i try to scroll past this but then i feel guilty
She’s one of the best beautiful people you’ll ever meet 👀
(via kiterstock)
-
-
Shown above are a trio of microscale rockets, each about 10 microns in length. These tiny rockets are roughly cylindrical in shape, with a narrower diameter at the front than the back. Like their space-faring brethren, these microrockets are chemically propelled. They draw in fuel from their surroundings, which reacts with the catalysts coating the interior of the microrocket to produce gases. Those gases bubble out the back end of the microrocket, creating thrust capable of propelling the rockets more than 1000 body lengths/second. Researchers have already demonstrated that these tiny rockets can haul cargo along with them. Scientists hope one day to use these self-propelled microrockets to help deliver drugs or isolate cancer cells. (Image credit: J. Li et al., source)
#rocketsurgery
-
Guess who got sued today.
I’m not day drinking your day drinking.
-
Two-hundred-terabyte maths proof is largest ever The Boolean Pythagorean triples problem asks whether it is possible to assign a color to each positive integer in such a way that no Pythagorean triple (a trio of integers a, b and c satisfying the equation a^2 + b^2 = c^2) has a single color.
In a paper posted on arXiv on 3 May, Heule, Kullmann and Marek have now shown that there are many allowable ways to colour the integers up to 7824, but when you reach 7825, it is impossible for every Pythagorean triple to be multicolored. There are more than 10^2300 ways to colour the integers up to 7825, but the researchers took advantage of symmetries and several techniques from number theory to reduce the total number of possibilities that needed to be checked, to just under 1 trillion. It took the team about 2 days running 800 processors in parallel on the University of Texas’s Stampede supercomputer to zip through all the possibilities. The proof was then verified using another computer program.
Another way to state the result is: the set {1,…,7824} can be partitioned into two parts, such that no part contains a Pythagorean triple, while this is impossible for {1,…,7825}.
This feels like we are making progress towards knowing more about Ramsey numbers and the associated counting problem.
Erdos would be happy, we may not have to lose a war against overpowering alien forces.
(via lthmath)
