X-Nico

unusual facts about Everybody's Problem


Everybody's Problem

He was set to break up the band and go to university himself before a practice with Russell Senior (violin, guitar, vocals) and Magnus Doyle (drums) led to the establishment of a new, more experimental, artier and noisier direction for Pulp.


Coupon collector's problem

Donald J. Newman and Lawrence Shepp found a generalization of the coupon collector's problem when m copies of each coupon needs to be collected.

Enrico Giusti

One of the most famous results of Giusti, is the one obtained with Enrico Bombieri and Ennio De Giorgi, concerning the minimality of Simons' cones, and allowing to disprove the validity of Bernstein's theorem in dimension larger than 8.

Galton's problem

Galton’s problem, named after Sir Francis Galton, is the problem of drawing inferences from cross-cultural data, due to the statistical phenomenon now called autocorrelation.

Magic 8-Ball

Using the Coupon collector's problem in probability theory, it can be shown that it takes, on average, 72 outcomes of the Magic 8 Ball for all 20 of its answers to appear at least once.

Motz's problem

In mathematics, Motz's problem is a problem which is widely employed as a benchmark for singularity problems to compare the effectiveness of numerical methods.

Napoleon's problem

Napoleon was known to be an amateur mathematician but it is not known if he either created or solved the problem.

Plateau's problem

To solve the extended problem, the theory of perimeters (De Giorgi) for codimension 1 and the theory of rectifiable currents (Federer and Fleming) for higher codimension have been developed.

R. K. Rubugunday

Raghunath Krishna Rubugunday (1918–2000) was an Indian mathematician specializing in number theory notable for his contribution to Waring's problem.

Štefan Znám

Štefan Znám (9 February 1936, Veľký Blh – 17 July 1993, Bratislava) was a Slovak- Hungarian mathematician, believed to be the first to ponder Znám's problem in modern times.

Stern prime

All the known Stern primes have more efficient Waring representations than their Goldbach representations would suggest.

Sums of powers

Waring's problem asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s kth powers of natural numbers.

Wieferich's theorem

The solution to Waring's problem for cubes, that every integer is the sum of at most 9 cubes


see also