Ciphers and Puzzles from Competitors

[10degrees-admin]

Correction: the challenge on id0-rsa uses 29 letters

TLW CIPHER Hint Posting 2

WMSP DGPQR FGLR GQ RFC QFGDR MD RFGQ AGNFCP YLB -PCYB- RFC TCPW NSXXJC/AGNFCP EGTCL DMP YLMRFCP!

[10degrees-admin]

Since this week is all about the monoalphabetic substitution
cipher, here are some challenges that double-up on the fun.
I was going to submit them as two postings, but I have to slip
things past Harry whenever I can, so here they all are in one
go. If you don’t see the [CENSORED BY HARRY] or the [DELETED
BY HARRY], then you know that Harry has butchered my post and
[REMOVED BY HARRY].

All of these can be solved with some computering and/or lots
of time. I disavow all responsibility for driving anyone MAD.

8<————————————————————

Today’s episode is brought to you by the number 2 and the letter M.

This is a series of ciphertexts that explore ways of doubling up
on the monoalphabetic substitution cipher. I need to tell you
from the beginning that they can all be cracked. Some of them
may seem impossible, but trust me, they can be done.

I’m sure Harry will butcher my post and steal my ideas. But,
whatever. What-EV-uh! I stole most of them from other people anyway.

For the first cipher, the letters in the odd positions are all
encrypted with one substitution, while the letters in the even
positions are encrypted with a different substitution. To help
you keep track of which substitution to use, I have used upper-case
letters for one and lower-case letters for the other. (Some of you
will recognize this as a periodic polyalphabetic substitution
with period two.)

GiVaKiIoNoKiErMxBoKxMeUjMyPeEkKiErMxBoKxMeUjMyPaRoErVxKhEqGi
VaKiIoUzPnYrEnAxKyLoKjGiVaKiIoPmEtInYuPsGoYxMeUjMyPoDnCyErGp
CkPhQsGiXxMeUjMyPjPaKnLnYsGzIiGiVaKiIoKoUjEpErOaJvLoKjGiVaKi
IoKmJxLzErInDoGiVaKiIoVxLiPkErOoKmUxJePyUhPfPkXiIxLzNoYnJoQj
VoIaOpEiIxLzNoYnJoQjVoVoJoUsAzExLzOxJoCiMnIoUfPpVoVoJoUsAzEx
LzOxJoCiMyPnMyPkVaXxLjInJiMyPmPkGnOeUjKnYaJsGvPiIoDkPjPpMmPk
GnOiIaMjEqPnYxMjLnGjGoKiUgMyEkGiGoKxLjGjMoOnLxMjNoGpRkPtPxSo
OrEkRnEhEkYnJoSxAxLiIoKgDoJsUiGfPhPzJoPnYtEqDaJxKnLnLsXiIoKo
CkPiVnJhGjOgUsGiX

Next, this cipher also employs two different substitutions, but
the choice of which to use has been randomized. To help you keep
track, the upper-case letters are all encrypted with one
substitution, while the lower-case letters are encrypted with
the other substitution. Note: this cipher (with different keys)
has been used in the NCC before.

nPmlHPMemWGdniKSHiMEmnKledWxlnekUEgwkMsFiNuMPmImSkeDjuwOrsmj
UEvsvEtOkUEpPljerHmfHOuHVOskqEWyfssdeGLCSkUGHglvsIEtltfsijCS
yeOUexwmLEkOjexeMNHqEOUWjeQEKVWkLHsdAbReejHuFYqssKxlOjCeReEj
lgstDEmVUsVlxxIPjHGYHPmMusekWtDMOHNyltfkrHmYsPtsVdEwmMlkuWCx
oewfmEWODEwxOssrWmsrROsjmsPoxeFbMECrWosijbsPTikOWjjUSMFsvEtj
UemuEwDkOmPnyWLwStkjjuEmsHrHrOueuwxxSGRwNOkUegwMGHgKwOuEKFsK
ejuwttlGeReEjUSLuWGdMUewOHtnejsHyiqOUeCSOjCEfsCdEGBebWtduimm
lEDsrRjsjUefWmdeGDssKqHHmwClnElOVWMwkFPnUwMMUENsPxddsCYltfDs
gGstHGeklDEjsxsHyOUmsPfuStOHjUELWmDetgSOustEEYEoPOjHLejOUmHP
LUVwkvsKEUHqexEMkOUwGeQeKOUeMeNmEjgsmdlMevoSLfEG

