- arithmetical function
- мат. арифметическая функция
Большой англо-русский и русско-английский словарь. 2001.
arithmetical function
Смотреть что такое "arithmetical function" в других словарях:
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
Arithmetical set — In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first order Peano arithmetic. The arithmetical sets are classified by the arithmetical hierarchy.A function f:subseteq… … Wikipedia
Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… … Wikipedia
Divisor function — σ0(n) up to n = 250 Sigma function σ … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Additive function — Different definitions exist depending on the specific field of application. Traditionally, an additive function is a function that preserves the addition operation:: f ( x + y ) = f ( x ) + f ( y )for any two elements x and y in the domain. An… … Wikipedia
Gödel number — In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well formed formula of some formal language a unique natural number called its Gödel number. The concept was first used by Kurt Gödel for the proof of his… … Wikipedia
Perron's formula — In mathematics, and more particularly in analytic number theory, Perron s formula is a formula due to Oskar Perron to calculate the sum of an arithmetical function, by means of an inverse Mellin transform.tatementLet {a(n)} be an arithmetic… … Wikipedia
