Imaginary Numbers

Minipuzzle #1

Hey Randy, we’ve got another message! Looks like we’ll have to use our Pontifex again.

• The first card is a multiple of [see puzzle for image]
• The second card is not even
• The last card is the strongest suit in bridge
• Joker A comes immediately before a power of [see puzzle for image]
• Joker A does not neighbor a face card or an ace
• Joker A comes sometime after the [see puzzle for image] of diamonds
• Joker B comes immediately after a prime
• Joker B does not neighbor a Fibonacci number
• Joker B comes sometime before the [see puzzle for image] of hearts

WBCD

-Si Stebbins

Minipuzzle #2

My dear Watson, I've found a note with some strange number combinations. But fear not, this time it seems we won't be using the almanac. What was it you initially proposed in the valley? That one should work, so long as we use the most popular version!

• [see puzzle for image]   25:24   10
• 4   [see puzzle for image]:14   2
• 5   31:[see puzzle for image]   13
• 6   22:11   [see puzzle for image]
• 7   14:[see puzzle for image]   22
• 9   3:[see puzzle for image]   11
• 10   [see puzzle for image]:27   11
• 13   29:11   [see puzzle for image]
• 17   8:13   [see puzzle for image]
• 19   81:9   [see puzzle for image]
• 19   98:[see puzzle for image]   26
• 20   5:[see puzzle for image]   11
• 23   [see puzzle for image]:12   15
• [see puzzle for image]   3:6   7
• 27   [see puzzle for image]:10   7
• [see puzzle for image]   19:7   13
• 42   12:2   [see puzzle for image]
• [see puzzle for image]   12:38   30
• 46   [see puzzle for image]:54   34
• [see puzzle for image]   15:2   20

Minipuzzle #3

Bean - see if you can decode this one! There’s only one row this time, and I’ve included some instructions below. - Petra

Here’s a CSV version of the image, and here’s a downloadable version of the image.

1. Checksum: The number of 0s and 1s, respectively, in the ciphertext are [see puzzle for image] and [see puzzle for image].
2. Flip each bit whose index (zero-indexed) is congruent to zero modulo [see puzzle for image], [see puzzle for image], [see puzzle for image], or [see puzzle for image].
3. Checksum: The number of nibbles that don’t represent one of Dragon Army’s toons (in hexadecimal) is [see puzzle for image].
4. Figure out a circular bit shift to apply to the entire string.
5. Figure out a circular bit shift that you can apply to every byte (the same shift for each byte).
6. Checksum: YOU SHOULD GET A [see puzzle for image] CHARACTER (INCLUDING SPACES) CLUEPHRASE, STARTING WITH <Start of Text> (0x02) AND ENDING WITH <End of Text> (0x03).

Minipuzzle #4

Oh no Gregor, gnawers are sending coded messages again! Something seems different this time though…

“
[see puzzle for image], 1, 26
[see puzzle for image], 9, 5
[see puzzle for image], 6, 6, 19

[see puzzle for image], 5
[see puzzle for image], 23, 5, 18
[see puzzle for image], 14

[see puzzle for image], 15, 22, 18
[see puzzle for image], 1, 23, 15, 18
”

-
[see puzzle for image], 7, 7, 10, 5
[see puzzle for image], 18, 10, 14, 12, 5, 21

_ > _ > _ < _ < _ > _ > _

That which is caught