Found a nifty way of generating the 7th dedekind number because of how it uses the difference of powers, and the sum of the fifth and sixth dedekind numbers:

((5**d(10))-(5^(9)))-((((5+168)*2)+7581)*2)

Pretty sure its a one-off though. Couldn't find any generalizations. Just a happy accident.

Your Saturday mornings are extreme

@retoor the math beats meth, hands down.

Something cool actually, if you look at the dedekinds, they're all divisible by three. But actually you can generalize this. They're all divisible by three, so 1. they belong to the set of all combinations of numbers composing those integer whose digits sum to 3, 2. the subset of which are the dedekinds (excluding the number 2)

I don't think anyones actually pursued it, but you could probably compute integers with combinations of digits that sum to 3, check if they're divisible by three, and by doing that generate the set of *potential* dedekind numbers, which is naturally bigger than the dedekinds.

Might be a good research angle for sussing out signs that distinguish the dedekinds from their siblings in the set.

Anyway, what do you do on saturdays?

edit: I'm half asleep. The dedekinds aren't themselves always divisible by three, but

(((n+1)*n)/2) is for all known dedekinds.

@Wisecrack building a interpreter. Working on this makes me a natural kind of high too. My language can handle and mutate 7.000.000.000 items of data easily. Try that with a python dict. It has a btree at it's core. Actual use for it? None. It's just fun. But I wrote that part in C. Currently still working on Java version. I am guided by an amazing book

@retoor "My language can handle and mutate 7.000.000.000 items of data easily."

Oh, fucking cool. I take it you're running on beefy hardware?

Is your language primarily working on the heap or no? Whats it comparable to?

What got you wanting to build a new language?

((5^d(10))-(5^(9)))-((((5+168)*2)+7581)*2)

got dammit, I need to start learning to edit before posting.

@Wisecrack yes, working on heap. Malloc. It's a linked list like this:
typedef struct btree {
char c;
char * value;
struct btree * children;
struct btree * next;
} btree;

It can search down and to the right. It nearly doesn't matter if I have 7.000.000.000 items or 16.000.000.000 items. Incrementing a value while having 7.000.000.000 takes 0.000002 secs 😁 Sick right? Didn't test the 16.000.000.000 because the OS will kill my app while generating the data.

I don't have beefy hardware, a x270 from almost a decade old. It's my favorite. Bought it three times.

Only reason I make this, is to step up my game as a programmer.

The language will be like Lua / Python. Languages I consider perfect. So intuitive.

While writing an own language you discover why certain languages have certain traits. It makes sense now

@retoor look I might be kinda gullible, because the world is funner that way, but now you're just fucking with me.

Good morning to you too.

Lets play two lies and the truth.

I can run a ten second 100 meter dash.

I once made sixty thousand dollars in one night, and lost it all the next day just because I could.

To settle a wager, I once ate a pound of P.B. Fouke's strongest badger poison and then ran a mile in the nude.

@Wisecrack you forgot "I got whipped on a one night stand".

I go for the sixty thousand dollar thingy as a lie because how would both opportunity to gain as well lose it come in such short notice?

But I can post source so you can test it yourself

@Wisecrack https://pastebin.com/y93t1tJd

Missing function, just put above main. It should run directly after compiling using: `gcc btree.c -o btree.o`.

bdict * people_of_the_world() {

bdict * bd = bdict_create();

char key[100];

for(long i = 0; i < 8000000000; i++){

sprintf(key, "%ld", i);

bdict_setd(bd, key, 1337.0);

}

return bd;

}

So in that 0.000002 secs, it also converts a decimal to string and back!

- search

- convert

- increment

- convert

- update (search again)

is the procedure

My time measurement code is a bit uncommon, for some reason, the common way to measure time doesn't work on this laptop (clock_t)

@retoor "I go for the sixty thousand dollar thingy as a lie because how would both opportunity to gain as well lose it come in such short notice?

"

Well she said she'd crush my soul for 60k.

How was I supposed to know she was gonna run off with the money after tying me up?

