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 152 for eros NEARSearch Results
A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...
The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...
A near noble number is a real number 0<nu<1 whose continued fraction is periodic, and the periodic sequence of terms is composed of a string of p-1 1s followed by an integer ...
Call a number of the form n^2-k a "near-square number." Numbers of the form n^2-5 for n=1, 2, ... are -4, -1, 4, 11, 20, 31, 44, 59, 76, 95, ... (OEIS A028875). These are ...
An arrangement of n>=3 points such that n-1 of them are collinear.
SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...
A mathematical property P holds locally if P is true near every point. In many different areas of mathematics, this notion is very useful. For instance, the sphere, and more ...
A limiting value of a holonomic function near a singular point. Holonomic constants include Apéry's constant, Catalan's constant, Pólya's random walk constants for d>2, and ...
An extremum is a maximum or minimum. An extremum may be local (a.k.a. a relative extremum; an extremum in a given region which is not the overall maximum or minimum) or ...
A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...
1|2|3|4 ... 16

...