Bachillerato
54 artículosTwelve million people at six cans a week is 3.744 billion cans a year, which over the 525,600 minutes a calendar year offers is 7,123 cans a minute, or 3.56 production lines, or 4.19 once 85 percent uptime is allowed. Size the same demand on a 40-hour week and you get exactly 15 lines, because the two calendars differ by 219/52 = 4.2115, a systematic factor that no numerator guess can cancel. Sweeping all four inputs over 200,000 draws moves the count between 1.4 and 7.7 with a median of 3.4, so the conclusion is sturdier than any of the guesses inside it.
Sixteen million new vehicles each need a battery, which is the reflex answer and it is short by a factor of 5.375. With 280 million vehicles already on the road and a four-year battery life, replacement demand alone is 70 million a year and the total is 86 million. A second route through the steady-state vehicle life of 17.5 years lands on the same figure, and the article is explicit that this is one equation rearranged rather than a second measurement.
Multiply 2.7 million residents by six haircuts a year, divide by the 2,000 a barber delivers, and the city needs about 8,100. The tempting shortcut, one barber per thousand people, is the answer asserted rather than built, and it is off by a factor of three. The real result is a band: all 27 halve-or-double corners land between 1,012 and 64,800, because three independent log errors add in quadrature and give a factor of 3.32 rather than 8.
Fourteen billion fill-ups a year divided by what a pump could do at full tilt gives 25,000 stations; divided by what a pump actually does it gives 149,829, inside the published range. The gap is exactly six, and the article proves that six is the ratio of the two throughput guesses alone, because the fleet, the fill-up frequency, the opening hours and the pumps per station all cancel. The utilisation of one sixth is Little's law read as 2.67 busy hours in a sixteen-hour day.
Two outlets in a town of fifty thousand is one per twenty-five thousand people, which scaled to the United States gives 13,600 against a published count near 13,500. That 0.74 per cent is luck, and the article shows why: the answer is exactly inversely proportional to the one density guess, and sweeping it across every defensible value spans 8,500 to 22,667. A second chain built from revenue, sharing no input at all, lands at 13,615.
One fish per ten thousand cubic metres times the whole ocean gives 130 trillion, and the arithmetic is exact. The error is that a density you can picture is a surface density, and confining it to the 200 metre sunlit layer drops the figure by a factor of 18. A second chain built from the annual catch, which touches no ocean geometry at all, lands in the same decade, and that agreement is the result rather than either set of digits.
Dividing the cabin by the ball gives 29.8 million, which is exact arithmetic on the assumption that spheres tile space. They do not, and the correction is pinned on both sides by constants: a plain cubic grid anyone can build holds exactly 15,625,000 balls, and no arrangement whatever beats pi over root eighteen, which caps the count at 22.1 million. The answer is that interval, with a settled pour at 19.1 million sitting inside it.
The reflex answer is that nothing can be weighed without a scale, and it is wrong: an aircraft resting on inflated tyres is already standing on four scales, each with a dial on it. Pressure times contact patch gives 160,000 pounds, but the deliverable is the interval from 115,200 to 211,200 together with the direction of the bias. A stiff sidewall carries part of the load, so the reading is a floor rather than a measurement.
The anchor is 45 squared, the shortfall is 1500, and one division by 900 lands on 1355/3 = 451.6667 against a true 451.66359. The estimate overshoots by exactly h squared over four a squared, which is 25/9 in the square here, so the error has a known sign as well as a known size. The article carries the bracket that names 452 as the nearest integer, one Newton step to nine figures, and what happens when the anchor is chosen too far away.
Going in and winning are different events: the short shot clears two hurdles and wins 0.35 of the time against the long shot's 0.40. The article prices how wrong the reflex is in two currencies, a break-even overtime rate of 4/7 and a break-even make rate of 80 percent at a coin-flip overtime. It also names the objective under which the reflex is right, since the short shot scores 1.40 expected points against 1.20 and still wins fewer games.
Four settlements in five come back below the 1.50 outlay, and the average payoff is still 1.80, an edge of 0.30 a contract or twenty percent of the money at risk. The reflex is not bad arithmetic, it is the mode standing in for the mean. The article carries the tally over one full cycle, the threshold saying you need the large outcome more often than one time in eight, and the reason waiting longer can leave you less likely to be ahead.
One chance in sixteen needs fifteen to one to break even, so a ten-to-one ticket is priced as though the calls came right nine times in a hundred rather than six and a quarter. The fair payout doubles and adds one with every leg, which is why multi-leg tickets run away from any quote a seller offers. The article carries the noise that hides the loss, 2.663 of spread against 0.3125 of edge, and the five-point edge per leg that would flip the verdict.
Sorting the list finds the gap and is merely wasteful, which is why the article says so rather than striking it out. The subtraction works because 5050 is a closed form available before the list is read, and the two conditions carrying it are distinctness and a known range. The article adds the duplicate-hunting mirror image, the sum-of-squares route when two values are absent, and the exclusive-or accumulator for when the total would overflow.
Twenty-four possible answers against 3^3 = 27 outcome sequences leaves just enough room, and four against four splits those answers into exactly 8, 8 and 8. Six against six always tips, so it wastes the level outcome and leaves twelve answers for nine remaining sequences, which makes halving impossible rather than merely slow. The counting argument bounds outcome sequences rather than strategies, so it rules out every adaptive continuation at once, and the explicit schedule closes the positive half.
The long hand turns 6 degrees a minute and the short one half a degree, so a 90 degree gap closes at 5.5 degrees a minute and the hands coincide 180/11 minutes past three, at 3:16:21.8181. At 3:15 the long hand has reached the 3 and the short hand is 7.5 degrees ahead of it, which is the whole content of the wrong answer. Consecutive coincidences are 720/11 minutes apart, so there are eleven per twelve hours and twenty-two per day, and the common phrasing "eleven times a day" is wrong by a factor of two.
With no air, v squared equals 2gD gives 89.4 metres per second and t equals root of 2D/g gives 8.94 seconds, both stable under g = 10 or g = 9.81. Dividing the height by the impact speed returns 4.47 seconds, wrong by exactly a factor of two at every drop height, because a body released from rest averages half its final speed. Real air reverses the picture: a coin-sized disc reaches terminal velocity near 11.9 metres per second and takes about 34.6 seconds, so nine seconds is a floor and 200 miles an hour a ceiling.
Running straight out from the centre loses, because a radius costs you 1 while half the fence costs the dog pi over 4. Inside a quarter of the radius your angular speed beats his, so you can orbit until he is diametrically opposite and then sprint three quarters of a radius against his pi over 4, and the whole escape reduces to 3 being less than pi with a margin of 0.0354 R. That two-phase plan works only up to a speed ratio of pi + 1, while the best known strategy for the problem reaches 4.60334.
Servings follow area and area follows the square of the width, so feeding eight instead of six multiplies the diameter by the square root of four thirds: exactly 8 root 3, or 13.8564 inches, about 15.5 percent wider. Sixteen inches carries 16/9 of the area and would feed 10.67 people, so the reflex over-orders by nearly three servings. Allowing a one inch bare crust moves the answer down to 13.55, because a wider pizza spends proportionally less of itself on edge.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Que queden dos puertas no significa que sean dos puertas iguales: tu primera elección quedó congelada en 1/3 y los otros 2/3 se acumularon en la única puerta aún cerrada. El número no habla de las puertas, habla del presentador. Deja que abra al azar, que enseñe la misma cabra, y cambiar solo vale 1/2.
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.
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.
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.
Una sola condición, una recurrencia de dos líneas, y la quinta potencia sale como un 123 limpio, sin radicales. Sube lo suficiente la misma escalera y el número áureo y los números de Lucas están escondidos debajo.