Find link

language:

Find link is a tool written by Edward Betts.

searching for Integer function 29 found (30 total)

Floor and ceiling functions (5,879 words) [view diff] no match in snippet view article find links to article

Floor and ceiling functions In mathematics, the floor function is the function that takes as input a real number x, and gives as output the greatest integer

Rounding (8,503 words) [view diff] no match in snippet view article find links to article

Rounding or rounding off means replacing a number with an approximate value that has a shorter, simpler, or more explicit representation. For example,

ALGOL W (747 words) [view diff] exact match in snippet view article find links to article

identifier has been declared as an integer function in the current scope then that is expanded to ⟨integer function identifier⟩. Type errors are grammatical

TI-57 (514 words) [view diff] exact match in snippet view article find links to article

register 0 03 85 = 04 35 yx yx 05 08 8 8 06 65 − − 07 49 2nd ) Int Integer function 08 85 = 09 32 0 STO 0 STO 0 Store result in register 0 10 55 x x 11

Gaussian brackets (1,462 words) [view diff] exact match in snippet view article find links to article

the widely prevalent use of square brackets to denote the greatest integer function: [ x ] {\displaystyle [x]} denotes the greatest integer less than or

Markov spectrum (935 words) [view diff] exact match in snippet view article find links to article

\infty }n^{2}\left|\xi -{\frac {m}{n}}\right|,} where m is chosen as an integer function of n to make the difference minimal. This is a function of ξ {\displaystyle

Rodion Kuzmin (449 words) [view diff] exact match in snippet view article find links to article

(where ‖ ⋅ ‖ {\displaystyle \Vert \cdot \Vert } denotes the Nearest integer function) on a finite interval I {\displaystyle I} , then ∑ n ∈ I e 2 π i f

Generalizations of Fibonacci numbers (4,746 words) [view diff] exact match in snippet view article find links to article

where ⌊ ⋅ ⌉ {\displaystyle \lfloor \cdot \rceil } denotes the nearest integer function and a ± = 19 ± 3 33 3 , b = 586 + 102 33 3 . {\displaystyle {\begin{aligned}a_{\pm

State complexity (3,375 words) [view diff] exact match in snippet view article find links to article

finite automata, the state complexity tradeoff between them is an integer function f {\displaystyle f} where f ( n ) {\displaystyle f(n)} is the least

Derangement (2,209 words) [view diff] exact match in snippet view article find links to article

n\geq 1,} where [ x ] {\displaystyle \left[x\right]} is the nearest integer function and ⌊ x ⌋ {\displaystyle \left\lfloor x\right\rfloor } is the floor

Binary moment diagram (819 words) [view diff] exact match in snippet view article find links to article

of all branches separately. An example of such decomposition for an integer function (2x + y) is: { if x { if y , 3 if ¬ y , 2 if ¬ x { if y , 1

Comparison sort (2,674 words) [view diff] exact match in snippet view article find links to article

lower bound are much like a real-valued function lower-bounding an integer function. However, this is not exactly correct when the average case is considered

Silverfrost FTN95 (941 words) [view diff] case mismatch in snippet view article find links to article

&') i=winio@('%^bt[PRESS]',func) END c---Function to do something--- INTEGER function func() func=1 END A full GUI interface with windows, menus, popup dialog

Beatty sequence (2,174 words) [view diff] exact match in snippet view article find links to article

theorem and shows that more general pairs of sequences defined from an integer function and its inverse have the same property of partitioning the integers

Glossary of mathematical symbols (9,797 words) [view diff] exact match in snippet view article find links to article

x\rceil } is the lowest integer that is not lesser than x. ⌊□⌉ Nearest integer function: if x is a real number, ⌊ x ⌉ {\displaystyle \lfloor x\rceil } is the

Fibonacci sequence (13,044 words) [view diff] exact match in snippet view article find links to article

{5}}}} . Therefore, it can be found by rounding, using the nearest integer function: F n = ⌊ φ n 5 ⌉ , n ≥ 0. {\displaystyle F_{n}=\left\lfloor {\frac

Periodic boundary conditions (2,539 words) [view diff] no match in snippet view article find links to article

effective particle distances can be calculated with the “nearest integer” function as shown above, here as C/C++ code: x_rsize = 1.0 / x_size; // compute

Guarded Command Language (1,434 words) [view diff] exact match in snippet view article find links to article

x+1 fi od This algorithm finds the value 1 ≤ y ≤ n for which a given integer function f is maximal. Not only the computation but also the final state is

Tower of Hanoi (7,124 words) [view diff] exact match in snippet view article find links to article

⌉ {\displaystyle \left\lfloor \cdot \right\rceil } is the nearest integer function. For example, in the UPenn CIS 194 course on Haskell, the first assignment

Chebyshev filter (12,075 words) [view diff] exact match in snippet view article find links to article

number of poles, the order of the filter. ceil[] is a round up to next integer function. Pass band cutoff attenuation for Chebyshev filters is usually the

Affine focal set (2,066 words) [view diff] exact match in snippet view article find links to article

k\leq [n/2]} , where [ − ] {\displaystyle [-]} denotes the greatest integer function, there will generically be (n − 2k)-pieces of the affine focal set

Name mangling (4,511 words) [view diff] exact match in snippet view article find links to article

with a distinct marker in between. For example: module m contains integer function five() five = 5 end function five end module m In this module, the

Lambek–Moser theorem (2,425 words) [view diff] exact match in snippet view article find links to article

the same properties. Instead, define a non-decreasing and unbounded integer function f ∗ {\displaystyle f^{*}} that is as close as possible to the inverse

Ternary conditional operator (6,384 words) [view diff] no match in snippet view article find links to article

IfThen(AValue: Boolean; const ATrue: Integer; const AFalse: Integer): Integer; function IfThen(AValue: Boolean; const ATrue: Int64; const AFalse: Int64):

Comparison of Pascal and C (6,299 words) [view diff] no match in snippet view article find links to article

need of address operator). function f(z: integer; var k: integer): integer; // function accepts two integers, one by value, one by reference Begin z:=1;

Elliptic filter (6,112 words) [view diff] exact match in snippet view article find links to article

number of poles, the order of the filter. ceil[] is a round up to next integer function. See Lutovac & et al. (2001, § 12.11, 13.14). Elliptic filters are

IBM 1130 (10,316 words) [view diff] exact match in snippet view article find links to article

instruction, the syntax of Fortran provides no way to write it. An integer function IOR can be defined, enabling logical OR to be part of a Fortran expression

Fully polynomial-time approximation scheme (5,027 words) [view diff] exact match in snippet view article find links to article

denote by fj(s,x) the j-th coordinate of f. This fj can be seen as an integer function in b+a variables. Suppose that every such fj is a polynomial with non-negative

Ordinal collapsing function (12,608 words) [view diff] exact match in snippet view article find links to article

( ε Ω + 1 ) {\displaystyle \psi (\varepsilon _{\Omega +1})} , the integer function f α ( n ) {\displaystyle f_{\alpha }(n)} which counts the number of