TOPICS

# Search Results for " function cleanQuery(html){ let doc = new DOMParser().parseFromString(html, 'text/html'); return doc.body.textContent || ""; } var params = new URLSearchParams(window.location.search); var queryValue; if(params.get('query') != null){ document.write(cleanQuery(params.get('query'))); document.title = cleanQuery(params.get('query'))+' - Wolfram Search'; queryValue = params.get('query'); } if(params.get('q') != null){ document.write(cleanQuery(params.get('q'))); document.title = cleanQuery(params.get('q'))+' - Wolfram Search'; queryValue = params.get('q'); } "

1 - 10 of 75 for serratura a cilindroSearch Results
A cadlag function is a function, defined on R or a subset of R, that is right continuous and has a left limit. The acronym cadlag comes from the French "continue à droite, ...
The game of nim appearing in Alain Resnais' film Last Year at Marienbad (L'année dernière à Marienbad, 1961). In Marienbad, two players alternately draw counters from one of ...
Also known as the Serret-Frenet formulas, these vector differential equations relate inherent properties of a parametrized curve. In matrix form, they can be written [T^.; ...
Abel's integral is the definite integral I = int_0^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (1) = 1/2int_(-infty)^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (2) = ...
Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...
If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...
65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...
Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...
Legendre's constant is the number 1.08366 in Legendre's guess at the prime number theorem pi(n)=n/(lnn-A(n)) with lim_(n->infty)A(n) approx 1.08366. Legendre first published ...
The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...
1|2|3|4 ... 8

...