10 ms·
What Is the Most Surprising Result in Mathematics?
- ramblerman 13y ago"Closed as too localized" I have an ever growing contempt for over-eager stack overflow editors.
- josephagoss 13y agoI agree, every single interesting and fascinating question on stack exchange sites seems to have been closed for some reason or another. This overzealous closing of anything slightly outside the box is really tiresome.
- insteadof 13y agoAnything outside the box belongs on another site. They have a format that works for them and rules to follow. We're not being forced to use only Stack Exchange sites for our non-HN posts.
- nbouscal 13y agoThis was closed over a year after the question was asked, because it already had ~100 answers and they wanted to avoid being spammed with more answers. "Too localized" was just the closest reason they could find to close it with. Seems pretty reasonable.
- mjn 13y agoThis one seems reasonable to me; it's a blog or mailing list discussion topic, not really a specific mathematics question. Although phrased as a question, it's obviously a rhetorical one; what the asker really means is, "I would like to start a discussion in which everyone lists their favorite examples of surprising mathematics results". It's a fine discussion to have, but StackOverflow wants their site to be about actual questions, not "what's your favorite X" type discussions, which seems like a legitimate preference.
- bjterry 13y agoI found this post to be an interesting description of Banach-Tarski, if anyone is as confused as I was: http://scientopia.org/blogs/goodmath/2012/01/06/the-banach-tarski-non-paradox/ http://scientopia.org/blogs/goodmath/2012/01/06/the-banach-t...
- hypersoar 13y agoIn a class I took once, the professor presented a theorem he was going to prove (I think it was "surface groups are subgroup separable"). He told us "the story goes that when the great mathematician, Serre, heard about this theorem, he was so surprised he dropped his fork". Edit: fixed quotation marks
- StavrosK 13y agoI was going to throw a fit about that unmatched quote, but the second one canceled it out, phew.
- SeanDav 13y agoAs a non mathematician the most surprising for me is that 1 is not a prime number. It still feels like a kludge because it produces inconvenient results to have 1 a prime - so let's just exclude it.
- wl 13y agoOne has properties that are significantly different than the primes. Doesn't it make sense that if it behaves differently than the primes that it isn't a prime, but something else?
- gizmo686 13y agoOne also has the properties that are iconic of primes: its only factors are one and itself. We went out of are way to exclude it, by using a less natural definition of prime numbers, because of how often we would have to say primes greater than 1.
- btilly 13y agoActually mathematicians have gone back and forth on whether 1 should be considered a prime number.
- omra 13y agoNo notable mathematician has considered one prime since the early 20th century (of course, I'm oversimplifying, see [1] for more information). [1]: https://cs.uwaterloo.ca/journals/JIS/VOL15/Caldwell1/cald5.html https://cs.uwaterloo.ca/journals/JIS/VOL15/Caldwell1/cald5.h...
- btilly 13y agoYou are oversimplifying more than you know. In a number theory course around 1990, I remember reading papers from the 60s which would explicitly note whether the counts of primes that they were using were starting from 1 or 2. You can define them as not notable mathematicians, but working mathematicians in number theory still had not completely standardized 50 years ago. Now for more fun, sit down with a group of mathematicians and ask whether they consider 0 to be a natural number. :-) (The answer you get will vary by field. But none will consider it a particularly important question.)
- lisper 13y agoi (the square root of -1) raised to the i'th power is a real number (it's e^(-pi/2))
- raverbashing 13y agoFor me: - The Gauss theorem still looks weird to me, that the shape doesn't matter, all it matters is what's contained inside (http://en.wikipedia.org/wiki/Divergence_theorem http://en.wikipedia.org/wiki/Divergence_theorem) - The Carmichael function (which is a generalization of Euler's theorem which is a generalization of Fermat's little theorem) http://en.wikipedia.org/wiki/Carmichael_function http://en.wikipedia.org/wiki/Carmichael_function
- btilly 13y agoMy answer would be that there are existence proofs for things that we cannot produce examples of. (There are actually many such proofs, but at some point I stopped being shocked.) And furthermore there exist existence proofs for classes of things, at least some of the examples of which we can NEVER verify without adding new axioms to our axiom system! Let me give a concrete example. A minor of a graph is any graph that you can get from the first by deleting points, deleting edges, or contracting points and joining edges. See https://en.wikipedia.org/wiki/Robertson%E2%80%93Seymour_theorem https://en.wikipedia.org/wiki/Robertson%E2%80%93Seymour_theo... for a theorem which says that any family of graphs that is closed under taking minors (ie if G is in the family, then every minor of G is as well) can be characterized by a finite set of forbidden minors. Any graph without a minor in the forbidden set, is in the family. The best known example of such a family is planar graphs. Those are graphs that you can draw in the plane without crossings. The forbidden minors are K_5 (5 points, all connected to each other) and K_3_3 (2 groups of 3 points, every point in each group connects to the every point in the other). Any graph without either of those as minors, is planar. So, given any family of graphs that is closed under taking minors, we must have a concrete set of forbidden minors. Furthermore it turns out that given a finite set of forbidden minors, we can use them create a polynomial-time algorithm for recognizing whether a given graph is in the family. Here is where it gets strange. Given a family of graphs, we do not have a procedure to produce the forbidden minors. Such a procedure would be wonderful - it would let us do interesting things like solve the Halting problem! That is, of course, an impossible thing to do. This proves that there is, in fact, no such procedure. So we have proved existence of finite, concrete lists, yet proved that in general it is impossible to construct said lists. It gets worse. There are many interesting families of graphs which are closed under minors, many of which we do not have any decision procedure for at all! (For example graphs embeddable in 3-dimensions without anywhere embedding a knot.) So we've proven the existence of finite answers to concrete mathematical problems. Yet cannot produce those answers. In general we can NEVER produce those answers. Yet we know that they exist. Now for the philosophy question: in what sense do those unfindable, unverifiable answers actually exist?
- acchow 13y ago> Now for the philosophy question: in what sense do those unfindable, unverifiable answers actually exist? I don't really see anything philosophically interesting here. Such a feeling probably arises from a misinterpretation of the halting problem here: > it would let us do interesting things like solve the Halting problem! That is, of course, an impossible thing to do. This proves that there is, in fact, no such procedure. No such procedure to do it generally.
- bitL 13y agoMaterial implication and the fact that logic based on it is considered OK. E.g. "if the moon was made of cheese, then P=NP" is considered true. This would have been funny if this kind of proofs wasn't used in proofs of basic facts of set theory, e.g. the theorem about empty set being a subset of any set. I am glad there are people trying to address these issues with a new logic, such as relevance logic, though almost every mathematician I know is fully reconciled with the former type of logic without questioning it.
- scotty79 13y agop => q sort of means, if you assume p, you can get q by flawless reasoning. It is actually true that when you assume someting false you can get from it to any conclusion by correct reasoning. The path between cheese moon and P=NP might be hard to imagine but it probably leads through 1=0 somewhere and you have o properly define what you mean by moon, cheese, and made of.
- lotharbot 13y agoMy favorite surprising result in mathematics is that you can create chaos in the mathematical sense [1] with a bi-infinite binary sequence and the bitshift operation. Essentially, "multiplying by two" is chaotic in the right circumstances. The technical description can be found starting at page 567 of [0], though the Google Books preview has some important pages missing. [0] Stephen Wiggins - Introduction to Applied Nonlinear Dynamical Systems and Chaos http://books.google.com/books?id=GYcOfuZDOKMC&lpg=PA565&ots=bF12jI5K8_&dq=bi-infinite%20sequence%20chaos&pg=PA567#v=onepage&q=bi-infinite%20sequence%20chaos&f=false http://books.google.com/books?id=GYcOfuZDOKMC&lpg=PA565&ots=... [1] The key attributes of chaos are described in http://en.wikipedia.org/wiki/Chaos_theory#Chaotic_dynamics http://en.wikipedia.org/wiki/Chaos_theory#Chaotic_dynamics
- dmvaldman 13y agomultiplying by two, and adding I presume. makes sense. to give some related knowledge, all matrices can be decomposed into direct sums of shifts and scales. this is the base of the jordan normal form [1]. infinite matrices can certainly encapsulate chaos. [1] http://en.wikipedia.org/wiki/Jordan_normal_form http://en.wikipedia.org/wiki/Jordan_normal_form
- lotharbot 13y agoThere's actually no adding. Just multiplying by two. That's what makes the result so surprising. The key is the metric on the bi-infinite sequence space. Differing in the digit closest to the decimal point on either side gives a distance of 1/2, differing one digit further out is 1/4, then 1/8, 1/16, and so on (the total distance is the sum; the maximum distance between two sequences is 2 if they differ in every digit.) So two sequences are "close" to one another if their middle digits are all the same. This gives you the key attributes of chaos: (1) Sensitive Dependence on Initial Conditions. Two sequences can be identical for BIG_NUM digits on each side of the decimal point, and then completely different outside of that area. This means their initial distance apart is roughly 1/2^BIG_NUM. But after BIG_NUM multiply-by-two operations, the trajectories have diverged to a distance of around 2. (2) Topological Mixing. A similar construction to above -- select the first N digits of a sequence to make it fall into a particular neighborhood, and the next M digits to make it fall into a different neighborhood after the appropriate number of bitshifts. This can be done for any pair of neighborhoods. (3) Density of periodic orbits. Pick any point X in the space, and a distance epsilon. Construct a periodic orbit that gets within epsilon of X simply by taking the central digits of X (using log_2(epsilon) to select how many digits) and repeating those digits. There you have it -- chaos as a result of a single bitshift operation on bi-infinite sequences, with no addition or other operations.
- ctdonath 13y agoMy 3 favorites: 2^(2^(2^...-1)-1)-1 seems prime for all nestings, but the numbers get enormous fast John Conway's "surreal numbers" create all math from an empty set Fractals ('nuf said)
- gizmo686 13y ago>2^(2^(2^...-1)-1)-1 seems prime for all nestings, but the numbers get enormous fast Can you explain this. I read your expression (with infinite nesting) as x=2^(x-1), whose solutions are 1 and 2. Looking at it as a series, I see: 2-1=1 2^(2-1)-1=1 2^(2^(2-1)-1)-1=1 2^(2^(2^...-1)-1)-1=1 Also, assuming that a sequence does have the properties you describe (always prime, and gets large very fast), it seems like that sequence would either have to be hard to compute, or unknown to all of the mathematicians working on finding large primes.
- crygin 13y agoThe issue is that we have no proof that they are primes in general, and they become large so quickly that verifying their primehood is (currently) impossible.
- gizmo686 13y agoFair enough, but the way I am reading your sequence still looks like it is all ones.
- anonymous 13y agoThe issue gizmo and I see with the sequence is that it is all ones if the first element is 2 - 1 = 1. Are you supposed to start with 2^2 - 1 = 3; then 2^3 - 1 = 7; 2^7 - 1 = 127; etc? Those do seem to be all prime.
- ErsatzVerkehr 13y agoMersenne primes whose exponents are themselves Mersenne primes.
- banachtarski 13y ago100% agreed on the bit about holomorphic functions. Once I forget the derivation, the result surprises me all over again.
- kriro 13y agoNot really a result, more of a discovery but the Mandelbrot set still amazes me to this day :) Not really mathematics but close enough: The fact that a Rule 110 cellular automaton is Turing complete really fascinates me as well.
- mpyne 13y agoThe Mandelbrot set was what introduced me to programming as an adolescent. :)
- mjn 13y agoGödel's incompleteness theorems came as something of an unwelcome surprise to those who, at the time, were hoping to put David Hilbert's program into practice.
- scoot 13y agoFor me, the fact that 0.999... = 1, not least because the elementary proofs are easy enough for even me to understand! http://en.wikipedia.org/wiki/0.999.. http://en.wikipedia.org/wiki/0.999...
- jgreen10 13y agoI always think that's just a bug in / the inelegance of the "..." notation.
- e3pi 13y agoPoised inert(0) being mathematically ameliorated with those processes constant including Fourier's common denominator assuaging all cycles of all myriad things, and of at most a single exceptionally egregious serious error, genteel aplomb in action, while abruptly hazarding the whole ball of wax, London gentleman's Reform Club wagerer closed contour circumnavigates eastward around a steaming Victorian Whitechapel® worshipful churchwarden's lit'l chimney("Caminetto") simmering essential singularity, where right of state police Scotland Yard's criminal suspicion and under-cover investigation of Philius Fogg's first err'd then favorite and NOT his discovered saving redemption, rather obsequious servant/valet Passepartout's essential human artifice required singularity: the International Date Line, is not only imaginary(2): 2pie^(pi/2e^(pi/2e^(pi/2...und zu weiter...e^(pi/2i))) and within an epsilon neighborhood of NOT the author's, and NOT of his contemporaneous Cauchy's and Fourier's Prime Meridian, but its primary protagonist's Observatory Greenwich. By Capt J Luc Picard's Bigger Theorem: if an entire holomorphic process has an essential singularity at w, then within any open set epsilon neighborhood containing lit'l rill w, takes on all possible values, with at most a single exception, infinitely often- the necessary pathological(1) attending entropic heat, ignorance, indifference and state sanctioned `algebraically' indiscriminate `transcendent' stupidity among all possible colliding events abruptly attenuates to less than epsilon by the renormalization resonance of Philius' corporeal holotropism of the weighed measure of all possible events and Fourier's common denominator being identical with the simultaneity in the conservation of the contour integral's representation of both signal and noise of all possible events' -all coincident and of arbitrary duration- their unstable equilibrium catalyzes over and precipitates the synch jaunt with nicely holomorphic Philius' lit'l rill flywheel into actually winning the bet, Fogg fists repugnant Fix's despicable state-sanctioned stupid and recklessly endangering souless `algebraic' orthotropic tyranny into a bloody nose, and gets the real girl, and really conformally reforms into the really really rich. (0) `Lazy' -parsed, inert Inertia: Inertia does not contain within itself the slightest suggestion of a regular rising and falling of the contents of life; it offers itself at every movement with the same freshness and efficiency; by its far reaching effects and by reducing things to one and the same standard value, that is by leveling out countless fluctuations, mutual alterations of distances and proximity of oscillations and equilibrium, it levels out what would otherwise impose far-reaching change upon the possibilities for the individual's activities and experiences. Inertia is a real object as well as the integration of all objects. However its pure notion may be, inertia appears as the warm spring of life, flows into the schemata of all things, allowing them to blossom and unfold their very essence, no matter how diverse or antagonistic. Inertia tends towards a point at which, as a pure symbol, it completely absorbs all exchange and measurement, all static constants and dynamic processes. It is the facilitator creating contact with one another. Know such unique qualities of inertia, for the development of the rhythmical and specific objective styles of life, because the incomparable depth of their opposition illustrates the remarkable actuality of unique inertia being all their common factor. Inertia is the only scalar-independent intrinsic reference and so the ONLY absolute frame of reference from the absolute constant speed of light, as well anything else's inertia, anything else's matter for that matter. The perception which is in more agreement to natural law, is not only in agreement with reality but is reality. Natural law perception of reality, but so too also perceptive -is sentient- being reality. In their realm the feelings that inertia excites possess a psychological similarity with this. In so far as inertia becomes the absolutely commensurate expression and equivalent of all values that arise to abstract heights way above the whole broad diversity of objects; it becomes the center in which the most opposed, the most estrange, and the most separable of things find their common denominator. (1) Le tour du monde en quatre-vingts jours was written during difficult times, both for France and for Verne. It was during the Franco-Prussian War (1870-1871) in which Verne was conscripted as a coastguard, the French army losing every single campaign to the newly united German/Prussian Hohenzollern ubermenchen blot und stahl; and Jules was having money difficulties (his previous works were not paid royalties), his father had died recently, and he had witnessed a shockingly horrible state-ordered public execution which had markedly damaged him. Ingnorant of those qualities transcendental, you will suffer those chaotic consequences algebraic." (2) "Imagination is the one weapon in the war against orthotrope reality". -- Jules de Gaul, linux fortuna
- ColinWright 13y agoHere are some I like: * Bi-color the edges of a (countably) infinite complete graph. There is a mono-chromatic (countably) infinite complete induced sub-graph. * Between any two rationals there are uncountably many irrationals, and between any two irrationals there are only countably many rationals. * There is an extension of Lesbesgue measure on R^2 that is isometry invariant, finitely additive, and defined for all subsets. (This can't be extended to R^3 - that's the real point of Banach-Tarksi) * There is a 3D object with infinite surface area but finite volume. You can't paint the surface, but you can fill it with paint, then empty it out. * The 3D version of the Jordan–Schönflies Theorem (an "obvious" strengthening of the Jordan Curve Theorem) is wrong. And just for fun: * 2=4 (See http://www.solipsys.co.uk/new/TwoEqualsFour.html http://www.solipsys.co.uk/new/TwoEqualsFour.html) (Added in edit: I suspect this will shortly fall foul of PG's auto-detection of flame wars - it has many more comments than points)
- evilduck 13y agoNot a mathematician, but "uncountably many" sounds like a loaded phrase unique to the field of mathematics. How does "uncountably many" differ from "infinitely many"? Are we not sure that it goes on forever or do we know that it's just an extremely large finite set?
- srl 13y agoThe natural numbers (1, 2, 3, etc.) are of course "infinite" - however, they are also "countable". (For any natural number you pick, if you count long enough, you'll eventually get to it.) That doesn't mean you'll ever have counted /all/ the natural numbers, but you can count to any arbitrary one. For contrast, the real numbers, although also infinite, are "uncountable" - any way you start counting, there are real numbers that you will /never/ reach.
- nairteashop 13y agoThis is indeed a "technical" term in math. Wolfram has a good definition for what a "countably" infinite set is: http://mathworld.wolfram.com/CountablyInfinite.html http://mathworld.wolfram.com/CountablyInfinite.html
- bluecalm 13y agoAnd of course SO police closed this very interesting topic killing many potential very interesting posts. That is despite people liking it, discussing it and upvoting it. I am sorry for this a bit off-topic comment but I really hope there will be more voices against this moronic policy.
- insteadof 13y agoThis discussion wasn't even on Stack Overflow. On top of that it's been closed since 2011 and nobody saw it fit to be re-opened. Not to mention having 100+ answers. How that's constructive is a wild guess. But at least it's made some smile or catch them offguard.
- rtpg 13y agoIf you start making exceptions to rules then you're going to end up causing even more strife. I'm willing to pay the price to not get "what's the best programming language for X" style questions on SO (for example). On a related note, there's a blog post on the SO blog concerning closed questions, pretty interesting stuff.
- billforsternz 13y agoThe trouble is that the proportion of quality content that ends up getting closed for arbitrary, capricious, and downright infuriating reasons (just read the text of the "explanation" in this case) is enormous. Often when looking for answers on Stack Overflow I find all of the useful answers are closed. This makes no sense and reflects the stubborn attitudes of the decision makers there, nothing else.
- rtpg 13y agoout of curiosity,do you have an example of useful answers that are closed? I've found a lot of interesting answers that are closed, but not really "useful" in the SO sense: something that answers a specific question.
- 13y ago
- revskill 13y agoTo me, it's Euler formula: e^(iπ) + 1 = 0. It combines three most important constants of mathematics into one formula. Sweet !
- RBerenguel 13y agoMissed sphere eversion on the first pages of this list...
- gjm11 13y agoIt's the third highest voted answer. "The fact that you can turn a sphere inside out differentiably.", 52 points.
- RBerenguel 13y agoFourth, actually. Indeed, this eases my opinion :) Since I was reading diagonally I think my eye moved away to Cauchy's Integral Formula, since I have worked a little in the complex field. Thanks for pointing this out ;)
- tzs 13y agoI was surprised by the Khinchin–Lévy constant. For almost any real number, if you take the sequence of convergents of its continued fraction, $\frac{p_1}{q_1}$, $\frac{p_2}{q_2}$, ..., this is true: \[\lim_{n \to \infty}{q_n}^{1/n}=e^{\pi^2/(12\ln2)}\] The number on the right is called the Khinchin–Lévy constant. You can use MathJax to render the LaTeX in this comment with the bookmarklet available here: http://checkmyworking.com/misc/mathjax-bookmarklet/ http://checkmyworking.com/misc/mathjax-bookmarklet/
- jgreen10 13y agoe^(i*tau)=1 is definitely my favourite, but I don't really understand what x^i means.
- prezjordan 13y agoWrite out e^x as a power series, then just plug in ix instead of x :) Fun stuff happens.
- joe_the_user 13y agoI find Skolem's Paradox to be a remarkable thing. Uncountable sets are the foundation for a large portion of modern math but the sense in which they "really exist" is at least interesting. http://plato.stanford.edu/entries/paradox-skolem/ http://plato.stanford.edu/entries/paradox-skolem/
- gjm11 13y agoOne of my favourites, which isn't on the first page there (I didn't look beyond that) but contains three surprises, is Goodstein's theorem. It has the nice extra feature that it can be explained pretty simply, so here goes. When you write a number down in (say) base 10, what you're really doing is writing it as a sum of [small thing] x [power of 10]. So, e.g., 1234 means 1 x 10^3 + 2 x 10^2 + 3 x 10^1 + 4 x 10^0. "Small thing" means "non-negative integer, less than the base". And of course you can do this in bases other than 10. [EDIT: previous paragraph had a stupid mistake in it; thanks, grannyg00se, for catching it!] But when you do this, the exponents may be large numbers; in particular, they may be larger than the base. So consider the following operation, given a non-negative integer and a base: write the integer as a sum of [small] x [power of base], and then do the same thing to the exponents, and to the exponents in that, etc., until you've got rid of all the numbers >= the base. OK. Now here's a process you can carry out. Take a number. Write it "strongly in base 2" according to the procedure above. Now change all the 2s to 3s, generally making the number much much bigger. Now subtract 1. Now write it "strongly in base 3" again, change all the 3s to 4s, and subtract 1. And again: 4 -> 5, subtract 1. 5 -> 6, subtract 1. If you try this on some not-too-large number, you'll notice that the base-increasing operation typically increases the number hugely, whereas of course subtracting 1 decreases it just a little bit. So here's Goodstein's theorem: start with any number you like and carry out this process; eventually the numbers will stop increasing and you'll end up at 0. (Surprise #1: what a ridiculous idea! Obviously the numbers are increasing really really fast; how can they end up at zero?) It turns out that Goodstein's theorem is actually rather easy to prove, using a bit of machinery from set theory. There's a generalization of the natural numbers called the ordinals, and doing it properly requires some theorems about them, but here's the idea. Replace all the bases with "infinity". Assume some simple rules for comparing expressions full of infinities (e.g., if a<b then (anything finite) x infinity^a < infinity^b); then every time you subtract 1 and re-express your number "strongly in base b", the corresponding thing full of infinities decreases. And of course when you replace all the bases with infinity, the "increase the base by 1" operation does nothing. And now -- and this is the bit that actually needs some set theory -- it turns out that you can't have an infinite decreasing sequence of these things-full-of-infinities (they're "well-ordered"). Which means that eventually you have to end up at zero. (Surprise #2: this is, even when the details are filled in, a startlingly short proof for such a surprising theorem.) All that stuff involving infinities is a bit weird, though. Can't we find a nice proof that works entirely in terms of ordinary finite integers? Once you formalize what "works entirely in terms of ordinary finite integers" means, it turns out that the answer is no! Goodstein's theorem is not provable from the "Peano axioms" describing the natural numbers; you need something stronger to prove it. Such as, in this case, set theory. (Surprise #3: that something so innocuous requires such powerful mathematical machinery to resolve.)
- jperras 13y agoThis is from the realm of mathematical physics, but Noether's Theorem (http://en.wikipedia.org/wiki/Noether%27s_theorem http://en.wikipedia.org/wiki/Noether%27s_theorem) is quite possibly the most beautiful result that I can think of: Briefly, "Any differentiable symmetry of the action of a physical system has a corresponding conservation law". The extension of this theorem in QED, The Ward-Takahashi Identity, is also incredibly astounding, if a bit obtuse if you're not well versed in renormalizable field theories.
- ezequiel-garzon 13y agoThe Prime Number Theorem! The average spacing between primes under N tends to... ln(N). By the way, Gauss conjectured it at the tender age of 14...
- mhartl 13y agoThe divergence of the harmonic series (sum_{n=1}^∞ 1/n) is one of the most surprising elementary results.
- cobookman 13y agoI do enjoy Euler's formula's use in Electrical Engineering/DSP: http://en.wikipedia.org/wiki/Euler%27s_formula http://en.wikipedia.org/wiki/Euler%27s_formula One of the many applied uses would be the FFT, or calculating Electrical Impedance. There is also Green's Theorem: http://en.wikipedia.org/wiki/Green%27s_theorem http://en.wikipedia.org/wiki/Green%27s_theorem
- mathattack 13y agoI know Im missing the point, but this jumps out at me.... "closed as too localized by t.b., Zev Chonoles Sep 5 '11 at 22:18 This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question."