TOPICS
Search

Search Results for ""


301 - 310 of 1564 for Monotonic SequenceSearch Results
pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...
The plastic constant P, sometimes also called le nombre radiant, the minimal Pisot number, plastic number, plastic ratio, platin number, Siegel's number, or silver number, is ...
For s_1,s_2=+/-1, lim_(epsilon_1->0; epsilon_2->0)1/(x_1-is_1epsilon_1)1/(x_2-is_2epsilon_2) =[PV(1/(x_1))+ipis_1delta(x_1)][PV(1/(x_2))+ipis_2delta(x_2)] ...
In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...
The word "spectrum" confusingly has a number of unrelated meanings in various branches of mathematics.
A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...
The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...
The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...
A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...
Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...
1 ... 28|29|30|31|32|33|34 ... 157 Previous Next

...