Sequencer | StrangerCoug's turn

[Micc]

/in for round 2!

[Plotinus]

That's probably as many players as we're going to get for this round, and it's enough for us to have teams.

In [41]: import random
In [42]: players = ['Yimmy', 'StrangerCoug', 'Notajumbleofnumbers', 'micc']
In [43]: random.shuffle(players)
In [44]: players
Out[44]: ['Notajumbleofnumbers', 'StrangerCoug', 'micc', 'Yimmy']

Notajumbleofnumbers and Micc will be on team

Analysis

and StrangerCoug and Yimmy will be on team

Algebra

. You can change your team names / colours if you find something you both like. Points will be shared between team members. It will be Notajumbleofnumbers' turn in a minute, after I shuffle the deck. We're using StrangerCoug's deck this turn. Since flaking affects your teammates, people who don't respond to prods will be replaced instead of skipped. I think that's all the things that are different from last game.

[NotAJumbleOfNumbers]

Play 676, 16, 76 as numbers that end in 6.

[Jackal711]

/in for replacement if needed or next game

[Plotinus]

Analysis (NotAJumbleofNumbers, Micc) has:

• [16, 76, 676] {
  n ≡ 6 (mod 10)
  } numbers that end in 6

Algebra (StrangerCoug, Yimmy) has:

It is

StrangerCoug's

turn

[Plotinus]

Glad to have you, Jackal!

Also, for the newer players, the reason you draw cards at the end of your turn is so that you don't have to wait to go if I'm asleep or something. You can also submit your turn early by PM if you're anticipating being away, or submit several possible turns like "add a, b, c to sequence x if it hasn't been completed yet otherwise add f, g, and h to sequence y if possible otherwise make a new sequence d, g, b"

[StrangerCoug]

1, 3, 5: single-digit numbers

Oh, and

mod: None of Team Analysis's numbers are divisible by 7.

[Micc]

20, 35, 79 as numbers where the sum of the digits is a power of 2.

[Plotinus]

1, 3, 5: single-digit numbers

Oh, and

mod: None of Team Analysis's numbers are divisible by 7.

Fixed. I was lazy and quoted the first post of game 1 for the formatting and then failed to edit McMenno's opening sequence thoroughly enough.

Analysis (NotAJumbleofNumbers, Micc) has:

• [16, 76, 676] {
  n ≡ 6 (mod 10)
  } numbers that end in 6
  
• [20, 35, 79] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = 2^k | a_i ≥ 0, d > 0, k ∈ ℤ
  } sum of the digits is a power of 2 }

Algebra (StrangerCoug, Yimmy) has:

• [1, 3, 5] {
  n < 10
  } single digit numbers

It is

Yimmy's

turn

[NotAJumbleOfNumbers]

I think you just made this game to show off your math skills

[Micc]

Am I right to assume private communication isn't allowed for this? Would make for a very different game.

[Plotinus]

No private communication, though I think it'd be interesting to try out a version that had private communication, maybe next game? I won't punish people if it happened before right now because you didn't know.

For now, you can try to strategise with your partner in the public thread, like in Canasta.


I made the game to practice/play with math anyway but I was thinking between the games about whether I should keep trying to put the closed forms in -- it's a way to make the rule clear and doing it has cleared up some misunderstandings of the verbal form in the game 1, but I can only do it for sequences where I, personally, have enough math to produce a closed form, and I think part of DeathRowKitty's strategy last game was trying to make sequences that it was easy [for her, anyway] to check whether a number was in the sequence but hard for somebody who didn't know the closed form, like her φ(φ(n)) thing last time.

I wouldn't want to rule that players have to provide closed forms themselves, it'd exclude everybody who doesn't know how to write one and every sequence that can only be easily described in words. What do you think?

[Micc]

I won't be able to make anything but the simplest closed forms myself and having the closed form isn't particularly useful to me, but I do like having it just for the sake of learning about stuff.

[StrangerCoug]

I won't be able to make anything but the simplest closed forms myself and having the closed form isn't particularly useful to me, but I do like having it just for the sake of learning about stuff.

Ditto.

[NotAJumbleOfNumbers]

I won't be able to make anything but the simplest closed forms myself and having the closed form isn't particularly useful to me, but I do like having it just for the sake of learning about stuff.

Ditto.

Same here.

[Plotinus]

Yimmy has been prodded and has (expired on 2019-12-12 08:00:00) to post before I ask Jackal11 if he's still interested in replacing. [A bit of extra time because I want to go to bed on time tomorrow even if I didn't tonight]