Now, let’s remove the constraint that the substitutions use
either all upper-case or all lower-case letters. In the following
ciphertext, each plaintext letter can be represented by one of
two ciphertext letters, chosen from the set of 52 letters A..Za..z.
Each ciphertext character can only represent one plaintext letter,
however. This is an example of what is called a homophonic
substitution. The key is a 1-to-2 mapping from plaintext
characters A..Z to ciphertext letters A..Za..z. Whenever a
choice is made by the encryptor used for this ciphertext, it
is done randomly. This is not a bad thing. In fact, it is a
good thing, because the same message will be encrypted to a
different ciphertext each time. We say that the encryption is
probabilistic. But don’t worry; the decryption is deterministic,
which means that there is only one plaintext for a given ciphertext.
So with the correct key, the plaintext is found correctly. (Sadly
for you, the key this time is random as well–no keywords.)

As an example of how this cipher works, suppose the plaintext
letters are a,b,c, and the ciphertext letters are U,V,W,X,Y,Z.
Then one possible mapping is

a -> V or X
b -> U or Z
c -> W or Y

With this key, “cab” could be encrypted as “WXU” or “YXZ” or …

Here is the ciphertext. It does not use the same key as the example.

mPgPixEYvrKCjlixPizErBvfFUhgEpeOlTSNcvprDOESvCfPNBBUOvgyGCFH
pTyglBFvrPrFOvHpLLBGvgvHCTrUFOlrZFOEgvrPHvkAEnFCzliZLExPjVCi
DjEiFlFSpipLLprRjCLzpSEvwoCchNBTUjvCiRVpczpgEVUgEEwoCcBGCrUB
GEgzpmFEgBOCBRBDRfiUBTvEjTBgprZEHGErivkFfpIBOEuRZTyGUyvgETon
vgaRTRiZBOvyPgeUmBOEMCgVpcLxpSglvDHGRnzRiBOvlgBSPFBvSzlFfRDr
UFzvEjzFSCrZvBUcECSiBGCBBGEuRZTGpfhUoZOFBOvVzEcavzpHlgvLvzzz
EByvgvpSSprJRiJFPRrTBCccpBEcEnGPrvprDOpDFCeEiPoBzNYTASlnFlPr
TBPQPGrhNccFlFhlBTCiDFOvfplcIjRgSUSRFfRDrUBzEEjzFgCiJEyOErrC
uULEUrHpTTEvrTFgPLcRrJRiBOvMCSVGPNTEJCgfvrHRBOCuRnERiOlzVPoF
GiPiPBEdviyGvrBOvnRZzBUPejgQUrvzTALUFOvzUNFPmBGvHCgfgUYvzCif
uNFFOEjUirpuPLEUrGRVTEcmpnuvCgRrJRiphcpAqxUCBSCBACFxOESYSEvA
OvzCiDcECFOvgLvJZliJzHGRcEOlTMCdPogRBvzUypuuvpgvfliFOvyCBvgE
fzlLqDSvzTyORxOVSzKUrETGCDYEEioTvDFPyvpSUiToiDpITFGvTEASvFyP
SfRzBUBpLRBCgRpilzj

Well, that was fun. But this next one is hard. It is a polyphonic
substitution. Here, each ciphertext character can represent either
of TWO plaintext letters. In other words, the key is a 2-to-1
mapping from plaintext letters A..Z to ciphertext letters A..M.
In this case, encryption is deterministic, but decryption is not.
This is a very bad thing, and modern ciphers must never do this.

