Talk:3172: Fifteen Years

Explain xkcd: It's 'cause you're dumb.
Revision as of 03:42, 25 November 2025 by Clayel (talk | contribs)
Jump to: navigation, search

Part of a series:

--Pgn674 (talk) 21:28, 24 November 2025 (UTC)

Category:X Years. 64.201.132.210 22:03, 24 November 2025 (UTC)

"Growing old is a fabulous alternative to death." 85.255.235.101 21:30, 24 November 2025 (UTC)

OH MY GOD THIS IS SO SWEET EEEEEEEEEE. So happy for you Randall! <3 42.book.addictTalk to me! 21:36, 24 November 2025 (UTC)

this made me, too, tear up - Vaedez (talk) 00:22, 25 November 2025 (UTC)

Growing old ... together. 64.201.132.210 21:59, 24 November 2025 (UTC)

The paragraph about the title text could use a reference to the series of comics of the form "Students graduating this year have never...". I'm not sure how to find them. Barmar (talk) 22:11, 24 November 2025 (UTC)

I added a link to what I think is the right category. It might be a little too broad though. 2601:281:C802:9170:0:0:0:4150 01:53, 25 November 2025 (UTC)

Just. The. Cutest. This is an ideal relationship.--Maxcodes (talk) 22:32, 24 November 2025 (UTC)

I love being reminded I’m (pretty dang sure I’m) going to die alone, yaaaaaay 2600:4040:12A0:E200:D1D1:1F63:C1A:31F2 23:05, 24 November 2025 (UTC)

yay they have survived Mathmaster (talk)

As John Lennon once said, “Grow old along with me.” KelOfTheStars! (talk) 00:19, 25 November 2025 (UTC)

This weekend, as well as today, I've been quite sick. This was a much-needed boost. <3 love ya, Randall. <span style="font-family: Times New Roman, serif; font-size: 16px;">--'''''[[User:DollarStoreBa'al|<span style="color:#E3C6BE">DollarStoreBa'al</span>]]<sup>[[User Talk:DollarStoreBa'al|<span style="color:#CC9A8B">Converse</span>]]</sup></span> (talk) 02:28, 25 November 2025 (UTC)

This might be my favorite xkcd comic of all time. 68.2.204.250 03:02, 25 November 2025 (UTC)

Based on the pattern, the next in the series will be "Eighteen Years" 209.52.88.184 03:23, 25 November 2025 (UTC)

Nah, a +5,+3,+5,+3 seems too basic. Maybe 22 would work, since this is maximum k for which the grid graph P_2 X P_k is a subgraph of the n X n knight graph. Definitely didn't just copy from the oeis. ANYWAYS, by the time they get to 46 we'll have solved it by then... --2.50.0.22 03:39, 25 November 2025 (UTC)

Very happy for Randall here, this is very sweet. Clayel (talk) 03:42, 25 November 2025 (UTC)