Oct 1, 2024
Tangent
Not much of a punchline, more like my favorite factoid about tangent. But I'm out of practice! Give me a minute.
Loading...
seen from United States
seen from China
seen from Sweden
seen from China
seen from Malaysia
seen from United States
seen from Canada
seen from United States
seen from Sweden
seen from Malaysia
seen from United States
seen from United States
seen from United States
seen from United States
seen from China
seen from United States
seen from United States
seen from China
seen from China
seen from China
Tangent
Not much of a punchline, more like my favorite factoid about tangent. But I'm out of practice! Give me a minute.
Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
Mathober 2025
Sophia/Fractalkitty has announced the topics. At least five things I have no idea what they are. Don't know what I'd do for most of them! But as time allows I'll try.
I think most of the terms come from Mathworld, so that's a good place to start.
It's this time of year now so here's my graph of a ghost that kinda looks like Patrick star's head?
https://www.desmos.com/calculator/ffz47c5nuz
Digraph Sink
Doodle for Mathober Day 5: digraph sink. A vertex in a directed graph with no outbound edges.
Monster Group
Such a crazy thing. M, the monster group, is the largest of the 26 sporadic groups. The sporadic groups are all the finite simple groups not members of the four infinite families of finite simple groups. The monster group has all 15 supersingular primes as divisors of its order.
What's supersingular? So glad you asked.
Blame it on Mathober Day 13: sporadic group
Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
Strongly Regular
Mathober Day 4: Strongly
Spent some time trying to understand strongly regular today. Each vertex has the same number of adjacent vertices, each pair of adjacent vertices has the same number of neighbors in common, and every non-adjacent pair have the same number of neighbors in common. And they are characterized by these up to isomorphism. The Paley graph is (13, 6, 2, 3). If a graph is strongly regular, so is its complement, so that's the purple one here, (13, 6, 2, 3). I think.
Polly Hedron Comics
I long thought Frank and Ernest the standard for bad puns. When they did a sequel for one of my favorites, I was thrilled.
So for Mathober Day 3: Polyhedron, I had to give it a go.
Other Options
A bit of doodle doggerel for Mathober Day 7: Skew.
Trying to channel my inner Grant Snider.