The prod schedule I used for last game was prod 24 hours after the last player took their turn, then skip after another 24 hours. Since we're doing replacements instead of skipping, is this still a good schedule? would prod at 48, replace after another 24 be better? I was thinking of doing that schedule for V/LAs, but I could do something more generous for V/LAs if we did 48/24 for nomal prods.

I would rather not replace anyone who is excited about the game just because they had a busy couple days.

[Yimmy]

Numbers that are divisible by their first digit: 39, 2, 55
I appreciate the closed forms and I don't think they take anything away.

[Plotinus]

Analysis (NotAJumbleofNumbers, Micc) has:

• [16, 76, 676] {
  n ≡ 6 (mod 10)
  } numbers that end in 6
  
• [20, 35, 79] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = 2^k | a_i ≥ 0, d > 0, k ∈ ℤ
  } sum of the digits is a power of 2 }

Algebra (StrangerCoug, Yimmy) has:

• [1, 3, 5] {
  n < 10
  } single digit numbers
  
• [2, 39, 55] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a₀ | n, a_i ≥ 0, d > 0
  } numbers that are divisible by their first digit

It is

NotAJumbleofNumbers's

turn

[NotAJumbleOfNumbers]

Play 1, 10, 5, 4, 3 to steal [2, 39, 55].

[Plotinus]

Spoiler: Completed sequences

• [1, 2, 3, 4, 5, 10, 39, 55] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a₀ | n, a_i ≥ 0, d > 0
  } numbers that are divisible by their first digit

Analysis (NotAJumbleofNumbers, Micc) has 8 points:

• [16, 76, 676] {
  n ≡ 6 (mod 10)
  } numbers that end in 6
  
• [20, 35, 79] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = 2^k | a_i ≥ 0, d > 0, k ∈ ℤ
  } sum of the digits is a power of 2 }

Algebra (StrangerCoug, Yimmy) has:

• [1, 3, 5] {
  n < 10
  } single digit numbers

It is

StrangerCougs

turn

[StrangerCoug]

20, 16, 200: Composite numbers whose digit sum is prime

[Plotinus]

Spoiler: Completed sequences

• [1, 2, 3, 4, 5, 10, 39, 55] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a₀ | n; a_i ≥ 0; d > 0
  } numbers that are divisible by their first digit

Analysis (NotAJumbleofNumbers, Micc) has 8 points:

• [16, 76, 676] {
  n ≡ 6 (mod 10)
  } numbers that end in 6
  
• [20, 35, 79] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = 2^k; a_i ≥ 0; d > 0; k ∈ ℤ
  } sum of the digits is a power of 2 }

Algebra (StrangerCoug, Yimmy) has:

• [1, 3, 5] {
  n < 10
  } single digit numbers
  
• [16, 20, 200] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i is prime; φ(n) < n - 1; a_i ≥ 0, d > 0; k ∈ ℤ
  } composite numbers whose digit sum is prime }

It is

Micc's

turn

[Micc]

Plot, you copied the numbers from my sequence into SC's sequence instead of using his.

I'll play 15, 32 and 66 as numbers that can be written as the sum or difference of two powers of 2.
15 = 2⁴-2⁰, 32 = 2⁴+2⁴, and 66 = 2⁶+2¹

[Plotinus]

Spoiler: Completed sequences

• [1, 2, 3, 4, 5, 10, 39, 55] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a₀ | n; a_i ≥ 0; d > 0
  } numbers that are divisible by their first digit

Analysis (NotAJumbleofNumbers, Micc) has 8 points:

• [16, 76, 676] {
  n ≡ 6 (mod 10)
  } numbers that end in 6
  
• [20, 35, 79] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = 2^k; a_i ≥ 0; d > 0; k ∈ ℤ
  } sum of the digits is a power of 2 }
  
• [15, 32, 66] {
  n = 2ⁱ ± 2^j
  } numbers that can be written as the sum or difference of two powers of two

Algebra (StrangerCoug, Yimmy) has:

• [1, 3, 5] {
  n < 10
  } single digit numbers
  
• [16, 20, 200] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i is prime; φ(n) < n - 1; a_i ≥ 0, d > 0; k ∈ ℤ
  } composite numbers whose digit sum is prime }

It is

Yimmy's

turn

whoops, thanks for catching that for me, Micc.

[Plotinus]

Yimmy has been prodded and has (expired on 2019-12-14 05:01:16) to go before I start looking for a replacement.