As an example, suppose the plaintext characters are a,b,c,d and
the ciphertext characters are X,Y. The mapping could be

a -> X
b -> Y
c -> Y
d -> X

With this key, “cab” is encrypted as “YXY”.

Here is the ciphertext. It does not use the silly key from the example.

ICHMFICHMFIKKFAHIKBHLBHCJJLICHBKBBHDDHBIBFIHFJFLFGKDMKIFCKKC
BKLIHFAAJHBHLJICKIDCLLMJFLIKKAHBFIGCKHAGBICLLHDCEKLALDKKFAHI
IKIKHBFIGKLIBKKLHBIHBBILICHMHAIKBHLBHKIBHACKLHAGEHGHBKLKEHGE
JMFICHMFIKKFAJFIIHLIBLCKICLLMFIKLIEJICHBFMHILEHIICHKLBMKKBLK
GKFIEHKLIKHKBHGLCFBICHFEBHIKHLCMFIHLKFAKICLLMFIKLIKIBJFKHBHI
IKIDFBKGHICHBKLIHFAJFLIKKAHBICFIJLJKIFIGLHILCHMKBIHIKHGHHILA
HFIIHMCAHKIHFIKLIBFBFHAAFBICHDLFBKIFIKLIFACKHAGFIGICHGFLEHIH
LDJILICKIDIHBBKFIEHHIGHLBILLGICHIFBICFIFKICKIFCKKCILMFIIHLHI
HLDJBJFKHIKMHLLFIJLICHLIJJHLCKICLLMFIKLIKLHAGHMKBIFCKKCFLHAG
EHJLBBKEAHKCBJMMHILJFIGBILHKIHLHELHFEFKICKIICHMFIKCLAGLCICHM
HAIKBHLBHJCJBKKFAKICLLMFIKLIHMKBIBEHJLIGHBHIICLLKGLIBBKIKHFB
ILLILMKKFALEBHLBFIKLIBBCLFICFIGHHILICHHMJFIBKLILCICHHIKBHLBH
GKBIFIILEDHKIBKLIIKIHHILJFBBICHKLBMLALDKKFACLLKGLIFBBHHICLLM
FJLHBHIIIKMHALKFALEBHLBHLJLKIILCBKHFICHBHKLHIFLLGKBKICLLMFIK
LI

If your mind has not been blown yet, then this one will certainly
melt your brain. The following ciphertext is both homophonic and
polyphonic. Each plaintext character has two possible ciphertext
characters to which it can be encrypted. Furthermore, each
ciphertext character can represent either of two different
plaintext characters. The key is a mapping from A..Z to A..Z
in which each letter on each side is connected to two letters
from the other side. Encryption is again probabilistic, and
decryption is not deterministic. Bad cipher. Bad!

To clarify, consider an example: suppose the plaintext letters
are a,b,c, and the ciphertext letters are U,V,W,X,Y,Z. Then one
possible mapping is

a -> X or Y
b -> Y or Z
c -> X or Z

In this example, X can represent a or c, Y can represent a or b,
and Z can represent b or c. So “cab” can be encrypted as “XXY”
or “ZYY” or …

Here is the ciphertext. It does not use the trivial key from the example.

