Searches , social queries for INTEGER FUNCTION
Search references for INTEGER FUNCTION. Phrases containing INTEGER FUNCTION
See searches and references containing INTEGER FUNCTION!
Search references for INTEGER FUNCTION. Phrases containing INTEGER FUNCTION
See searches and references containing INTEGER FUNCTION!INTEGER FUNCTION
Nearest integers from a number
and ceiling functions In mathematics, the floor function is the function that takes a real number x as input and returns the greatest integer less than
Floor_and_ceiling_functions
Topics referred to by the same term
Integer function may refer to: Integer-valued function, an integer function Floor function, sometimes referred as the integer function, INT Arithmetic
Integer_function
Replacing a number with a simpler value
especially when dividing two numbers in integer or fixed-point arithmetic; when computing mathematical functions such as square roots, logarithms, and sines;
Rounding
Extension of the factorial function
{\displaystyle \Gamma (n)=(n-1)!} for every positive integer n {\displaystyle n} . The gamma function can be defined via a convergent improper integral
Gamma_function
mathematics, an integer-valued function is a function whose values are integers. In other words, it is a function that assigns an integer to each member
Integer-valued_function
Family of solutions to related differential equations
is an integer or a half-integer. When α {\displaystyle \alpha } is an integer, the resulting Bessel functions are often called cylinder functions or cylindrical
Bessel_function
Quickly growing function
function (which had three non-negative integer arguments), many authors modified it to suit various purposes, so that today "the Ackermann function"
Ackermann_function
Function in mathematical number theory
the Carmichael function λ(n) of a positive integer n is the smallest positive integer m such that am≡1(modn) holds for every integer a coprime to n.
Carmichael_function
Mathematical optimization problem restricted to integers
are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints
Integer_programming
Arithmetic function related to the divisors of an integer
theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number
Divisor_function
Mapping arbitrary data to fixed-size values
(reinterpreted as an integer) as the hashed value. The cost of computing this identity hash function is effectively zero. This hash function is perfect, as
Hash_function
This is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to
List_of_integer_sequences
Method to solve optimization problems
bounded feasible integral objective function c, the optimal value of the linear program {maxcx∣x∈P} is an integer. Integral linear programs are of central
Linear_programming
Complex number whose mapping on a coordinate plane produces a triangular lattice
In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the
Eisenstein_integer
Number of partitions of an integer
partition function p(n) represents the number of possible partitions of a non-negative integer n. For instance, p(4) = 5 because the integer 4 has the
Partition function (number theory)
Partition_function_(number_theory)
Functions such that f(–x) equals f(x) or –f(x)
n is an odd integer. Even functions are those real functions whose graph is self-symmetric with respect to the y-axis, and odd functions are those whose
Even_and_odd_functions
Decomposition of an integer as a sum of positive integers
partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only
Integer_partition
Product of numbers from 1 to n
factorial function to a continuous function of complex numbers, except at the negative integers, the (offset) gamma function. Many other notable functions and
Factorial
Analytic function in mathematics
Riemann sphere the zeta function has an essential singularity. For sums involving the zeta function at integer and half-integer values, see rational zeta
Riemann_zeta_function
Degree of differentiability of a function or map
discontinuities. The smoothness, or differentiability class, is an integer k such that a function has all derivatives up to order k, and such that all of these
Smoothness
Function that can be written as a sum over prime factors
counting multiplicity, sometimes called sopfr(n), the potency of n or the integer logarithm of n (sequence A001414 in the OEIS). For example: a0(4) = 2 +
Additive_function
Number used for counting
are 0 (if included), 1, 2, 3, and so on. The terms positive integers, non-negative integers, whole numbers, and counting numbers are also used. The set
Natural_number
Integer that divides another integer
mathematics, a divisor of an integer n , {\displaystyle n,} also called a factor of n , {\displaystyle n,} is an integer m {\displaystyle m} that may
Divisor
Open problem on 3x+1 and x/2 functions
positive integer: If the number is even, divide it by two. If the number is odd, triple it and add one. In modular arithmetic notation, define the function f
Collatz_conjecture
the power of a positive integer. Constant function: polynomial of degree zero, graph is a horizontal straight line Linear function: First degree polynomial
List of mathematical functions
List_of_mathematical_functions
Natural number
powers of 4 (45 + 40). 1028 = 22 × 257. It is sum of totient function for first 58 integers. There are 1029 primes <= 213. 1031 is a prime number, a Sophie
1000_(number)
Number in {..., –2, –1, 0, 1, 2, ...}
a positive integer Complex integer Hyperinteger Integer complexity Integer lattice Integer part Integer sequence Integer-valued function Mathematical
Integer
Number without repeated prime factors
In mathematics, a square-free integer (or squarefree integer) is an integer that is divisible by no square number other than 1. That is, its prime factorization
Square-free_integer
Number-theoretical function
theory, the sum of squares function is an arithmetic function that gives the number of representations for a given positive integer n {\displaystyle n} as
Sum_of_squares_function
Rational number equal to an integer plus 1/2
oscillator occur at half-integers and thus its lowest energy is not zero. Although the factorial function is defined only for integer arguments, it can be
Half-integer
Mathematical constants
gamma function is an important special function in mathematics. Its particular values can be expressed in closed form for integer, half-integer, and some
Particular values of the gamma function
Particular_values_of_the_gamma_function
Multivalued function in mathematics
Building on Lambert's work, Leonhard Euler described the W function per se in 1783. For each integer k {\displaystyle k} there is one branch, denoted by W
Lambert_W_function
Online database of integer sequences
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching
On-Line Encyclopedia of Integer Sequences
On-Line_Encyclopedia_of_Integer_Sequences
Special mathematical function defined as sin(x)/x
normalized sinc function are the nonzero integer values of x. The function has also been called the cardinal sine or sine cardinal function The term "sinc"
Sinc_function
Association of one output to each input
recursive functions are partial functions from integers to integers that can be defined from constant functions, successor, and projection functions via the
Function_(mathematics)
Complicated set of real numbers
{m}{n}}\right|,} where m is chosen as an integer function of n to make the difference minimal. This is a function of ξ {\displaystyle \xi } , and the reciprocal
Markov_spectrum
Arithmetic operation
involving two numbers: the base, b, and the exponent, n. When n is a positive integer, exponentiation corresponds to repeated multiplication of the base: that
Exponentiation
Function on an integer n which is log(p) if n equals p^k and zero otherwise
Mangoldt function, denoted by Λ ( n ) {\displaystyle \Lambda (n)} , is defined as Λ ( n ) = { log p if n = p k for some prime p and integer k ≥ 1
Von_Mangoldt_function
Type of mathematical expression
addition, subtraction, multiplication and exponentiation to nonnegative integer powers, and has a finite number of terms. An example of a polynomial of
Polynomial
Root of a quadratic polynomial with a unit leading coefficient
theory, quadratic integers are a generalization of the usual integers to quadratic fields. A complex number is called a quadratic integer if it is a root
Quadratic_integer
Fast-growing function
function is a mathematical function defined by Harvey Friedman. It is defined by SSCG ( k ) {\displaystyle {\text{SSCG}}(k)} as the largest integer n
Friedman's_SSCG_function
Number of integers coprime to and less than n
_{e}(x)} . In number theory, Euler's totient function counts the positive integers up to a given integer n {\displaystyle n} that are relatively prime
Euler's_totient_function
Function whose domain is the positive integers
arithmetical, or number-theoretic function is generally any function whose domain is the set of positive integers and whose range is a subset of the
Arithmetic_function
Solution of a confluent hypergeometric equation
for integer b, it has the advantage that it can be extended to any integer b by continuity. Unlike Kummer's function which is an entire function of z
Confluent hypergeometric function
Confluent_hypergeometric_function
Integer
inside the function f, its inverse will yield an inverse image, or preimage, of that subset under the function. Exponentiation to negative integers can be
−1
Finite or infinite ordered list of elements
doubly infinite sequence. A function from ℤ the set of all integers, into a set, for example the sequence of all even integers (..., −4, −2, 0, 2, 4, 6,
Sequence
Computational operation
languages – C. ISO, IEC. 1990. sec. 7.5.6.4. The fmod function returns the value x - i * y, for some integer i such that, if y is nonzero, the result has the
Modulo
Data types supported by the C programming language
type, and also provides macros for true and false. _Bool functions similarly to a normal integer type, with one exception: any conversion to a _Bool gives
C_data_types
Mathematical function whose derivative exists
such a function allows one to obtain a function that is differentiable only a finite number of times, the finite number being any positive integer. Given
Differentiable_function
square brackets to denote the greatest integer function: [ x ] {\displaystyle [x]} denotes the greatest integer less than or equal to x {\displaystyle
Gaussian_brackets
Ordered list of whole numbers
In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula
Integer_sequence
On integer partitions from monotonic functions
the Lambek–Moser theorem. One part states any two non-decreasing integer functions that are inverse, in a certain sense, can be used to split the natural
Lambek–Moser_theorem
Natural number
813 = 3 × 271. It is a Blum integer. 814 = 2 × 11 × 37. It is a sphenic number, a nontotient, and a zero of Mertens function. There are 814 fixed hexahexes
800_(number)
Integers have unique prime factorizations
factorization theorem and prime factorization theorem, states that every integer greater than 1 is either prime or can be represented uniquely as a product
Fundamental theorem of arithmetic
Fundamental_theorem_of_arithmetic
Product of two distinct primes ≡ 3 (mod 4)
form 4t + 3, for some integer t. Integers of this form are referred to as Blum primes. This means that the factors of a Blum integer are Gaussian primes
Blum_integer
Natural number
It is an Achilles number. 393 = 3 × 131. It is a Blum integer and a zero of Mertens function. 394 = 2 × 197 = S5 It is a Schröder number, a nontotient
300_(number)
Function with a multiplicative scaling behaviour
degree of homogeneity, or simply the degree. That is, if k is an integer, a function f of n variables is homogeneous of degree k if f ( s x 1 , … , s
Homogeneous_function
Use of functions that call themselves
which computes the greatest common divisor of two integers, can be written recursively. Function definition: gcd ( x , y ) = { x if y = 0 gcd ( y ,
Recursion_(computer_science)
Problem in number theory on equal totients
number of integers less than and coprime to n {\displaystyle n} . It states that, for every n {\displaystyle n} there is at least one other integer m ≠ n
Carmichael's totient function conjecture
Carmichael's_totient_function_conjecture
lowest integer that is not lesser than x. ⌊□⌉ Nearest integer function: if x is a real number, ⌊ x ⌉ {\displaystyle \lfloor x\rceil } is the integer that
Glossary of mathematical symbols
Glossary_of_mathematical_symbols
Decomposition of a number into a product
decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater
Integer_factorization
Constants of the mathematical zeta function
It also includes derivatives and some series composed of the zeta function at integer arguments. The same equation in s {\displaystyle s} above also holds
Particular values of the Riemann zeta function
Particular_values_of_the_Riemann_zeta_function
Property of being an even or odd number
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is divisible by 2, and odd if it is not. For
Parity_(mathematics)
Natural number
59. It is a zero of Mertens function, a self number, and a Blum integer. 414 = 2 × 32 × 23. It is a zero of Mertens function, a nontotient, and a Harshad
400_(number)
Function used in computer cryptography
total number of bits of the inputs. Inverting this function requires finding the factors of a given integer N. The best factoring algorithms known run in O
One-way_function
Topics referred to by the same term
integrals int(S) means the interior of set S int() is the integer function, also known as the floor function, which rounds its argument down to the nearest lower
INT
Type of permutation of a set of elements
Dn=[n!e]=⌊n!e+12⌋for n≥1, where [x] is the nearest integer function and ⌊x⌋ is the floor function. Other related formulas include Dn=⌊n!+1e⌋for n≥1,Dn=⌊(e+e−1)n
Derangement
Natural number
Encyclopedia of Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A059377 (Jordan function J_4(n))". The On-Line Encyclopedia of Integer Sequences
600_(number)
Largest integer that divides given integers
of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest
Greatest_common_divisor
Datum of integral data type
computer science, an integer is a datum of integral data type, a data type that represents some range of mathematical integers. Integral data types may
Integer_(computer_science)
Non-cryptographic hash function
Fowler–Noll–Vo (or FNV) is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo. The basis of the FNV hash algorithm
Fowler–Noll–Vo_hash_function
Function used in signal processing
processing and statistics, a window function (also known as an apodization function or tapering function) is a mathematical function that is zero-valued outside
Window_function
Generalization of the mathematical factorial
factorial function appears prominently in many theorems in number theory. The following are a few of these theorems. For any positive integers m and n,
Bhargava_factorial
Complex number whose real and imaginary parts are both integers
number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and
Gaussian_integer
C function to format and output text
standard library function and is also a Linux terminal (shell) command that formats text and writes it to standard output. The function accepts a format
Printf
Algebra of formal sums
represent an element of a free abelian group is as a function from B {\displaystyle B} to the integers with finitely many nonzero values; for this functional
Free_abelian_group
Mathematical function
negligible function is a function μ : N → R {\displaystyle \mu :\mathbb {N} \to \mathbb {R} } such that for every positive integer c there exists an integer Nc
Negligible_function
Result of repeatedly applying a mathematical function
iterated function on a set X follows. Let X be a set and f: X → X be a function. Defining f n as the n-th iterate of f, where n is a non-negative integer, by:
Iterated_function
Two numbers without shared prime factors
number of integers coprime to a positive integer n, between 1 and n, is given by Euler's totient function, also known as Euler's phi function, φ(n). A
Coprime_integers
Amount left over after computation
when a function is approximated by a series expansion, where the error expression ("the rest") is referred to as the remainder term. Given an integer a and
Remainder
Set of rules defining correctly structured programs
interpreted according to use. For example, ⌊3.2 gives 3, the largest integer not above the argument, and 3⌊2 gives 2, the lower of the two arguments
APL_syntax_and_symbols
Computer arithmetic error
In computer programming, an integer overflow occurs when an arithmetic operation on integers attempts to create a numeric value that is outside of the
Integer_overflow
Mathematical concept
In mathematics, the inverse function of a function f (also called the inverse of f) is a function that undoes the operation of f. The inverse of f exists
Inverse_function
Special mathematical function
of positive integer order arise in the calculation of processes represented by higher-order Feynman diagrams. The polylogarithm function is equivalent
Polylogarithm
Greatest integer less than or equal to square root
number theory, the integer square root (isqrt) of a non-negative integer n is the non-negative integer m which is the greatest integer less than or equal
Integer_square_root
Types of special mathematical functions
Γ-function, that the first two factors capture the singularities of γ ( s , z ) {\displaystyle \gamma (s,z)} (at z = 0 or s a non-positive integer), whereas
Incomplete_gamma_function
Function that is holomorphic on the whole complex plane
positive constants and n {\displaystyle n} is a non-negative integer. An entire function f {\displaystyle f} satisfying the inequality | f ( z ) | ≤ M
Entire_function
Algorithm for public-key cryptography
possibility of using Euler totient function results also from Lagrange's theorem applied to the multiplicative group of integers modulo pq. Thus any d satisfying
RSA_cryptosystem
Integer having a non-trivial divisor
number is a positive integer that can be formed by multiplying two smaller positive integers. Accordingly, it is a positive integer that has at least one
Composite_number
Natural number
Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016. Sloane, N. J. A. (ed.). "Sequence A000712 (Generating function = Product_{m≥1}
700_(number)
Programmable calculator produced by Texas Instruments
inserting, deleting, or overwriting a program step. A NOP (No OPeration) function is provided to allow a program step to be ignored. Due to the hard limit
TI-57
Solutions of Legendre's differential equation
called the degree and order of the relevant function, respectively. The polynomial solutions when λ is an integer (denoted n), and μ = 0 are the Legendre
Legendre_function
Computation modulo a fixed integer
mathematics, modular arithmetic is a system of arithmetic operations for integers, differing from the usual ones in that numbers "wrap around" when reaching
Modular_arithmetic
Numbers obtained by adding the two previous ones
closest integer to φ n 5 {\displaystyle {\frac {\varphi ^{n}}{\sqrt {5}}}} . Therefore, it can be found by rounding, using the nearest integer function: F
Fibonacci_sequence
Algorithm for computing the value of a transcendental number
as quotients of integer functions of term positions. This algorithm is applicable to many familiar series for trigonometric functions, logarithms, and
Spigot_algorithm
Functions of an angle
\sin(x+y).} A positive integer appearing as a superscript after the symbol of the function denotes exponentiation, not function composition. For example
Trigonometric_functions
Function that is discontinuous at rationals and continuous at irrationals
function, the ruler function (not to be confused with the integer ruler function), the Riemann function, or the Stars over Babylon (John Horton Conway's name)
Thomae's_function
C standard library header file
mathematical functions, which use floating-point numbers, are defined in <math.h> (<cmath> header in C++). The functions that operate on integers, such as
C_mathematical_functions
Natural number
It is the square of 30 and the sum of Euler's totient function for the first 54 positive integers. In base 10, it is a Harshad number. It is also the first
900_(number)
Natural number
N. J. A. (ed.). "Sequence A002322 (Reduced totient function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-08. Sloane
100
travel, tourism, insurance
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
INTEGER FUNCTION
travel, tourism, insurance