Search Results for ""
741 - 750 of 4110 for Whole numbers and IntegersSearch Results
The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...
A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...
The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...
A monoid that is commutative i.e., a monoid M such that for every two elements a and b in M, ab=ba. This means that commutative monoids are commutative, associative, and have ...
An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...
The Bolyai expansion of a real number x is a nested root of the form x=a_0-1+RadicalBox[{{a, _, 1}, +, RadicalBox[{{a, _, 2}, +, RadicalBox[{{a, _, 3}, +, ...}, m]}, m]}, m], ...
A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...
The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...
A pair of positive integers (a_1,a_2) such that the equations a_1+a_2x=sigma(a_1)=sigma(a_2)(x+1) (1) have a positive integer solution x, where sigma(n) is the divisor ...
Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).
...
View search results from all Wolfram sites (71114 matches)

