Search results

Jump to: navigation, search
  • ...n be done in many ways, but the simplest is to show, that there exist some integer number which is both, even and odd. This number is called Number of Mizugad - I work with numbers all my life. I never saw an integer which is both odd and even.
    10 KB (1,794 words) - 07:02, 1 December 2018
  • ...ponentially) increases at large negative values of the argument, takes the integer value unity at zero, then decrease until its local minimum at its first zer for integer \(n>1\), where \(L_n=\,\)[[BesselJZero]]\([0,n]\) is \(n\)th zero of the [[
    13 KB (1,759 words) - 18:45, 30 July 2019
  • ...in range of holomorphism of function, but out of holomorphism of some its integer iteration. In this case, the number \(n\) of iteration is supposed to be integer.
    4 KB (630 words) - 18:44, 30 July 2019
  • and so on. Most of larger numbers have no single-character mames; the integer numbers are denoted using the [[positional numeral system]].
    5 KB (753 words) - 18:47, 30 July 2019
  • In this expression, number \(n\) of iterations has no need to be integer; the [[Mandelbrot polynomial]] can be iterated arbitrary (even complex) num
    2 KB (229 words) - 18:44, 30 July 2019
  • ==Integer and non-integer \(n\)== ...here was no regular way to evaluate iteration of exponential for any non–integer number \(n\) of iteration.
    7 KB (1,161 words) - 18:43, 30 July 2019
  • ...e square root above. However, for the application in evaluation of the non-integer iterate, it is convenient to keep the coefficient \(B\) positive, at least ==Non-integer iterate==
    13 KB (2,088 words) - 06:43, 20 July 2020
  • ...s \(A\) and \(B\) can be used in order to simplify the construction of non-integer iterates of the linear fraction. One of possible choices is ...)th iteration, id est, \(T^n\) is regular at this fixed point even at non-integer values of \(n\);
    5 KB (830 words) - 18:44, 30 July 2019
  • ...ook about evaluation of [[abelfunction]]s, [[superfunction]]s, and the non-integer [[iterate]]s of holomorphic functions. Non-integer iterates of holomorphic functions.<br>
    15 KB (2,166 words) - 20:33, 16 July 2023
  • ...With this representation, the number \(n\) of iteration has no need to be integer. As other holomophic functions, the linear function can be iterated even co
    2 KB (234 words) - 18:43, 30 July 2019
  • For integer \(m>0\) and \(|z|\gg 1\), function [[mori]]\((z)\) can be approximated with
    3 KB (456 words) - 18:44, 30 July 2019
  • For given complex number \(b\), called "base", and given integer number \(n\), called "number of Ackermann", function \(A_{b,n}(z)\) is call and, for integer values of base and argument, even earlier.
    10 KB (1,534 words) - 06:44, 20 July 2020
  • for non-negative even integer values of the argument, it represents the amplitude of the oscillator funct For non–negative integer values of the argument,
    6 KB (883 words) - 18:44, 30 July 2019
  • It is called [[Hermite number]]; originally, \(H_n\) is defined only for integer \(n\).
    6 KB (770 words) - 18:44, 30 July 2019
  • ...efers to the attempt to suggest a holomorphic function such that its non–integer iterate cannot be constructed as a holomorphic function. While the pretenti In this case, the number \(n\) of iterate has no need to be integer.
    7 KB (1,319 words) - 18:46, 30 July 2019
  • ...n for [[SuNem]], the asymptic can be written as follows. For some positive integer \(M\), let For some fixed integer \(M\!>\!0\),
    9 KB (1,441 words) - 18:45, 30 July 2019
  • ...value of argument. However, the number of these iterates has no need to be integer. In this expression, the umber \(n\) of iteration has no need to be [[integer]]; sin cam be iterated even complex number of times.
    5 KB (761 words) - 18:48, 30 July 2019
  • while \(m\) is integer parameter. Then, \(\ell\) is assumed to be non–negative integer number.
    3 KB (352 words) - 18:45, 30 July 2019
  • In applications, function Binomial is often used for positive integer values of the first argument and non–negative values of the second argume This property can be used for evaluation of Binomial for integer values of the arguments.
    3 KB (393 words) - 18:43, 30 July 2019
  • If \(N\!=\!2^n\) for some integer \(n\), then, there exist efficient numerical algorithms for evaluation of t Let \(N\) be large integer, integer power of 2.
    5 KB (721 words) - 18:44, 30 July 2019

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)