Search Results for ""
821 - 830 of 2910 for Integer complexitySearch Results
An exponential generating function for the integer sequence a_0, a_1, ... is a function E(x) such that E(x) = sum_(k=0)^(infty)a_k(x^k)/(k!) (1) = ...
Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...
Let f be an integer polynomial. The f can be factored into a product of two polynomials of lower degree with rational coefficients iff it can be factored into a product of ...
A Heronian triangle is a triangle having rational side lengths and rational area. The triangles are so named because such triangles are related to Heron's formula ...
Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...
A sequence of positive integers {a_n} such that sum1/(a_nb_n) is irrational for all integer sequences {b_n}. Erdős showed that {2^(2^n)}={1,2,4,16,256,...} (OEIS A001146) is ...
The sequence composed of 1s and 2s obtained by starting with the number 1, and picking subsequent elements to avoid repeating the longest possible substring. The first few ...
An integer sequence given by the recurrence relation a(n)=a(a(n-2))+a(n-a(n-2)) with a(1)=a(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, ...
For a real number x, the mantissa is defined as the positive fractional part x-|_x_|=frac(x), where |_x_| denotes the floor function. For example, for x=3.14159, the mantissa ...
A Meeussen sequence is an increasing sequence of positive integers (m_1, m_2, ...) such that m_1=1, every nonnegative integer is the sum of a subset of the {m_i}, and each ...
...
View search results from all Wolfram sites (340627 matches)