KOGXXMDZDVBDJHHVGJPHVILDYYDDFVOBRLDWVNMYDVJGDGLNNBRDTTNILBPH
DGOTTRHXLJSDPULFVJROIMDXRTRKILYILWYYCPJNJADRDJXTNJYGLOLLNMPN
HKOGXXLDTUVBDJRRPGJVHVNMPIYNVNWNXXTLUDXMVXVURJDNLRODWYOBROHP
AYILDBRDTEOGIIMYTUPUDKRHPNJVHXLMVIDNVLGLIILRNBYTLVILIYUUCREX
LHYYXNFDGNGIHEYXLDUHYATVNURMZUYXYNXNJUDOGDWVYHRXGPFPXYHRJYHO
JDIGVJWLRHWGPYPRHLGIDRYHROALXXRVRHVOAYXLYLRWNNZOIYGVJGPCRRVD
RIRIVUOYXMDNHSHRWNVYNDUNPRWMVRXYRTLHNDGVNDUTPNNFMYJNDMLSMIZY
RMPTGLVIYTHJMRHYXMPOLNNGLVRDCEIPCPOVYHDOSPADWPXDOHRMREGDQTDJ
NDMPGIMYTMHDDRKXLYNRBVGLLOMLNUVHYXLYRYTPGPDNHPYYVIDHILPXZVBY
WRJILDGYUXRHTREUWNNIFPXNOSUPUYNOXLYCHAVJGMVWHJIDOIMDCDUDFVJG
PLGGVFYGIMYMKRHFARYUVXLRESMORODHKXLDNPNURRNVJDTLRTXMDRDAVNRO
DTMHAPGJVMDGJRRIMDJEMYYRRJILLJANLDJHRAHXAMDOLYDJXYHYGILDGMLT
LLGOFCRDDDPLLGTPXBLVUULNGKDAYDNVOWRNJSGPOGXMDBUHIMDNMDMVGCRO
SLIKRRIMYXRLTLDMPGKHHICIARCHQDGVUDBPRDKOUDCTPBVDWALILMNNJPFD
TPNOIDWBUYPRDCHJYVULYOXNNJBDMDHMNXIDGIHFDOXNHOXMYKVUXXMYWADR
YVUUDYKIYYLLJWRJXMYYDVULILDDRNNHJMLGBUHXMYGMVRWUWFPIXYRDWCDB
PENYMYLPWGYIYJURVXGRJTLDJLYBVMDTNXMIMHDDZVLHNRJYHRXNYEXXMYAR
RNIRKNXTVGLDMPGTLRUUCJHRSRXXYJLLGOVFYLDAHEUGPJNTDHXHLLRHXRVO
WDHEWBRCGEUMPNKRCFDHHKRLXXDRFWANAXHTLVICHOFPCUPDUEMRRAMPXTPN
MLNOPFYCEIYGZDBLVDUWIMNJAEMVELSAMLDYJRHIMRGDTLRZRDJDRRYWVFRH
YJRHBNYUDTRRGLDLPGWNKJDHYOIJVMDGJHRFILDGDLNGNJXNFVIDKRNDOWNU
PDUDGMNMBVOGUYDOGGPJGLLGYOYMLYGIHVNIYGBLYDNDLLNJRHMLGOJSPNOU
WMNNLOIDUDYUIGMVUDGHXMDYYUUFVJTROUGHKXYORYFPRXYEIMLNUHEHVADN
GTDHJYBXVJWXMVXVKXDHPUDLGIMDXLNJSXMVIRJYODDWGTNIMPNOPHVLDAHO
UWKRVDALILMCDOVNRDIORONOSIMYNHGIPHYTNXMPONMTOGYOITVARJXLDLYV
WVOGMYRJBDAYOIVAVDXTPTNJZVTTLXLPYYPRKENIXRVDDZEZNIGNTLHLXNMD
GVNGMYBVFYVNPCVVDRYOXRTJYGTLDJXHHUVXDPJWLXGHRIYXMYTHHRCYUDFV
JLVUKFPGLDBHODGHJDWYVVDYHLWDBVVYJHHALLBLNFPWGXPIDJRMVXDRNPDN
TDHYIRYDMPGIMYUVGIHKILDBRYTJDDGGYGTYBLVDHDFPRVIMHEAMLYDRHVYW
PONJURDWNCDDWOOUYLDLVGKENIRJYLGDPCOIIMVXRJDCDNOSGOPRXXMYAHRW
CDDUMVOYJSPADGLLFVIROUDMDUVMDPNPYOIULYHYOISRVFYDCGYUDPRYWAMY
OXMYNLLTMVWCDDJNVLDLJSVTDDVLDBROUGRJDWVLUDYDPFDRNXMYCDUUMPJU
HRXYGGBVHYWVJWTVNVUMRNXXHRJRLSMIDODWIHNZDVXCEXVIDYOSIMLYYBZD
VLOYWNOVXRYFEURONXHJYILYRYAPGRJUCHJDCYVFYHHJCHVHWPOWILVIAPNV
IPFDHJYMYLPWRKMNGHTJALHNDWYPXLAREUGCDWYYZDCWYZDHRDWILDCYVIDR
TLHMVTZDJYGXHLYVHIMDHDMVRVZHHXYNXYGALXLIDPHGLOLXGDWYNXMVXJHI
YIDJXMYRVZIORDRKLEOILOAILDNJPHXUHEUWPXRJDJRHIMPXWNNMPDNORTHN
NYNINIRRJAUWVGFNGDWIMPIIMDCEXUMDHGLROUWCYURJIYCYWLOVNYZVHPID
NMNZCOXILDCYDDFVJGDUUVRYWXLVITHODGODIYRPARDYTNXMXMDZUVOGLYMP
WFVGDKRRIMDIRLTOVFNAVXNHOTPNVDAVCGVWNKJNBEDIPRIXMREALTLILHJD
WHOYGMNTPOGHOYYYUDPJGLYKYPHDWLYFOGIHDPDDWWYUULODKHHLNNTVHIOO
GDHXVXLOAPORXLYHPGAYDUILDYYVIDHNCDGIBHOHNYTVGJHWHOYXXHTHHBOH
DVGYBHJGMPOGGPAADHZHHRJBHPINHIMDYPVYRVWFLNDWLXVJGODBXXHLJGOH
YNXNDNKYLJGRMYRJKLUYRKJRXYXMLNXMYYVOXYHNOSSYNXYGVOGHKJYRYWJR
RLNHYHJFRGDHVIYXDRMGHRKHHGPDYITHDQBDUUDJIZRULBLDNRJYPSPLJNIK
NHDPJGRODPAVLONIGPFPSDKHRMMPLDCDINXNDDYFYHVJXYRXLVXNHRHRTKOU
GVCALYJYFYHXLYCOXULYRTPGYWILYCDPFDHXDZIUHHXNJAXMDRZTHNLIDTPW
POGVTZDPRYWOOPBUHEJXVYDWGLWXLDGDBRYXTRRGNGMOXLOW

