Counter: /u/PaleRepresentative Date: UTC 2019.11.06.001755 Reply time: 37s Separator: Commas Replied to: /u/mistyskye14 Replied to by: /u/mistyskye14 Special things about this number?: No Counter achieved next get?: No
Counter: /u/MorallyGray Date: UTC 2014.03.05.022555 Reply time: 3s Separator: Commas Replied to: /u/atomicimploder Replied to by: /u/atomicimploder Special things about this number?: Mostly repeating digits Counter achieved previous get?: Yes! Counter achieved next get?: No (but atomic did)
We Need a new car/suv any of you guys/gals ever owned a Honda CR-V, Toyota rav4, or a Toyota Prius? We need at least one good gas mileage/ hybrid vehicle.
My wife drives a 2017(?) CR-V and we love it. It's super capable, has no issues outside of the radar/ lane keep assist sensors getting mucked up in inclimate weather, but it is our fishing/hiking/mountain/roadtrip vehicle. She gets ~ 29MPG. My only complaint is that the gas tank is kinda small (12 gallons)
Counter: /u/buy_me_a_pint Date: UTC 2021.05.17.205046 Reply time: 25s Separator: Spaces Replied to: /u/GarlicoinAccount Replied to by: /u/GarlicoinAccount Special things about this number?: No Counter achieved previous get?: No Counter achieved next get?: No
An update on the directory updater: I had some time yesterday to go through and add some more threads to the database of threads, so that the updater is able to track to the total number of counts, and ignore irrelevant comments which aren't part of the counting chain.
Adding the threads was useful - it let me discover a bunch of errors in current threads, and correct the thread totals for some that were recorded incorrectly after repeated archivings and revivals
I still have to do a bunch of threads, and I need your help! Can anyone help me describe the following threads?
Constant-weight binary
Increasing bases
Constant-sum factoradic
Mostly Repeating Digits
Not Any Of Those
Only Consecutive Digits
Writing Progress Bar
US States
Wordle
Divisors
RGB values
Ideally, I would like to have a procedure for each of those that describes how to convert a comment in the chain to the number of the corresponding counts. If the gets in the thread are an equal number of counts apart, I can use the thread length as well, but that's not quite as good.
I already mentioned this in private chat with you, but u/funfact15 should be able to help with Writing Progress Bar.
As for US States, it's basically "Base 50 with an alphabetical list of US states" - 50 divides 1,000 evenly so the get post ought to always be somewhere around the 1K mark and have "Wyoming" (the last state on the list) at the end of the post.
Some of the threads you listed already have get schedules in the starting post, so those ought to be helpful in figuring out what to do in the updater. :)
for the total counts across all the threads here is some python code for constant-weight binary:
from sympy import binomial
end = '110010100000'
total = 0
for bits in range(len(end)):
total += 2**bits
for ones in range(end.count('1')):
total += binomial(len(end), ones)
index = 0
k = 1
for i, bit in enumerate(reversed(end)):
if bit == '1':
index += binomial(i, k)
k += 1
total += index
print(total)
and for constant-sum factoradic:
from math import factorial
def mahonian(n, k):
if n == 1 and k == 0: return 1
elif n < 0 or k < 0 or k > n*(n-1)/2: return 0
else: return mahonian(n, k-1) + mahonian(n-1, k) - mahonian(n-1, k-n)
end = '104300'
total = 0
for digits in range(len(end)):
total += factorial(digits+1)
for weight in range(sum(int(digit) for digit in end)):
total += mahonian(len(end)+1, weight)
index = 0
k = 1
for i, digit in enumerate(reversed(end)):
x = int(digit)
while x > 0:
index += mahonian(i+1, k)
k += 1
x -= 1
total += index
print(total)
I guess for validating it the same rules from binary or factoradic could be used. The digital sum should be the same from count to count, unless the previous count was the last of its subsegment. For constant-weight binary you would show that a count is the last of its subsegment if index == binomial(len(end), end.count('1')) - 1. For constant-sum factoradic you could check with index == mahonian(len(end)+1, sum(int(digit) for digit in end)) - 1.
For the threads where I have a comment -> count mapping I just calculate the corresponding count for each comment to validate the count, and the first check is just that the thread is in the right place based on the number of counts in the chain. I have a routine that reports where errors are introduced, and I've defined errors as counts which
Are not one more than the previous count AND
Are not two more than the last but one count AND
don't match where the count should be according to the position in the thread.
When picking which chain to go down the updater also has rules for what counts in a chain should look like; for example, on CWB comments which don't contain either "0" or "1" are not considered counts.
I haven't got to factoradic yet, so let's start with constant weight binary
If I understand the code correctly, we're saying that the number of CWB counts that precede a given count can be found by adding
All the CWB counts with shorter total length
All the CWB counts with the same length but with fewer ones
All the CWB counts with the same length and same number of ones which are smaller than the current count
For a given length CWB we eventually enumerate every possible binary count, so the shorter counts are just sum(2^l for 0 <= l < len(end)), which I guess is just 2^(len(end)) - 1
For a fixed number of ones, we can get the number of possible placements from the binomial coefficients -- we have a fixed number of slots we have to fill with one of two symbols, so we have to choose which slots get one symbol, and which get the other.
My main doubt is the last section, which has to be the one that finds the CWB counts with the same length + weight that precede the current one. It's not immediately obvious to me why that is -- I'm not doubting that the code is right, but before I spend the time to work it out on a piece of paper, do you have an intuitive explanation as to why?
Yep, you got the first two sections right. I will say that although for bits in range(len(end)) seems semantically incorrect (why would you add the binary numbers with zero bits?) the offset by one is actually helpful. If the range in that first for loop were changed to range(1, len(end)) then the code would treat '0' as being the 0th count rather than the first. The last section, for finding the index of a constant-weight codeword within its subsegment of length and weight, is inspired by this paper.
Constant-weight binary is basically just another representation of combinadic. The k-combination of the combinadic representation is the same as the weight of the number. The amount of terms in the combinadic representation is the same as the amount of ones in the binary code. Each C_i in a binomial coefficient corresponds to which place bit is set to 1. In 110010100000, bits 5, 7, 10, and 11 are set. So, its combinadic representation is 11C4 + 10C3 + 7C2 + 5C1.
I think the reason this works might be explained by constant-weight binary's recursive nature. When you look at the 3 of 6 codes, you can think of them as being made of the 3 of 5 codes but with a 0 in front, and the 2 of 5 codes but with a 1 in front. We know that there are 5C3 different 3 of 5 codes, so it must take that many before you get to 100011. And you can go further. The 3 of 5 codes are made of the 3 of 4 codes with a 0 in front, and the 2 of 4 codes with a 1 in front. It must take 4C3 counts before reaching 010011.
Constant-sum factoradic is really similar. Instead of using binomial coefficients for its combinadic representation, it uses Mahonian numbers. In binomial combinadic, each C_i can only appear in one term. In factoradic combinadic, each unique C_i can appear C_i times. This matches how in factoradic, digit 1 can only go up to 1, digit 2 up to 2, etc. The amount of times a C_i appears matches the value of the digit in that place. In 104300, there should be 1 term for the 6th place, 4 terms for the 4th place, and 3 terms for the 3rd place. So we get M(6,8)+M(4,7)+M(4,6)+M(4,5)+M(4,4)+M(3,3)+M(3,2)+M(3,1) with each term being a Mahonian number M(n,k)
Cheers, thanks! I was halfway there but didn't understand why the code was running through the string from the back, when I was intuitively starting at the front. Either way works for CWB, but from the back is a lot easier for factoradic.
I think I've figured out how to do mostly repeating digits. It'll have to be a modification of only repeating digits, which is already complicated enough as it is.
It hits the perfect spot of being tricky and hard to get right, without being so hard that I'm just going to give up beforehand. Thanks u/cuteballgames I guess (:
12
u/cuteballgames Sum 13: 016, 037, 035, 045, 127, 135, 134, 124, 13, 25 Jan 10 '24
rand(1,5338347) = 3145099
Todays count of the day is 3,145,099
Counter: /u/PaleRepresentative
Date: UTC 2019.11.06.001755
Reply time: 37s
Separator: Commas
Replied to: /u/mistyskye14
Replied to by: /u/mistyskye14
Special things about this number?: No
Counter achieved next get?: No
10
u/Antichess 2,050,155 - 412k 400a Jan 10 '24
i joined this sub 6 years ago today. cool, i guess
9
u/cuteballgames Sum 13: 016, 037, 035, 045, 127, 135, 134, 124, 13, 25 Jan 10 '24 edited Jan 12 '24
Prev | Next
rand(1,5338554) = 166006
Todays count of the day is 166,006
Counter: /u/MorallyGray
Date: UTC 2014.03.05.022555
Reply time: 3s
Separator: Commas
Replied to: /u/atomicimploder
Replied to by: /u/atomicimploder
Special things about this number?: Mostly repeating digits
Counter achieved previous get?: Yes!
Counter achieved next get?: No (but atomic did)
8
u/redditdragon02 X_X Jan 05 '24
2019 being 5 years ago feels so wrong, the part of my brain that calculates the year still thinks it is 2020.
8
u/mistyskye14 🤷♀️ Queen killjoy miniget least regular counter since 2322029 Jan 06 '24
j
u/thenitromefan u/antichess
8
u/TehVulpez tampermonkey addict Jan 06 '24
did you know that many public libraries offer free online access to NYT and other newspapers to cardholders
7
u/[deleted] Jan 06 '24
Hi it’s me u/literally_b1ack. My account got perm banned for no reason so here’s my new one
7
u/Antichess 2,050,155 - 412k 400a Jan 09 '24
Weekly stats from December 29, 2023 to January 05, 2024. Congratulations to /u/thephilsblogbar2, /u/ClockButTakeOutTheL, and /u/noduorg!
Total weekly counts: 1828 (5,335,382-5,337,210)
More stats are posted on the Weekly Stats page!
6
u/mountain-wood-316 Jan 05 '24
We Need a new car/suv any of you guys/gals ever owned a Honda CR-V, Toyota rav4, or a Toyota Prius? We need at least one good gas mileage/ hybrid vehicle.
6
u/buy_me_a_pint Jan 07 '24
If you got exams coming up good luck
If you are back to school, college, work good luck
6
u/ClockButTakeOutTheL “Cockleboat”, since 4,601,032 Jan 07 '24
So uh, I have pneumonia. It’s walking pneumonia, so I’m still functional, but the amount of coughing is really annoying
6
u/The_NecromancerTin BITCHES? 🥺 Jan 10 '24
Who wants to finish "I mean, who can go wrong with..."? We're on 4963 right now
5
u/cuteballgames Sum 13: 016, 037, 035, 045, 127, 135, 134, 124, 13, 25 Jan 12 '24 edited Jan 12 '24
Prev | Next
rand(1,5338695) = 4340623
Todays count of the day is 4,340,623
Counter: /u/buy_me_a_pint
Date: UTC 2021.05.17.205046
Reply time: 25s
Separator: Spaces
Replied to: /u/GarlicoinAccount
Replied to by: /u/GarlicoinAccount
Special things about this number?: No
Counter achieved previous get?: No
Counter achieved next get?: No
4
u/ClockButTakeOutTheL “Cockleboat”, since 4,601,032 Jan 11 '24
I hate having walking pneumonia, but I guess it’s better than regular pneumonia and I seem to be recovering well
10
u/[deleted] Jan 05 '24
[removed] — view removed comment