Search Results for ""
1611 - 1620 of 2910 for Integer complexitySearch Results
The exponential factorial is defined by the recurrence relation a_n=n^(a_(n-1)), (1) where a_0=1. The first few terms are therefore a_1 = 1 (2) a_2 = 2^1=2 (3) a_3 = ...
The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...
The extouch triangle DeltaT_1T_2T_3 is the triangle formed by the points of tangency of a triangle DeltaA_1A_2A_3 with its excircles J_1, J_2, and J_3. The points T_1, T_2, ...
In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...
The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...
Let T_n(x) be an arbitrary trigonometric polynomial T_n(x)=1/2a_0+{sum_(k=1)^n[a_kcos(kx)+b_ksin(kx)]} (1) with real coefficients, let f be a function that is integrable over ...
The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...
The Fermat quotient for a number a and a prime base p is defined as q_p(a)=(a^(p-1)-1)/p. (1) If pab, then q_p(ab) = q_p(a)+q_p(b) (2) q_p(p+/-1) = ∓1 (3) (mod p), where the ...
In 1657, Fermat posed the problem of finding solutions to sigma(x^3)=y^2, and solutions to sigma(x^2)=y^3, where sigma(n) is the divisor function (Dickson 2005). The first ...
A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...
...
View search results from all Wolfram sites (340627 matches)

