TOPICS
Search

Search Results for ""


1551 - 1560 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...
A square with side lengths 1. The unit square usually means the one with coordinates (0, 0), (1, 0), (1, 1), (0, 1) in the real plane, or 0, 1, 1+i, and i in the complex ...
A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...
Let the two-dimensional cylinder function be defined by f(x,y)={1 for r<R; 0 for r>R. (1) Then the Radon transform is given by ...
The sequence of variates X_i with corresponding means mu_i obeys the strong law of large numbers if, to every pair epsilon,delta>0, there corresponds an N such that there is ...
While the pedal point, Cevian point, and even pedal-Cevian point are commonly used concepts in triangle geometry, there seems to be no established term to describe the ...
A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...
A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...
Given a set y=f(x) of n equations in n variables x_1, ..., x_n, written explicitly as y=[f_1(x); f_2(x); |; f_n(x)], (1) or more explicitly as {y_1=f_1(x_1,...,x_n); |; ...
F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.
1 ... 153|154|155|156|157|158|159 ... 937 Previous Next

...