8<————————————————————

Today’s episode is brought to you by the letters D and D.

Earlier on, I gave you a series of ciphertexts that used various
ways of doubling up on the monoalphabetic substitution cipher.
Well, this one is doubly doubled. The cipher was invented in 2011
by Viktor Veselovsky. You can read the original description in
these two PDFs. I will be using a slightly different character
set than the original. I assure you that these challenges are solvable.

https://www.mysterytwisterc3.org/images/challenges/mtc3-veselovsky-11-mono_split-en.pdf
https://www.mysterytwisterc3.org/images/challenges/mtc3-veselovsky-13-mono_nospaces-en.pdf

Here’s how the cipher works: Start with a plaintext, such as

The quick brown fox jumps over the lazy dog.

Split the text at a randomly chosen place near the middle:

The quick brown fox jum
ps over the lazy dog.

Throw away the punctuation, convert the first part to upper-case
letters and the second to lower-case, and replace spaces with “_”
in the first and “/” in the second.

THE_QUICK_BROWN_FOX_JUM
ps/over/the/lazy/dog

Next, interweave the two parts. This is done randomly (it’s OK
because the decryption is deterministic, i.e., with the correct
key you can always get the correct plaintext).

TpsH/E_QovUerICK/t_hBROe/lWN_aFzOyX/_JUdoMg

The key is a permutation of the plaintext alphabet

ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz/

For example, the key could be

ROUNDTABLE_knights/abCcdeFfGHIJjKlMmoPpQqrSuVvWwXxYyZz

With this key, we make the substitutions: (this is best viewed
in a monospaced font)

ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz/
ROUNDTABLE_knights/abCcdeFfGHIJjKlMmoPpQqrSuVvWwXxYyZz

