Search Results for ""
1 - 10 of 63 for linguaggi di programmazione visualeSearch Results
Faà di Bruno's formula gives an explicit equation for the nth derivative of the composition f(g(t)). If f(t) and g(t) are functions for which all necessary derivatives are ...
Consider a Lucas sequence with P>0 and Q=+/-1. A Fibonacci pseudoprime is a composite number n such that V_n=P (mod n). There exist no even Fibonacci pseudoprimes with ...
The term "poweroid" has at least two meanings. Sheffer sequences are sometimes called poweroids (Steffensen 1941, Shiu 1982, Di Bucchianico and Loeb 2000). Jackway and ...
The division of two complex numbers can be accomplished by multiplying the numerator and denominator by the complex conjugate of the denominator, for example, with z_1=a+bi ...
A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...
Sparklines are word-like graphics that have an intensity of visual distinctions comparable to words or letters (Tufte 2006, p. 4).
A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...
Since |(a+ib)(c+id)| = |a+ib||c+di| (1) |(ac-bd)+i(bc+ad)| = sqrt(a^2+b^2)sqrt(c^2+d^2), (2) it follows that (a^2+b^2)(c^2+d^2) = (ac-bd)^2+(bc+ad)^2 (3) = e^2+f^2. (4) This ...
A proof that is only based on visual elements, without any comments. An arithmetic identity can be demonstrated by a picture showing a self-evident equality between numerical ...
A complex number may be taken to the power of another complex number. In particular, complex exponentiation satisfies (a+bi)^(c+di)=(a^2+b^2)^((c+id)/2)e^(i(c+id)arg(a+ib)), ...
...