+GAZ Posted November 2, 2002 Posted November 2, 2002 SimonG, took me about half an hour to crack it, and besides, I haven't been there! GAZ ------------------------------------------------------------ I'm SURE I can get the car closer! Quote
+Nia Posted November 2, 2002 Posted November 2, 2002 Give us a clue - please I was guessing 'I want to...... but that was as far as i got Tech-no notice Quote
+SimonG Posted November 2, 2002 Posted November 2, 2002 Gosh, I never expected it to spark so much interest! Maybe I should be really cruel and change it on a weekly basis... Nia, you're almost right. Maybe the last part of GAZ's post will tip you off to where you're going wrong? If you really want it making easy, here's a dead giveaway. W ezlf fr Cnzfajnzb Omdg, mlx mnn w prf emq fjwq nrhqb abojzd. Quote
+Nia Posted November 3, 2002 Posted November 3, 2002 Got it LOL it is quite clever realy Tech-no notice Quote
Seifer Posted November 3, 2002 Posted November 3, 2002 It took me 1/2 an hour but I finally worked it out with no help!. Very nice. Still can't work out the reasoning behind the code, and there are no entries for i, k, s,t,u,v,y! Michael aka 1/2 of Team Blitz If life iz a game, then y aint it fair, im alwayz the lonely 1, u dont even care :S Quote
Seifer Posted November 3, 2002 Posted November 3, 2002 quote:Originally posted by GAZ:and besides, I haven't been there! Neither have I! Michael aka 1/2 of Team Blitz If life iz a game, then y aint it fair, im alwayz the lonely 1, u dont even care :S Quote
Ben Pid Posted November 3, 2002 Posted November 3, 2002 Anyone care to inform me what code it is you are all talking about?? then maybe I can have a go. Pid Ben Piddington http://www.buckscaching.co.uk Quote
+Nia Posted November 3, 2002 Posted November 3, 2002 Pid Jusr read ANY post by SimonG. There is one up there^ Tech-no notice Quote
+Masher Posted November 4, 2002 Posted November 4, 2002 quote:Originally posted by GAZ:SimonG, took me about half an hour to crack it, and besides, I haven't been there! GAZ ------------------------------------------------------------ I'm SURE I can get the car closer! I went there for some training courses, many years ago when it was owned by the GPO/BT - perhaps it still is. Despite spending several weeks there in total, I never actually saw any of the stuff that Simon saw in his last visit. Perhaps I need to revisit, as I find it all quite fascinating. Mark ---------------------- I was technical once Quote
+SimonG Posted November 4, 2002 Posted November 4, 2002 Eh? What did I see? You're talking about some other Simon, right? I've not been there really. W ezlf fr Cnzfajnzb Omdg, mlx mnn w prf emq fjwq nrhqb abojzd. Quote
+jeremyp Posted November 4, 2002 Posted November 4, 2002 quote:Originally posted by Team Blitz (Michael): Still can't work out the reasoning behind the code, and there are no entries for i, k, s,t,u,v,y! Does it have to have any reasoning behind it? ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching Quote
Seifer Posted November 4, 2002 Posted November 4, 2002 quote:Originally posted by jeremyp: Does it have to have any reasoning behind it? ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching no Michael aka 1/2 of Team Blitz If life iz a game, then y aint it fair, im alwayz the lonely 1, u dont even care :S Quote
Seifer Posted November 12, 2002 Posted November 12, 2002 I see that many of you have cracked my code, but no-one has cracked my number sequence. Come on, it's hard but it's do-able. If you want some more hints, it's in standard geo-caching decrypt below. OR if you want an easier one : 8 22 36 50 64 This one can be worked out with the formula An2+Bn+c Ok, the hint for the ACTUAL sequence is : gur svefg nef vf a gb gur cbjre bs svk vg'f rnfl sebz gurer Michael aka 1/2 of Team Blitz Wqablz-xqxw tdqml kwfwm twjowcl di klelqklqok ejw hepw gt dm lbw ktdl! 3.5 69 736.5 4106 15637.5 Quote
+SimonG Posted November 12, 2002 Posted November 12, 2002 I've emailed you the answer. I needed the hint - I'd been working along completely the wrong lines. W ezlf fr Cnzfajnzb Omdg, mlx mnn w prf emq fjwq nrhqb abojzd. [This message was edited by SimonG on November 12, 2002 at 11:36 AM.] Quote
Seifer Posted November 12, 2002 Posted November 12, 2002 quote:Originally posted by SimonG:I'd been working along completely the wrong lines. I think many may have been doing just that. glad sum1 finally got it! Michael aka 1/2 of Team Blitz Wqablz-xqxw tdqml kwfwm twjowcl di klelqklqok ejw hepw gt dm lbw ktdl! 3.5 69 736.5 4106 15637.5 Quote
+jeremyp Posted November 13, 2002 Posted November 13, 2002 quote:Originally posted by Team Blitz (Michael):I see that many of you have cracked my code, but no-one has cracked my number sequence. Come on, it's hard but it's do-able. If you want some more hints, it's in standard geo-caching decrypt below. Actually, it's not doable if your hint is correct (I may be reading the hintslightly wrong, because it has a typo in it). quote:OR if you want an easier one : 8 22 36 50 64 This one can be worked out with the formula An2+Bn+c The differences are all 14 which means that you can solve it with a straight line equation. i.e. y = 14x + 8, where y is the number in the sequence and x = 0, 1, 2, 3.... quote:Ok, the hint for the ACTUAL sequence is : gur svefg nef vf a gb gur cbjre bs svk vg'f rnfl sebz gurer For my next bit below, I'm assuming that the "s" in "svk" should really by an "f" quote:3.5 69 736.5 4106 15637.5 This sequence only has 5 numbers in it. That means I can find an equation to fit it where the highest power is only 4 i.e. an equation of the form y = Ax^4 + Bx^3 + Cx^2 + Dx + E ("^" means "to the power of"). To force it to need the "fvk"'th power you need to supply the next two numbers. To prove that it only needs the fvk'th power and not the "frira'th power, you need to supply the next number after that too. I'm off now to find the quadratic that solves this... ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching Quote
+jeremyp Posted November 13, 2002 Posted November 13, 2002 Ok, here it is: y = 140x^4 - 490x^3 + 791x^2 - 375.5x + 3.5 where x = 0, 1, 2, 3, 4. ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching Quote
Seifer Posted November 13, 2002 Posted November 13, 2002 quote:Originally posted by jeremyp: quote:Ok, the hint for the ACTUAL sequence is : gur svefg nef vf a gb gur cbjre bs svk vg'f rnfl sebz gurer For my next bit below, I'm assuming that the "s" in "svk" should really by an "f" No, it should be an S !!! If you use n instead of y then you get a much more reliable formula, it's not that dadgum hard! Michael aka 1/2 of Team Blitz Wqablz-xqxw tdqml kwfwm twjowcl di klelqklqok ejw hepw gt dm lbw ktdl! 3.5 69 736.5 4106 15637.5 Quote
+jeremyp Posted November 13, 2002 Posted November 13, 2002 quote:Originally posted by Team Blitz (Michael): quote:Originally posted by jeremyp: For my next bit below, I'm assuming that the "s" in "svk" should really by an "f" No, it should be an S !!! If you use n instead of y then you get a much more reliable formula, it's not that dadgum hard! Now you have got me confused. Your clue translated says this: quote:the first ars is n to the power of fix. It's easy from there. I think fix should be six which would be encoded as fvk. My solution to your sequence works for every number in that sequence (get a calculator and try it). How is that not reliable? ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching Quote
+jeremyp Posted November 13, 2002 Posted November 13, 2002 quote:Originally posted by jeremyp: quote:Originally posted by Team Blitz (Michael):Originally posted by jeremyp: For my next bit below, I'm assuming that the "s" in "svk" should really by an "f" No, it should be an S !!! If you use n instead of y then you get a much more reliable formula, it's not that dadgum hard! Now you _have_ got me confused. Your clue translated says this: quote:the first ars is n to the power of fix. It's easy from there. I think fix should be six which would be encoded as fvk. My solution to your sequence works for every number in that sequence (get a calculator and try it). How is that not reliable? If you're telling me that the solution has a sixth power of n in it, then I'm telling you that there are actually an infinite number of solutions of which yours is only one. Why not add 46,671, 117,666.5 and 262164 to your sig. That will make your sequence (that I assume you are thinking of) unique. [This message was edited by jeremyp on November 13, 2002 at 11:03 AM.] Quote
el10t Posted November 13, 2002 Posted November 13, 2002 quote:the first ars is n to the power of fix. It's easy from there. I'm still left wondering what an ars is. Rich mobilis in mobili Quote
Two Bears Posted November 13, 2002 Posted November 13, 2002 It's that thing I can't tell from my elbo. And jeremy's maths is spot on (smart ars!) Quote
Seifer Posted November 13, 2002 Posted November 13, 2002 quote:Originally posted by jeremyp: quote:the first ars is n to the power of fix. It's easy from there. alright, i'll spill the beans! My original formula was (n^2)^3 + (0.5n)+3n which simplifies to n^6+2.5n This is the way i did it but my clue was i bit off, mty typring is verty badt! It should have been "The first BIT is n to the power of SIX, it's easy from there" Sorry if i got people confused, i will change it to a simpler sequence if people want Michael aka 1/2 of Team Blitz Wqablz-xqxw tdqml kwfwm twjowcl di klelqklqok ejw hepw gt dm lbw ktdl! 3.5 69 736.5 4106 15637.5 Quote
el10t Posted November 14, 2002 Posted November 14, 2002 Hi Michael, Your solution certainly looks tidier than jeremyp's, but unfortunately isn't a unique solution to the problem. To illustrate what jeremyp is getting at, suppose I am thinking of a simpler series where the nth term is n^2+1. The series therefore goes: 2 5 10 17 26 etc I want you to guess this series formula but only give you the first two terms: 2 5 The simplest solution to this series on the given information is that the nth term is simply 3n-1. This has no power of 2 in it. If I then say that the solution has to have a power of 2 in it then there are infinitely many formulae that provide the 2 and the 5, e.g n^2+1 or 2n^2-3n+3 or 3n^2-6n+5 or 4n^2-9n+7 and so on. All of these fit the series as given, but only the first one is the one I was originally thinking of. To remove the ambiguity you need to include the next number in the series, 10. Then only the first solution fits. Rich mobilis in mobili Quote
Seifer Posted November 14, 2002 Posted November 14, 2002 Ok, i screwed up a bit, on my next one, i'll make it a bit easier and more unique! Michael aka 1/2 of Team Blitz Wqablz-xqxw tdqml kwfwm twjowcl di klelqklqok ejw hepw gt dm lbw ktdl! 3.5 69 736.5 4106 15637.5 Quote
Seifer Posted November 14, 2002 Posted November 14, 2002 Ok, here is the NEW, SOLVABLE one! Michael aka 1/2 of Team Blitz Wqablz-xqxw tdqml kwfwm twjowcl di klelqklqok ejw hepw gt dm lbw ktdl! 26 27.75 34.2(recuring) 41.09275 480.048 55.027777777(carrys on!) 62.01749271 Quote
+Team Minim Posted November 14, 2002 Posted November 14, 2002 How long before a virtual crypto cache is created by one of our anorak cryptographers? Thinking along the lines of the photographers cache but with *pure* cryptoclues, hints posted every week until solution posted.... Just a thought. Shares in Tupperware? Be a Geocacher! Quote
+jeremyp Posted November 14, 2002 Posted November 14, 2002 quote:Originally posted by Two Bears:It's that thing I can't tell from my elbo. And jeremy's maths is spot on (smart ars!) The State (i.e. you tax payers) paid a lot of money for me to spend three years at York University drinking my liver to death.... err sorry I mean obtaining a degree in mathematics. With these sequences based on polynomials (a posh name for these formulae with only integer powers of n in them), the basic rule of thumb is that if you have x numbers in the sequence, you can always find a formula with An^(x-1) as the highest power of n which will fit the sequence. That's how I knew that Michael's sequence could be solved with a quartic (a posh name for a polynomial with n^4 as the highest power). Technically my solution is simpler than Michael's since it only has a fourth power, but Michael's has a certain elegance about it which makes it aesthetically better as a solution of his puzzle. BTW, I didn't work out my solution by hand. I modified some of my GPS point conversion software for the purpose. ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching Quote
el10t Posted November 14, 2002 Posted November 14, 2002 quote:Originally posted by jeremyp:BTW, I didn't work out my solution by hand. I modified some of my GPS point conversion software for the purpose. Might have been easier by hand - just solve the set of simultaneous equations provided by plugging in the values of n. No coding required Rich mobilis in mobili Quote
+SimonG Posted November 14, 2002 Posted November 14, 2002 quote:Originally posted by Team Minim:How long before a virtual crypto cache is created by one of our anorak cryptographers? Thinking along the lines of the photographers cache but with *pure* cryptoclues, hints posted every week until solution posted.... Now that's a good idea! (starts plotting fiendishly...) W ezlf fr Cnzfajnzb Omdg, mlx mnn w prf emq fjwq nrhqb abojzd. Quote
+jeremyp Posted November 14, 2002 Posted November 14, 2002 quote:Originally posted by el10t: Might have been easier by hand - just solve the set of simultaneous equations provided by plugging in the values of n. No coding required Rich _mobilis in mobili_ Solve five simultaneous equations by hand? Nah, my software had matrix inversion and multiplication code in it, so it was a snip to put in the right matrices to get the computer to do it. ------- jeremyp The second ten million caches were the worst too. http://www.jeremyp.net/geocaching Quote
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.