Jonathan Dickinson

factoradic(73) = 30010, 0010 doesn't appear unless factoradic(1)=10 appears first

for the experiment to hold, 1 has to be a prime

(there would be false positives, but not false negatives?)

i.e. to find primes, you'd need to find the factoradics of previous primes. take the last N-1 digits and ensure that your current prime ends with those digits.

another pattern: the last N-1 digits of each factoradic group appear always as the last digits in the next group

as does 5! (so far as I have taken the experiment)

4! also always ends with either 210 or 010

the entirety of 4! never contains a digit of more than 4 (same with 3 and 2).

there is a pattern there too. gist.github.com/jcdickinson/47883fa3acc8df6070312d235b6f9fa9 (note the repetition of 210 at semi-regular intervals)

so I got thinking about triangular numbering systems, and factoradics came to mind immediately

@student novaspivack.com/science/… - it's not a paper, by any stretch of the imagination, but it is compelling

I'm not sure if you saw the post regarding primes and how they curiously form fractal patterns when distributed in triangular structures?

Anyone keen to go on wild tangents regarding primes?

My twitter handle is up on my exchange profile.

I know full-well it could be nothing.

I can't just give it away like that. That's why I'm looking to find out if anyone is willing to put my name on the paper. I'm cautiously optimistic, I only grokked Tarjan's Strongly Connected Components Algorithm a few months back.

It's based on existing work, which took me weeks to digest :). There's a difference between reading it and writing it.

For descendants-of and ancestors-of?

The same applies to the matrix (albiet skipping over empty cells)

So, adjacency list: each list is essentially a list of nodes that need to be recursed to (while memoizing nodes that you have visited). So a pointer dereference, and then a recurse.

It's also sparse (unlike the matrix)

Depending on the exact configuration, it can be queried both fowards along directions and backwards. It can by cryptographically hashed.

It's high entropy: 4 ints are used for each edge. It consists of two structures, one is length N, the other length E. Each element in each structure has a constant length, no pointers to additional arrays or such: flat. It supports cyclic graphs, with far less recursion than you'd expect with an adjancency matrix or list (it tends to iterate: good for the cache)...

A binary heap for graphs, if you will.

Otherwise it iterates

An adjancency list doesn't have constant element length. An adjacency list recurses once per node, where-as this representation recurses only when it encounters a forward edge, back edge or cross edge.

it's short-hand, syntactic sugar

the multiplication sign is implicit between the 2 and the parenthesis

that's breaking the rules cerberus, brackets (*B*ODMAS) come first

doesn't really matter though, multiplication and division are commutative

according to the mnemonic (BODMAS) division comes first

It might be a pipe blockage, I came in half-way through the conversation and they were trying to figure out what the word to describe the situation is

Sounds like he is going to be living off that for a while :)

Still any ideas regarding that irony, whether or not it is the case

You are talking about Foehn winds? We have that in South Africa as well (Berg Winds)

Leeuwarden

In one of the towns there, apparently. Speaking to someone who lives there right now.

:D

cosmic irony came to my mind, but someone here is convinced there is a more succint term for it

Hi everyone, I have a really quick question. I am looking for the specific word that describes the type of irony currently being experienced in Holland. They walled off the sea and are now having a drought. Any ideas?

anyway off to bed

Honestly not our fault!

Oh we do very deep integration, that dates back to SP2003. Fixing things is possible (and documented, and it's not like we stuff it up, it's SP doing it's random HAL2000 thang), but from a dev perspective it's far easier to roll back and do it again.

@ToddersLegrande in our case it's how easily you can ruin your SP installation. having a snapshot is a lifesaver.

I work for a SP company, and when they tell me to look at something to do with SP I tell them to go to hell. That's saying something.

@GriffinHeart the only thing is that most SP devs use a VM. So you need significantly more.

(and yet, it does that quite poorly compared to other document solutions)

*sharepain

Effectively, but Microsoft never really stipulated it...