]]>

1. You begin the game with 10 US dollars

2. Every round, you may wager any of your current US dollars

3. After you have wagered, we toss a fair coin, which leads to one of two outcomes:

a. Heads - You lose your wager

b. Tails - You get your wager back AND win 200% of your wager's value

4. You have 100 rounds in which to maximise your profits as much as possible

5. It should go without saying, but if you ever end a round with 0 US dollars, you've lost

The game is obviously in your favour, but provide a betting strategy which uses these rules to win as many US dollars as possible.

]]>(for example try computing a MacLauren series for (1+2x)/(1-x^3)

]]>

Find f(x) where f(x) is a polynomial.

]]>find f(x) =

]]>Multiple emojis placed on top of one another count as added together.

]]>

f(h(x)) + h(g(x)) + g(f(x)) = 2x^2 - 15x + 66

f(g(x)) = g(f(x))

h(g(x)) - g(h(x)) = -16x + 72

h(f(x)) + f(h(x)) = 2x^2 + 10x + 30

f(x) * g(x) = h(x) - 3x - 40

-----

f(x) =

g(x) =

h(x) =

I look at my ticket: 3. Maybe you have a low number like 11... So I offer to exchange our tickets before showing them.

What is the probability I will do the dishes?

]]>
From my friend: "This book consists of a series of 4 different murders culminating in a final riddle to reveal the person behind it all. Each of the four murders have a different killer that you must solve before will be able to find the fifth name.

And one more thing, this book may or may not be slightly very much out of order so you may want to have a pen and paper handy."

Image book:https://imgur.com/a/BtiI0m7

Txt book for copy/pasting: https://drive.google.com/file/d/1Qta5w-U1OTVrcWw-QF5DxAi2I2l2K5Kf/view?usp=sharing

]]>

**Assume N38 5A.BCD W074 5E.FGH**

Once upon a time in the Beautiful Town of Cape May,some Evil Genius placed a puzzle cache that was super difficult Some Would Say..No where in his Wildest Dreams did he imagine it would still be unfound today,as I put out this Sequel that will cause more Head Banging and signs of Dismay..Approaching the Anniversary he just couldn't Bare The Thought,to not Carry On Tradition that may get some cacher's Frustrated or Distraught..Did he really feel the need to Show Discipline or just gets an Evil Grin or Giggle from the Gossip and Silent Violin..As Crazy as this must Sound,the solve is meant to be,the Seed doesn't Fall far from the Evil Kenevel Apple Tree..All I Need is to find a way to get into that Evil mind or take a look at it later when I'm not feeling so Blind..I'm guessing you sure have to be some kind of Special to crack these Sneaky Tricks or get behind the mind set of being Semi Evil or Super Slick..You Already Know this isn't no Easy walk in the park,you may have better luck walking backwards,Blindfolded in the Dark..Why even torture yourself,just throw it in the more later and never look back,that's me doing you a Huge Favor..This is your Final Warning so take it with Grace or take it Slow and Steady,that's what win's the turtle race..There is no Rush,no $100 bills or pot of Gold,but by the looks of the Original just a log to sign that's looking Antique and Old..Absolutely no Nonsense,that's keeping it Real,no hints,no coordinate passing or spoilers,that is the Deal..Until next time,Good Bye,Farewell and Goodnight,don't let the Puzzle Monster's eat your brain up tonight..

Byq Qbt jvgu arj gevpxf sbetrg jung lbh gubhtug lbh rire xarj

008912674801656291047200174021739013917346286347637563756

592376461964612916469104619364191064091649016490164091640

642001646781061338640187365637251893464916916341541015641

9H6K4F9IW6L2G6P

6D8U3A7K4D9C5M4

02P6S7O9J6H7S9E

SIX,TEN,SEVENTEEN,EIGHTY FOUR,ONE

THREE,THIRTEEN,FOUTY FOUR,FIFTY ONE,SEVEN

TWO,NINETEEN,SWENTY FOUR,SIXTY ONE,TEN

]]>All digits from 0-9 as shown are 1 in. thick and within 3x5 in.dimesion except number 1. The task is to put all the numbers inside the square box with smallest dimension nxn without overlapping of segments or flipping. Just rotation and segment insertion are allowed. How you can fit all digits from 0 to 9 inside the box?

]]>

Take all the black pieces except for the King and

all the white pawns out of the board on initial position.

From this position White makes regular chess moves.

Black King can jump to any unattacked square.

Black King is not allowed to capture White pieces.

Check mate the Black King.

This has a 9 moves solution but less than 20 will do..

__________________

Thanks to Prime for the assist

]]>Multiple emojis placed on top of one another count as added together.

]]>Person 1 has sword with which he kills person 2 gives the sword to person 3.

Person 3 kills person 4 and passes the sword to person 5.

Every time the person who has the sword kills the next person in the circle and passes the sword.

This is continued till there is only one person alive.

Who is the Last Man Standing?

]]>SpoilerPerson : 977

Can you derive a general formula and also a general method for any value of initial number of person.

Car A leaves 8 minutes ahead of Car B

Car B travels at 70mph

After how many miles will Car B catch Car A?

]]>

Thanks in advance!

]]>I have this logical question:

Sorry english is not my native language.

Good Luck

you bring an amount of money,

you can bet any amount of money you like,

the game stop if :

1. your money have doubled (exactly 2x your first amount of money)

2. or you lose all of your money.

you can't stop in the middle of the game.

example : if you bring 10 dollars:

1. If you bet all your money in the first bet, so if you win you get 20 dollars and game over, or if you lose, you lose all your money and game over.

2 If you have already win 19 dollars, so in the next game you maximum bet is only 1 dollar.

what is your strategy to win the game ?

]]>