So the ciphertext is

aSvBzDftrXbjVLU_zWfMOsgjzpcifGTZgydzfEbJrnl

Here is the challenge ciphertext. It was encrypted with a
different key than the one in the example.

a_We/eFEAQFUjFa_SehpI/DFC_oEiQ_FWAuaUaeAjSzhFfOOa_jJzUJjjQaF
EzuLpWkLurzFupezbe/FUhfOHDIhHeFvWEOAiIfubjze/AFpPehjzcfUiPaY
JzDFKpSzfCOO_UzaFa_ueLjFBzfHPtXjESzbe/AupzueLFEjAFrzI/WOuFUl
oHfvFC_DFEuaFEjAzqF_Wejtu/leFpEPaFzCpEYYKFzEHAaOlKUHaYjzDFuL
vjzEAUNNWPlwejStjUz/FUHfPJvzjFnewF/jeNSYyUuLlPikevzKFpnSDzFt
jwAITea_EjPHszfFePbJeHFTzfIzLf/OKezFonElOdUO//lpeFPUHvFzyEHj
feStzJcNYEjjiQUnzuYLepWFa_kLuez/eFEAFhUpHoQIaW_ue/Fa_eI/jJDF
C_zEfi_FPAaJzhUfaeAFOha_WUaFa_OfEAF_UAujFUYJ/zefUvPJzlPzuLDF
_UNjNzjePHJezvfPFEHFaPpW_PhjJeFzuLfneuszuLEjHzHEfPtXjSHszFXf
at_zelPzFBHKEbe/fhuzKpAeFCSUuAyFiuXp/zzeUfaePJvFztpa_zEAF_Uf
AFTPpuUveFLjUFSzYIajFwIrjFPNzeINYegFlkbkjSe/DFzhUpoHs/QDWuFj
SUzHvFnLeefJHzFCuEvpzegYjzgDWlF/OuesU/zupzKvevlFUAPFUFJnUvFz
TIbeFpUWFuzX/ULifeFIrFu_zuDLNjzfe/hEHaeYuYEWfseHOzqaWjFNtUuH
lpvPzETeXHfAEtIHzUYuLjFztnejhEHSsAFIjHuzieFnBEXYaFa_eTpAeYSJ
zblteAFzUFSsjtuEfsWSUHafEiFPuAz

That was fun, right? Now, to make it a bit harder, let’s remove
the spaces between words, and drop the “_” and “/” characters.
Good luck!

svIRmpyyPSDeiGImDtyVDtPWYKCnyPxkICnqVmIxeGGEPtUmhOuDJIqWRPhe
CmuuOWWUEYqzqxPDyWepDWhVNCiIPqePnJWZyhWRyGfCnnDSqrxeqnmjeDJG
hywZJIOCiuIsYSDstvDoGrpjJDWxwIjWfthPtxmyJCsWflAevYWDJRghZPxY
imiVosvWjxyJSqSsJGfiDfytDinhpSPSsPUqxfYDroZGsQjqJyWAyGSqrjmh
CfnIuPmiiHjBDhbySqxPGqmYfWvkIaCnSbIDflGfPsGAyaDmYFwCZOuseeCG
YfgDNPSqQsinvyGjetSoPqRiWxjVWRmVspFxFWGfPtYZODJVDFqYGFPfJWvq
uifGJqpCnyPCxWvsJpepWVwGWvqvysGYySmEyPtCfiDfsPelnGFgRseCnDJP
yatDfqxtJICqwxikDsvyiGfPGqQAJIsPvhPDvWxVmiGfikIuOWlWJIPUifjR
WxVNgmevDsviJyqxYCnyqnuuGmKxPhSsyCJACJpSSsJPtCUfJqGIxaWDZtJI
uQxqPkGhXZstxiqYtGqzfqxJgDmufsCvnpWghCvfzJqvPstqvyGubfCJCfeD
uhNmPxrAhCPqOZsfutQsevlreYPJyJWPphmxxiJbsymIxPGJIPhWZhPvQsvD
yiGSqYqpfxqkDiJyaWIDxJJIQCsitYPKCnPsvyqxkDyasvqQi

