Search Results for ""
2471 - 2480 of 8910 for Inline 2Search Results
A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...
The upside-down capital delta symbol del , also called "nabla" used to denote the gradient and other vector derivatives. The following table summarizes the names and ...
The two-argument Ramanujan function is defined by phi(a,n) = 1+2sum_(k=1)^(n)1/((ak)^3-ak) (1) = 1-1/a(H_(-1/a)+H_(1/a)+2H_n-H_(n-1/a)-H_(n+1/a)). (2) The one-argument ...
The partial differential equation u_(xx)+(y^2)/(1-(y^2)/(c^2))u_(yy)+yu_y=0.
The Diophantine equation x^2+y^2+z^2=3xyz. The Markov numbers m are the union of the solutions (x,y,z) to this equation and are related to Lagrange numbers.
For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that a^((N-1)/2)=-1 (mod N), then N is prime. A prime of this form is known as a Proth prime.
The term quartoid is sometimes used to refer to a function on the form f(x,y)=((x^2+y^2)^2)/(a^3), i.e., a poweroid with alpha=4 (Jackway and Deriche 1996).
The magnitude (length) of a vector x=(x_1,x_2,...,x_n) is given by |x|=sqrt(x_1^2+x_2^2+...+x_n^2).
The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...
A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...
...
View search results from all Wolfram sites (469507 matches)

