L'entraînement aux entretiens quant qu'on peut vraiment voir.
Chaque explication prend une question qu'un desk pose vraiment et la déroule jusqu'au bout. Tu vois d'abord le piège, comment presque tous tombent dedans, puis le raisonnement qui t'en sort.
Differentiating y = L tan(wt) gives a spot speed of w R squared over L, so the footprint accelerates with the square of its distance from the lamp: a tenth of pi directly opposite, and exactly pi miles per second nine miles along. The 9 is the along-shore leg, which makes 90 the squared hypotenuse rather than the square of nine, and that misreading is the usual failure. Nothing physical moves at that speed, and a straight coast running 2310 miles would carry a nominally faster-than-light spot carrying no information at all.
Six months of a sixty dollar year carries 60 over root two, which is 42.43 rather than 30, because variances add over disjoint intervals and standard deviations do not, so the digital is worth exactly $239,750. The figure of $250,000 in circulation comes from rounding the z score 0.7071 up to 0.75 and then reading the tail at 0.75 as 0.25, but Phi(0.75) = 0.773373, so even the rounded chain gives 0.2266. Rounding z upward has to make the tail smaller, and 0.25 is larger, which is the tell that a symbol changed meaning mid-calculation.
The 95 percent margin on a proportion is almost exactly 1 over the square root of the sample size, because p(1-p) is flat enough near its peak to call a quarter and 1.96 is close enough to 2, and those two roundings are reciprocal so they annihilate. At N = 1000 the shortcut gives 3.16 percent against an exact 3.04, and it always errs on the conservative side. Reporting one standard error instead, 1.55 percent, describes a 68 percent interval rather than a 95 percent one.
A share sits at 75, the rate is zero, and a perpetual claim pays one dollar the first time the price ever touches 100. It is worth exactly 75 cents, and no volatility number is needed to say so. The reflex answer of a dollar assumes the barrier is always reached, which a price with a floor at zero never promises: a quarter of the paths fade away without paying anything.
The standard deviation of 1, 2, 3, 4, 5 is either 1.4142 or 1.5811, and offering one of them without asking which question you are answering is the only wrong move. The sum of squared deviations is 10 either way, so everything turns on whether you divide it by 5 or by 4. Bessel's correction makes the variance unbiased and leaves the standard deviation biased low by about six percent at this sample size, and a third divisor beats both of them if you optimise for mean squared error instead.
The two correlations you are handed do not pin the third one down, but they fence it into exactly [−1/50, 1], and that interval dips below zero. The fence falls out of a 3×3 determinant read as a quadratic in the unknown, and out of a picture: 0.7 is an angle of 45.573°, both stocks live on a cone of that half-angle around the index, and putting them on opposite sides opens 91.146° between them. Also here: why the real tipping point is ab ≥ 0 together with a² + b² ≥ 1 rather than "both above 0.707", why 0.9 and 0.5 force a positive answer while 0.9 and −0.9 allow −1, why standing on the floor costs a rank, and why three Bernoulli(0.5) indicators with the same two correlations are confined to [0.40, 1] instead.
A fair coin cuts probabilities into halves and quarters, and a short argument about the prime factorisation of two shows it can never reach one third in a bounded number of flips. Dropping the bound fixes it: flip twice, bin the tail-tail, and each child holds exactly a third for 8/3 flips on average. That naive scheme turns out to be the best any coin-flipping procedure can do for three outcomes, which stops being true at five.
A three-month at-the-money call on a stock at 100 with 40% volatility is worth about eight dollars, and you can get there in two multiplications. The constant four tenths turns out to be the height of the normal bell at its peak, and the whole error of the mental rule is one rounding plus one cubic term. Scaling volatility linearly with time instead of with its square root gives ten dollars, which is 25.5% too high.
Take the centre, then mirror every move through it, and you place the last coin. The proof has three requirements and only one of them needs that opening move, which is the step a one-line answer skips. Central symmetry alone is not the condition: an annulus is centrally symmetric and the first player loses on it.
A stranger says out loud what every islander can already see, and ten days later ten people leave. The fact was mutual knowledge all along; what the announcement supplied was the nine levels of nested knowledge above it. An explicit count over 4096 possible worlds settles the induction without trusting it.
Nine slots hold the digits 1 to 9 and four overlapping windows each add to 20. One subtraction pins the centre digit to 5 with no search at all, and the same structure classifies every arrangement: there are 96 of them, falling into 48 mirror pairs. Change the target and the centre is forced to an odd digit that sometimes admits nothing.
A safe takes three numbers from a dial marked 1 to 40, so there are 64,000 combinations, and the worst case is 1600 attempts rather than 64,000. The third number is supplied by the mechanism instead of guessed, which collapses the search from three dimensions to two, and 1600 is proved both achievable and unavoidable. A dial with a mark of mechanical slack drops the count to 196, which is a covering problem on a cycle of forty.
An at-the-money call has no ceiling on its payoff and an at-the-money put is capped at the strike, yet at a zero interest rate the two cost exactly the same. The reason is put-call parity and it uses no model at all: the difference of the two payoffs is a straight line, so pricing it needs only the risk-neutral mean. The equality was checked on five terminal distributions with mean at the strike, and on a sixth whose mean is 120, where the gap is exactly 20.
A die is rolled up to three times and you are paid the face you stop on. The reflex answer of 3.5 is the value of the same game with the right to stop deleted, and the real value is 14/3, reached by computing the game from its last roll backwards. The thresholds move as rolls run out, which is why a four is worth keeping late and worth rejecting early.
One radius drawn to the rectangle's far corner turns the whole problem into a right triangle with legs R - 10 and R - 5, and the quadratic that follows has roots 5 and 25. Both satisfy the equation exactly, so rejecting 5 takes geometry rather than arithmetic: at that radius the corner really does touch the circle while the rectangle has already swallowed half the disk. The general a by b rectangle shows the discarded root is a permanent feature of squaring.
Raise your right hand at a mirror and the reflected hand stays on the same side of the room, which means the usual question has a false premise. A plane mirror is the matrix diag(1, 1, -1): it fixes both axes lying in the glass and reverses only the direction you look along. Its determinant is -1, so no rotation reproduces it, and the sideways flip everyone reports belongs to the half turn you perform in your head.
Three children's ages multiply to 36. Someone who knows the sum admits she cannot name them, and that admission is the only real clue in the problem. Eight triples, one repeated sum, and a second clue that eliminates nothing on its own yet decides everything once the first has run.
Factoring into p minus one times p plus one stops the question being about p: the two neighbours are consecutive even numbers so their product carries eight, and one of the three consecutive integers around p is a multiple of three which cannot be p itself. Since eight and three are coprime, 24 divides, and 24 is exactly maximal.
The midpoint of p and q sits strictly between them, and consecutive means precisely that no prime lives in that interval, so the answer is never and the proof is two lines with no arithmetic in it. The pair 2 and 3 survives for a different reason, since five halves is not an integer, and it is the only such pair.
Multiplying by the conjugate turns the difference into x over the sum of the same two terms, exactly, with no series and no error term, and dividing through by x reads off the limit one half. Completing the square gives a constant excess of a quarter, so the gap climbs toward a half strictly from below and never reaches it.
Wind appears nowhere in the winning condition, so delete it: three cards in six equally likely orders, and you win in the two where fire comes last. One in four is the correct probability that fire is last of all four cards, a strictly smaller event, and the gap is exactly one twelfth.
The factor pi over four cancels off both sides, so the comparison is 324 against 244, about a third more pizza. Written that way it is the law of cosines: lay the three widths out as a triangle and the corner between the two smaller sides opens to 109.47 degrees, wider than square, which is the answer with no arithmetic at all.
Every family averages exactly one girl and contains exactly one boy, so the ratio of expected counts is exactly one half and a large town splits evenly. The expected share inside a single family is not one half but ln 2, and it is still 0.5249 across ten families, with the excess falling off like one over four m.
Of the eight colour triples, seven are feasible from a pool of three blue hats and two red. The first silence removes one, the second removes two more, and all four survivors put a blue hat on the third man, which is what makes his answer a deduction rather than a lucky call. A pool sweep shows three blue and two red is the only small pool where the story can happen.
Six pairings have to be separated by a single observation, and a light-only strategy always leaves at least two candidates standing. Warmth is a genuine third readable state, and three states handed to three bulbs give exactly six readings, one per pairing. The article carries the impossibility count and the four-switch case where the trick fails.
Counting to fifty in steps of one to ten, the first player wins, and exactly one of the ten legal openings does it. The stations are 6, 17, 28, 39 and 50, spaced eleven apart because eleven is one more than the largest legal step. The article carries the residue argument that proves the opening is unique, and the target 55 where the advantage flips.
The pile really does average exactly one dollar, which is why almost everyone answers one dollar and why the trap is a correct calculation of the wrong quantity. The play is worth two thirds, because the roll that ends the game pays on two of its three faces and that roll is independent of how big the pile grew.
A pebble climbing four boxes on coin flips needs 18/5 flips on average, and the two-line renewal argument that gives 4 is wrong. Its premise is true, since half of all games really do end on flip two, but the non-finishing half is two different states: tails-tails sends the pebble home while heads-heads leaves it on box 3, one flip from the exit and worth only 14/5.
Every one of the nine conditions leaves a remainder one short of its divisor, so x plus one is divisible by all of 2 through 10 and the answer is 2519. Minimality comes free, and the whole solution set is 2520k minus 1. The article carries the coprimality caveat, the near miss 209 that satisfies six of the nine, and a variant where no shift exists.
Every route across a five by five grid is ten steps long with exactly five going east, so counting routes is choosing which five of the ten slots are east. The reflex 1024 is the exact number of free ten-step walks, and only 252 of them arrive. Forbid the route to rise above the diagonal and the count collapses to the Catalan number 42.
The dial totals 78, so each piece needs 26, and the pie instinct fails on all 220 possible cuts. The proof is three lines of triangular numbers: only one pair of running totals differs by 26, which forces the first two cracks and then demands a total of 62 that does not exist.
Four over fifty-two squared is exactly right for the question where the first card goes back, which is what makes it hard to catch. Removing a king shrinks the numerator proportionally more than the denominator, and the counting route through 1326 two-card hands confirms one in 221 without mentioning order at all.
Three and a half is the exact average of a plain die, which is why it survives being double-checked. The rule does not reweight six outcomes, it deletes one, leaving a uniform payoff on five faces and an answer of four. The procedure costs 1.2 rolls on average, and the version where the reroll is your choice is a different game worth 4.25.
Coins have no memory, which is true, and nobody said this coin is fair, which is the whole problem. A fair coin explains the run with probability two to the minus one hundred while a two-headed coin explains it every time. The article locates the threshold exactly and reconciles the answer with the companion piece on ten heads, which asks a different question about a different setup.
The pour back really was diluted, and the conclusion still does not follow: both jars finish at six cups, so whatever left one jar was replaced cup for cup by what arrived. That argument needs no fractions and survives terrible stirring, while the number 1.5 cups does not.
Unfolding two faces into a 2 by 1 rectangle turns the walk into a straight segment of length root five, crossing the shared edge at half height. The reflex answer of one plus root two is the same one-parameter family evaluated at the end of that edge instead of its middle, so the trap and the answer are two points on one curve.
Multiplying four rings a minute by five gives a quantity in inverse minutes squared, so a dimension check kills the twenty-second answer before any number theory. Converting to gaps makes the ring times two arithmetic progressions whose intersection is the least common multiple. Shift one bell by a second and the two never coincide at all.
The hedge on a long call is the slope of its value, and a convex curve flattens as you slide left, so a falling share forces a smaller short and a smaller short is a purchase. No volatility, maturity or distribution enters that argument. The rebalance buys twenty shares, and the position gains 0.9824 per share on the fall.
Thirty-two rings really do take 136 years at a move a second, which is what makes doubling it to 272 so tempting. The exact ratio between the two cases factors as two to the thirty-two plus one, so the guess is short by more than four billion times. The article carries the lower bound the recursion alone does not give, and the 2-adic rule for which ring moves when.
Seven pieces cost six cuts and the schedule pays correctly, so the six-cut answer breaks one constraint and nothing else. Because the worker can hand pieces back, the contract is on his holding rather than on the transfer, and the ledger turns out to be a three-bit counter. Brute force finds 1-2-4 is the only three-piece solution.
Halving the length and timing the flame is not a biased estimator of half the time, it is unrelated to it: across four thousand random cords the midpoint method scattered from under fifteen seconds to over forty-five. Lighting both ends gives exactly thirty on every cord, by an argument that never evaluates the burn rate.
Taking one coin from each bag reads 9.9 ounces whichever bag is light, and the failure is blindness rather than imprecision. Loading i coins from bag i makes the dial an injective function of the culprit, at a cost of the tenth triangular number. A 45-coin variant is cheaper, and powers of two identify any subset of light bags from one reading.
Adding fives and threes never reaches four, and that observation is correct. It is also about the wrong set, because a pour is a subtraction and the reachable amounts are the integer combinations rather than the natural ones. An exhaustive state-graph search proves six pours is minimal, and the four missing sums turn out to be the gaps of a numerical semigroup.
The North Pole really is a solution, so the trap is only the words "and nowhere else". A mile north of the parallel whose whole lap measures 1/n of a mile, the eastward mile is n exact revolutions, which puts a starting circle 1.159 miles from the South Pole for one lap, 1.080 for two, 1.053 for three. Every point of every circle works, so the honest count is uncountable rather than infinite.
Cut two diagonally opposite corners off a chessboard and 62 = 2 x 31 stays true, yet nothing fits. Writing the colour of a square as the sign (-1)^(i+j) turns the argument into arithmetic: every domino sums to zero, the two lost corners both carried +1, and the board left over is 30 against 32. The converse, Gomory's theorem, is the harder half and it goes the other way.
You hit one time in ten, your two opponents three and six, and you shoot first. Firing into the air is worth 965/4736 = 20.376%, which beats removing the strongest player by 0.195 percentage points, because a landed hit drops you into the duel you must enter second at 7/37 rather than first at 10/37. The article carries all three option values, the fixed points they solve, and the single Nash equilibrium that turns the usual assumption into a conclusion.
Two people arrive at random inside the same hour and each waits fifteen minutes, so the reflex answer is a quarter. Drawing both arrival times as one point in a 60 by 60 square turns the question into an area, and the two corner triangles it leaves out have legs of 45, giving 7/16 rather than 1/4. The general formula n(2T-n)/T squared shows why the first minutes of patience buy the most.
A stock at 100 goes to 130 with probability 0.8 or 70 with probability 0.2, rates are zero, and the right to buy at 110 is worth 10 rather than 16. A third of a share funded by borrowing 70/3 reproduces both payoffs and costs 10 today, which prices the option without using a probability anywhere. The general risk-neutral probability (S-d)/(u-d) is a half here only because rates are zero and 100 sits midway between the two outcomes.
Deux cassures au hasard, trois morceaux, et trois inégalités qui n'en font qu'une. Le quart tombe d'un carré sans la moindre intégrale, et le morceau le plus long, 11/18 en moyenne, explique pourquoi la réponse paraît trop basse sans l'être.
A boat carrying a dense rock floats in a pool; the rock goes over the side and sinks. The mass inside the pool is unchanged, so the reflex says the level cannot move, but it falls by exactly (d-1)V/A. The article carries the algebra the fifty-second version had no room for, plus the force balance on the sunk rock that shows the floor is where the argument closes.
Stack i + j - 1 cubes on every square of a 20 by 20 board and the total is 8000, which is 20 cubed. Folding the board across the squares that are exactly 20 deep pairs every stack with a mirror stack, and each pair adds to 40, so the average depth is 20. The double sum gets the same answer and is merely slow, and the main diagonal is the fold that proves nothing.
Draw X and Y uniformly from the unit interval and their product beats a half with probability (1 - ln 2)/2, about 15.3 percent. The reflex answer of a quarter counts a condition that is genuinely necessary and treats it as sufficient, which is why 0.8 times 0.6 sits inside the quarter square and still loses. The hyperbola y = 1/(2x) cuts the winners down to a sliver, and one integral measures it.
At 3:15 the minute hand is on the 3 and the angle between the hands looks like zero. It is 7.5 degrees, or pi/24 radians, because the hour hand crawls a quarter of the way from the 3 to the 4 while the minute hand travels a full lap. The zero answer is exact for a clock whose hour hand waits on each numeral and jumps, which is not a clock that exists.
La réponse réflexe tourne autour de 180, la moitié du calendrier. Le vrai seuil est 23, parce qu'une coïncidence demande une paire et que 23 personnes en portent 253. Le même raisonnement met la question « quelqu'un partage-t-il MON anniversaire » à 253 personnes, onze fois plus de monde, et le seuil en racine carrée derrière les deux explique qu'un identifiant aléatoire de 64 bits se répète après cinq milliards de tirages et non dix-huit trillions.
A driver who eats one apple per loaded mile delivers 833 of 3000 across a thousand miles, because the price of a mile is the ceiling of the stock over the truck's capacity: three apples, then two, then one. The continuous optimum is 2500/3, but rounding the switch point down to mile 333 leaves 2001 apples needing three passes and produces a fake 834. A lower bound on loaded traversals proves 833 optimal without a dynamic programme, and the free return legs are the clause that separates 833 from 533.
Person k flips every bulb that is a multiple of k, and after a hundred passes exactly the ten perfect squares are lit. Bulb n is flipped once per divisor, and the pairing d against n/d is fixed-point free unless n is a square, so the parity is decided by algebra rather than by accumulation. The lit fraction is one over the square root of the row, and stopping the process at person 50 inverts the answer to 54 bulbs.
You toss five fair coins, I toss four, and you win on strictly more heads: the answer is exactly 256 of the 512 outcomes. Because you hold one coin more, "not strictly more heads" and "strictly more tails" are the same event, and turning every coin over is a bijection between them. The fifth coin is worth nearly fourteen percentage points over the 93/256 you would have without it, and none of that is an edge.
Two riders twenty-five miles apart close at fifty miles an hour, so a forty mile an hour fly shuttling between them flies exactly twenty miles. The series of shuttle legs gives the same twenty, with a first leg of 100/7 and a round-trip ratio of 1/21, but no finite number of legs ever reaches it: after eighty legs the exact total is twenty minus about 2.6e-52. The general law is wD/(a+b), and it holds identically in the rider speeds rather than by luck at 20 and 30.
En devinant au hasard, les prisonniers valent 7,9 x 10^-31. En suivant le papier qu'ils viennent de trouver, ils valent 0,311828, et l'écart de trente ordres de grandeur tient dans une règle d'une phrase. La stratégie ne rend personne plus chanceux : elle ne fait que rendre les échecs simultanés, et c'est là toute la leçon.
Deux portes restantes ne font pas deux portes égales : votre premier choix est resté figé à 1/3, et les 2/3 restants se sont entassés sur la seule porte encore fermée. Le nombre ne dit rien des portes, il dit tout du présentateur. Laissez-le ouvrir au hasard, montrez la même chèvre, et changer ne vaut plus que 1/2.
Told that one of two children is a girl, the chance both are girls is 1/3. Watch a girl open the door instead and it is 1/2, from the same four families and the same prior. One likelihood separates them: a mixed family always satisfies the statement, but sends the girl to the door only half the time. Push the identifying detail to a girl born on a Tuesday and the answer slides to 13/27.
One lily doubling daily covers the pond on day thirty, so eight lilies must finish in 30/8 = 3.75 days. They finish on day twenty-seven, because eight is two cubed and that slides the whole schedule exactly three days earlier. The article carries the general rule that k lilies save the floor of log base two of k, the case where five lilies save only two, and the non-overlap assumption the answer quietly rests on.
Draw one coin from a thousand, flip ten heads, and the chance it is the two-headed one is 0.5062. Both reflex answers miss, in opposite directions: ninety-nine percent ignores the bag, one in a thousand ignores the flips. Counting patterns gets the exact figure with no Bayes notation at all, and the reason it lands on a coin flip is that 2^10 happens to sit next to the size of the bag.
Three feet up each day, one foot back each night, ten feet to climb. Dividing ten by the net two feet a day gives five days, and it charges the snail for a night it never spends. The dawn heights settle the day, the last climb settles the moment, and the closed form the video had no room to voice is a single ceiling function.
Fifty white marbles, fifty black, two jars, and a fair coin choosing which jar gets drawn from. The even split gives exactly one half, and so does every other split where the jars are the same size. Isolating a single white marble reaches 74/99, an exchange argument proves nothing beats it, and three quarters turns out to be a ceiling no arrangement ever touches.
Drop chips at random into dough, cut it into a hundred cookies, and ask how many chips guarantee no bare cookie nine times out of ten. Five hundred chips, five per cookie on average, works about half the time. Inclusion-exclusion pins the answer at 683, a closed form you can solve on a whiteboard agrees, and the coupon collector's mean of 518.7 is the sophisticated wrong answer.
Six slots in a ring, two of them marked side by side. You land on a blank one and get one move: step forward, or draw a fresh slot at random. Both look like two in six. Stepping is one in four, drawing again is one in three, and the whole gap comes from the fact that the two marks are touching. Pull them apart and the advice reverses.
Strip the outer shell off a ten-by-ten-by-ten block of unit cubes and count what falls. The reflex answer, 271, is arithmetic done correctly on the wrong picture: a shell leaves from both opposing faces, so every axis loses two units and not one. Two independent counts land on 488, and the general shell turns out to grow like a surface rather than a volume.
On the unit interval the indicator of the rationals has upper sum 1 and lower sum 0 for every partition ever written, so the two never meet and Riemann returns nothing at all. Give the k-th rational an interval of width ε/2^k and the whole countable set sits inside a total length of ε, which puts its measure at 0 and its Lebesgue integral at 0. Lebesgue's criterion turns that into the general law — a bounded function on a compact interval is Riemann integrable exactly when its discontinuities have measure zero — which is why Thomae's function, discontinuous on the same dense set, is integrable and this one is not. The trade is not free: sin x over x on the half line has an improper Riemann value of π/2 and no Lebesgue integral at all.
A counterfeit coin that might be heavy or light, a balance that only reports which side falls, and a hundred dollars a weighing. Counting rules out four; only a construction gets you five.
Une maladie que porte une personne sur deux cents, et un test sans le moindre faux négatif. La réponse réflexe à un résultat positif dépasse les quatre-vingt-dix pour cent, et elle se trompe d'un facteur dix. Une foule de mille personnes montre pourquoi avant que l'algèbre ne s'en mêle, et Bayes fixe la valeur exacte à 100/1493.
Une action à volatilité nulle, un call à la monnaie, et la réponse réflexe — zéro — qui fait échouer de vrais entretiens de trading. Un seul argument d'arbitrage la valorise de trois façons, et Black–Scholes confirme en sortie.
Une seule condition, une récurrence de deux lignes, et la cinquième puissance tombe sur un 123 net, sans le moindre radical. Grimpez assez haut la même échelle et le nombre d'or et les nombres de Lucas se cachent en dessous.
Placez trois points au hasard sur un cercle et le triangle contient le centre exactement une fois sur quatre. Deux preuves : une moyenne honnête, puis deux pièces déguisées en géométrie.
Une infinité de droites séparent les mêmes données ; seule la rue la plus large généralise. Et une fois trouvée, presque aucun de vos points ne la soutenait.
Les résultats d'un toutes-rondes peuvent être un chaos total : des cycles partout, aucun champion. Une récurrence en un seul coup aligne pourtant tout le monde, chacun ayant battu le suivant.
Une droite à coefficients rationnels envoie ℚ sur ℚ. Aucune courbe n'y parvient jamais. Trois filtres — interpolation, forme, dénominateurs — laissent la classification complète.