TLW CIPHER Hint Posting 3

RQH SDUWLFXODU PDWK RS ZLOO KHOS BRX.

TLW CIPHER CHALLENGE #2
You may have to get on the telephone to tri to solve this cipher!

8447063772430927074448086337096870346437847706602078263273053972308353746630843083603444870873302730137608606463094840344480137607377373684640207722302630344480663073773736846401067010322406308430684370344487089608606463073773736806630630847330767742530538837708437309680945503463066084306863742028886670630207466370539723

Your answer to be any four non consecutive words in order left to right from the plaintext.
— do not use the four same words as other peoples answers —

Example Answer TLW #2 word word word word

TLW’s A, B, C quizz. Can you answer these?

=============================================================== A
GETTING ROPED IN

There was a rope hanging over a pully with a weight on one end and a monkey of equal weight on the other end. The rope weighed four ounces per foot; the age of the monkey and the age of it’s mother were together equal to four years; the weight of the monkey was as many pounds as it’s mother was years old; the mother was twice as old as the monkey was when the mother was half as old as the monkey will be when the monkey is three times as old as the mother was when the mother was three times as old as the monkey. The weight of the weight and the weight of the rope was half as much again as the difference between the weight of the weight, and the weight of the weight and the weight of the monkey.
What was the length of the rope?

=============================================================== B
GOING BANANAS

A rope hanging over a thick tree branch, the length from the branch to each of the ropes two ends is the same. The rope weighs one third of a pound per foot. On one end of the rope hangs a monkey holding a banana, and on the other end a Weight equal to the weight of the monkey. The banana weighs two ounces per inch. The rope is as long (in feet) as the age of the monkey (in years), and the weight of the monkey (in ounces) is the same as the age of the monkey’s mother. The combined ages of the monkey and its mother are thirty years. One half of the weight of the monkey, plus the weight of the banana, is one fourth as much as the weight of the Weight and the weight of the rope. The monkey’s mother is half as old as the monkey will be when it is three times as old as its mother was when she was half as old as the monkey will be when it is as old as its mother will be when she is four times as old as the monkey was when it was twice as old as its mother was when she was one third as old as the monkey was when it was as old as its mother was when she was three times as old as the monkey was when it was one fourth as old as it is now.
How long is the banana?

=============================================================== C
Give the missing number N in this sequence:

10, 11, 12, 13, 14, 15, 16, 17, 20, 22, 24, 31, 100, N, 10000, 1111111111111111.

===============================================================

[10degrees-admin]

fingertips ten digits zero

TLW: please confirm that ” Q or Z ” is a correct part of the plaintext.

TLW Cipher #2

First again – Madness has the correct answer.

Your question is confirmed as correct…
The correct plain text should confirm it too 😉

[10degrees-admin]

TLW Quiz:

I don’t think 1111111111111111 fits into the sequence!

@Kford, Oh! Any one else think that?

[10degrees-admin]

Hold on! Is the weight of the weight the same as the monkey PLUS the banana, or just the monkey? If it’s just the monkey then the answer is: The monkey lands on the ground and runs away.

[10degrees-admin]

TLW Quiz:
I have C! N=121

@Kford-academy – and do you still think 1111111111111111 doesn’t belong?

@Madness
Oh oh that’s funny! I would agree with you too.

It is copied word for word from a 1972 book except for the first sentence where it was given as:
“A rope over the top of a fence has the same length on each side.” Which changes nothing to the calculations.

In honesty I only thought to include the two puzzles together because of their similarity.
I remember solving this banana one some years back and have my jottings on a piece of paper from that time which don’t mean much as a written solution. I only have the answer.

So I do apologize if it cannot be worked out from the text given.
I do have a written solution for the length of the rope.

[10degrees-admin]

TLW Cipher #2: RIGHT STANDARD REPRESENT LETTERS

[Author]

Posts