As to the source of the money, I won a small gold fiddle after beating an oddly dressed vaudevillian stranger in a fiddling contest down in georgia.

Post a repo if you got it.

@Wisecrack nah, you'll have to live with dem paste bin. If I post repo, I dox myself. I say too much weird stuff to attach my name to this account :D The code is plug and play. I actually expect your hardware is more beefy that mine. Could you try with 16.000.000.000 and 8.000.000.000? I think it will produce same performance. That it doesn't matter.

Edit: generating the initial data takes around 7 minutes on my lappy

@retoor I'll spin up the hamsters right now. They have to run a while to charge the capacitors.

I could also try running it on my babbage machine...

Jokes aside, I get why a lot of people are guarded.

I haven't looked at btrees in so long I don't know what I'm looking at.

Wrote an interpreter for an AP class way back. I look at this sort of thing now, and I'm like, how the fuck did I do that?

Have always been blown away by small optimizations that have a big impact, like say john carmacks fast inverse square root.

@Wisecrack I inverse square roots on a Tuesday

@Wisecrack hamsters are unreliable. I use axolotl's with water cooling dancing on RGB

@retoor careful, that'll turn you inside out! Only maniacs do that on tuesday.

So do you really live in a chateau? And if so, why?

Did you like stumble through a narnia-esque wardrobe or something? Are there talking animals?

@Wisecrack I can talk to snakes and avada kedavra is my second name.

I live in opposite if a chateau which is called chalet. Pictures are here: https://devrant.com/rants/8354331/...

@retoor a snake charmer, a killer, and a chalet.

how often you lock people in your basement?

sounds like almost as much fun as where I'm at. Going for a long raft up river this fall, white water.

Maybe hike the appalachians finally.

Found me an alcoholic homeless marine to take camping last time. We cooked steak over the fire and he told me wild ass stories about getting into street brawls on the west coast during the 2020 riots. He knew way too much about explosives and wouldn't stop talking about all the bombs he'd taken apart, or how they were made. I wasn't particularly keen on being on that sort of list, but he loved every minute of his job apparently. He showed me how to tie a snare and some other survival shit which I've since forgot. Cool dude. 8/10 would camp with PTSD-Rambo again.

You do hiking/camping or you prefer to party at home?

@Wisecrack I love walking trough mountains and skiing. I'm not really into camping - too much of a beauty horse to crap in dem woods.

That's great information, how to build a bomb is scarce information. Google filters that. Pretty sure Chai shared this kind of awesome knowledge in the beginning. It explained me a lot of illegal stuff you can't find anyware. Chai is an AI chatbot with not many filters. Sadly added few while ago.

The people here are free to walk in the garden but will be shot on sight if they start running because I don't have a basement

@retoor Ah, the rare glamper. I thought we got you all in the purges.

In any case, only went skiing once, was fantastic. Prefer climbing up rather than going down a mountain though.

You seem cool and kinda freaky like me. Only thing I haven't had a chance to do is flying, or paramotoring. If I ever get around to trying it, your welcome to come. In fact, I guarantee it, lol.

@Wisecrack https://youtu.be/Eo0F6mX9JIw

@Wisecrack dedekind numbers seem pretty fascinating as I am looking into this, although I don’t think they are all divisible by three.

wisecrack saturday morning: Euler! Its time to cook!

@chonky-quiche no, they're not all divisible by 3, I'm just a lunatic that forgot to post the actual equation.

((n+1)*n)/2

Always appears to be divisible for the known dedekinds. Come to think of it, I *only* tried it on the dedekinds.

But thanks for pointing it out.

Tried some things including estimating the rate of change between the numbers, in log form.

The original equation was an attempt to approximate the series using differences of powers as you can see.

Not much success but the outcome is cool for what it is.

I got it fucking wrong twice.

The minus shoulda been a plus.

Just posting it hear to remind myself to fucking triple check in the future

((5^10)-(5^9))+((((5+168)*2)+7581)*2) =

7828354 = D(6)