Bsrgvty

It's helpful to think of each quadratic polynomial as corresponding to a point in "coefficient space", an abstract 3D space whose coordinates are $(a,b,c)$. The question "What fraction of quadratic polynomials have no $x$-intercept?" can then be rephrased as "What fraction of coefficient space lies in the region $b^2 < 4 a c$?"

The problem is, of course, that this "coefficient space" has an infinite volume: $a$, $b$, or $c$ can be arbitrarily large. What's more, the region of coefficient space corresponding to polynomials without intercepts is also infinitely large: for any polynomial without an $x$-intercept, you can multiply it by any real number and get another polynomial without an $x$-intercept. And if mathematics has taught us anything, it's that if we try to divide ∞ by ∞ we cannot expect a meaningful result.

You can, however, place bounds on the values of $a$, $b$, and $c$, so that these volumes of "coefficient space" are finite. In your code, you picked the quantities $(a, b, c)$ with uniform probability from the range $(-10^5, 10^5)$. This corresponds to the region of coefficient space below:

Mathematica (which I used to make this plot), tells me that the fraction of this cube that is filled is
$$
frac31 - 6 ln 272 = 0.3727932905... neq frac38.
$$
So the ratio you found "experimentally" is not actually equal to 3/8, but it's pretty close.

On the other hand, you could have also decided to pick all your coefficients such that $a^2 + b^2 + c^2 < (10^5)^2$. This would correspond to allowing $a$, $b$, and $c$ to lie in some spherical region of "coefficient space". Spheres are nice, right? Everybody likes spheres.

The fraction of this region out of the allowed spherical volume in coefficient space is (again, relying on Mathematica) is only about 0.3514..., noticeably less than 3/8. The region of coefficients you allow, and how you parametrize them, turns out to make a difference in what your final answer is (which is what some of the other answers are trying to point out.)

There are infinitely many quadratics, so the number you get in the end is completely up to how "sample" from the set of all possible curves. For example, if you sample $ain[1,2]$, and $cin[-2, -1]$, then all the curves will have a real intercept. On the other hand, if $a,cin [1,2]$ and $bin[-1,1]$, then none of the curves will have a real intercept.

Edit:

Now that you said that $a,b,c$ are all uniformly distributed on $[-n, n]$, your problem translates to this:

• Each selection of $(a,b,c)$ is one point in the cube $C=(-n, n)times(-n, n)times(-n,n)$.


• Each selection is equally likely.


• Therefore, you are really asking about the volume of the set $ b^2-4ac geq 0$. Once you get that volume, the ration of that volume to the volume of $C$ is what you need.

Assume $a$,$b$,$c$ are independent and uniform in $(-n,n)$. Denote the probability that the quadratic has no $x$-intercept by $p = P[b^2 < 4ac]$.
Since $b^2 < 4ac$ can only be true when $ac > 0$, which happens in $4$ of the $8$ possible sign assignments on $a,b,c$, and otherwise the condition is symmetric with respect to signs,
we have
beginalign
p
&= frac12 P[b^2 < 4ac mid a,b,c > 0] \
&= frac12 P[(b/n)^2 < 4(a/n)(c/n) mid a,b,c > 0] \
&= frac12 P[y^2 < 4xz]
endalign
where $x,y,z$ are independent and uniform in $(0,1)$. In particular, $p$ does not depend on $n$.
The last probability is given by the integral
$$
int_0^1 int_0^1 int_0^min2sqrtxz,1 1 ; dy ; dz ; dx
= frac3136 - fracln 26 approx 0.745587
$$
(Wolfram Alpha). Hence
$$
p = frac3172 - fracln 212 approx 0.372793,
$$
very close to the conjectured $0.375$.

While other answers have pointed out the problem of defining a random quadratic, I will argue that there are, indeed, rather interesting measures on the quadratics.

Let $ax^2+bx+c=0$ be the equation of a parabola. Il we multiply all the coefficients by some constant, we get e.g.

$$10ax^2+10bx+10c=0,$$

which is another equation of the same curve. Hence, instead of taking for $(a,b,c)$ general real numbers, we can normalize, for instance by adding the constraint $a^2+b^2+c^2 = 1$. Then $(a,b,c)$ lie on a sphere, on which there is a natural probability measure: the uniform measure. The simplest way to simulate this setting is to take for $a$, $b$ and $c$ three independent standard Gaussians; then $(a,b,c)/ |a^2+b^2+c^2|$ is uniform on the unit sphere.

