- prime-divisor function
- мат. функция простого делителя
Большой англо-русский и русско-английский словарь. 2001.
prime-divisor function
Смотреть что такое "prime-divisor function" в других словарях:
Divisor function — σ0(n) up to n = 250 Sigma function σ … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Divisor — divisible redirects here. For divisibility of groups, see Divisible group. For the second operand of a division, see Division (mathematics). For divisors in algebraic geometry, see Divisor (algebraic geometry). For divisibility in the ring theory … Wikipedia
Divisor summatory function — The summatory function, with leading terms removed, for x < 104 … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
Prime factor — In number theory, the prime factors of a positive integer are the prime numbers that divide into that integer exactly, without leaving a remainder. The process of finding these numbers is called integer factorization, or prime factorization.For a … Wikipedia
prime — primeness, n. /pruym/, adj., n., v., primed, priming. adj. 1. of the first importance; demanding the fullest consideration: a prime requisite. 2. of the greatest relevance or significance: a prime example. 3. of the highest eminence or rank: the… … Universalium
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
Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For … Wikipedia
Harmonic divisor number — This article is about harmonic divisor numbers. For meanings of harmonic number, see harmonic number (disambiguation). In mathematics, a harmonic divisor number, or Ore number (named after Øystein Ore who defined it in 1948), is a positive… … Wikipedia
Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal … Wikipedia