Note that (as per Leftaroundabout's comment) this is just one possible normalization, and thus one possible measure on quadratics, called Kac's random polynomial. There are other reasonable measures. However, this one in particular gives rise to some interesting and not too difficult pieces of mathematics.

Anyway, whichever normalization you choose, this highlights a feature of this problem which is not very visible in Michael Seifert's answer: the quadratics having no $x$-intercept are exactly those whose coefficients satisfy $b^2-4ac<0$, which is, in parameter space, the equation of a filled cone (try to plot it on Mathematica and to move the object around). The point of view above interprets "the proportion of quadrics having no $x$-intercept" as "the proportion of directions in parameter space corresponding to quadrics having no $x$-intercept", or equivalently "the proportion of quadratics with $a^2+b^2+c^2 leq 1$ having no $x$-intercept".

Under this setting, and if I'm not mistaken, a quick computation gives me that the probability of having no $x$-intersect is:

$$1-frac12piint_mathbbR fracsqrtt^4+4t^2+1t^4+t^2+1 dt simeq 0,351.$$

Reference : How many zeroes of a random polynomial are real?, A. Edelman and E. Kostlan, Bulletin of the AMS, Vol. 32, n.1, January 1995. Available on arXiv: https://arxiv.org/pdf/math/9501224.pdf

The formula above is due to Kac (1943). I will let somebody else try to find a closed form, as there are poeple here much better than me at identifying and computing integrals.

Since you used a computer, $a, b, c$ must have been in a restricted range. Try altering that range and see how it affects your answer. Even if you have a super computer with an enormous but still finite range of numbers, it will still tell you nothing about the case for all numbers.

Even a dream computer without limits would have a problem as you cannot pick evenly from an infinite set.

Consider a simpler problem: what proportion of positive integers have a digit $9$ in them? The super naive answer is $10%$ but even going as far as $100$ gives the larger answer $19%$. Now go to $1000$, $10000$, etc and you will find that the answer continues to grow. It is easy enough to prove that it grows without limit and approaches $100%$. So, in a sense, $100%$ of positive integers have a digit $9$.

Other answers have done a good job at showing this mathematically, but I feel that a bit of visual explanation would help to solidify exactly why there is a difference in these two answers of $1/2$ and ~$3/8$.

Below, I have made a graph of all quadratic equations of the form $a(x-b)^2 +c$, for every combination of $a$, $b$ and $c$ in the closed interval $[-4,4]$, with a step size of $0.5$. The exact numbers are not relevant to this answer (though it is relevant to say that the x-scale and y-scale are equal, and both are linear).

For each parabola, I've only plotted a small section near the vertex. The line of each is colored according to how many x-intercepts it has: 0 is red, 1 is grey, and 2 is blue.

A visual inspection reveals that there is roughly an equal number of red and blue parabolas, and both vastly outnumber the grey ones. The exact counts in this graph are:

$$
beginmatrix
colorbluetextTwo & 2448 & 0.4982699 \
colorgraytextOne & 289 & 0.05882353 \
colorredtextZero & 2176 & 0.4429066 \
endmatrix
$$

Now, let's look at the same search space, but using the form $ax^2 +bx+c$. The graph looks quite different:

Again the grey are outnumbered, but we see vastly more blue than red. The exact numbers here are:

$$
beginmatrix
colorbluetextTwo & 3104 & 0.6317932 \
colorgraytextOne & 65 & 0.0132302055 \
colorredtextZero & 1744 & 0.3549766 \
endmatrix
$$

As we can see, the 'wings' of this graph are exclusively blue, meaning that all such parabolas have two intercepts. This is what skews the result away from $1/2$.

For those interested, the language I used to generate these images was Processing, and the code may be found here: https://pastebin.com/geLya3jQ. (Why? Mostly because I don't have much experience with Mathematica, etc.)

We need the probability that $b^2 < 4ac$. When $a$ and $c$ have opposite signs this condition is never satified; this occurs in 4 of the 8 octants of the problem domain. So we need only look at the other 4 octants. These are all related by symmetry, so we can choose one representative. Here we'll choose the octant $a in [0,n], b in [0,n], c in [0,n]$. The relevant volume of the domain is given by

$$V = int_a=0^n int_c=0^n int_b=0^2sqrtac ,db ,dc ,da $$

Carrying out the integration

$$V = int_a=0^n int_c=0^n 2sqrtac ,dc ,da $$

$$V = int_a=0^n frac43 sqrta n^3/2 ,da $$

$$V = frac89 n^3/2 n^3/2 $$

This is the volume of one octant; the volume for the 4 octants is then

$$V = frac329 n^3 $$

The volume of the entire domain is $(2n)^3 = 8n^3$

Then the probability of having no x-intercept is

$$p=fracfrac329 n^38n^3 = frac49 $$

Note that the probability is independent of $n$.