|
Pillai's Arithmetical Function
In number theory, the gcd-sum function, also called Pillai's arithmetical function, is defined for every n by :P(n)=\sum_^n\gcd(k,n) or equivalently :P(n) = \sum_ d \varphi(n/d) where d is a divisor of n and \varphi is Euler's totient function. it also can be written as :P(n) = \sum_ d \tau(d) \mu(n/d) where, \tau is the divisor function, and \mu is the Möbius function. This multiplicative arithmetical function was introduced by the Indian mathematician Subbayya Sivasankaranarayana Pillai Subbayya Sivasankaranarayana Pillai (5 April 1901 – 31 August 1950) was an Indian mathematician specialising in number theory. His contribution to Waring's problem was described in 1950 by K. S. Chandrasekharan as "almost certainly his best ... in 1933. References {{oeis, A018804 Arithmetic functions ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for example, algebraic integers). Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory can often be understood through the study of Complex analysis, analytical objects, such as the Riemann zeta function, that encode properties of the integers, primes or other number-theoretic objects in some fashion (analytic number theory). One may also study real numbers in relation to rational numbers, as for instance how irrational numbers can be approximated by fractions (Diophantine approximation). Number theory is one of the oldest branches of mathematics alongside geometry. One quirk of number theory is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler's Totient Function
In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to . It is written using the Greek letter phi as \varphi(n) or \phi(n), and may also be called Euler's phi function. In other words, it is the number of integers in the range for which the greatest common divisor is equal to 1. The integers of this form are sometimes referred to as totatives of . For example, the totatives of are the six numbers 1, 2, 4, 5, 7 and 8. They are all relatively prime to 9, but the other three numbers in this range, 3, 6, and 9 are not, since and . Therefore, . As another example, since for the only integer in the range from 1 to is 1 itself, and . Euler's totient function is a multiplicative function, meaning that if two numbers and are relatively prime, then . This function gives the order of the multiplicative group of integers modulo (the group of units of the ring \Z/n\Z). It is also used for defining the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divisor Function
In mathematics, and specifically in number 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 of divisors of an integer'' (including 1 and the number itself). It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum. A related function is the divisor summatory function, which, as the name implies, is a sum over the divisor function. Definition The sum of positive divisors function ''σ''''z''(''n''), for a real or complex number ''z'', is defined as the sum of the ''z''th powers of the positive divisors of ''n''. It can be expressed in sigma notation as :\sigma_z(n)=\sum_ d^z\,\! , where is shorthand fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Function
The Möbius function \mu(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted \mu(x). Definition The Möbius function is defined by :\mu(n) = \begin 1 & \text n = 1 \\ (-1)^k & \text n \text k \text \\ 0 & \text n \text > 1 \end The Möbius function can alternatively be represented as : \mu(n) = \delta_ \lambda(n), where \delta_ is the Kronecker delta, \lambda(n) is the Liouville function, Prime omega function, \omega(n) is the number of distinct prime divisors of n, and Prime omega function, \Omega(n) is the number of prime factors of n, counted with multiplicity. Another characterization ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetical Function
In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any Function (mathematics), function whose Domain of a function, domain is the set of natural number, positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of ''n''". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes. An example of an arithmetic function is the divisor function whose value at a positive integer ''n'' is equal to the number of divisors of ''n''. Arithmetic functions are often extremely irregular (see #First 100 values of some arithmetic functions, table), but some of them have series expansions in terms of Ramanujan's sum. Multiplicative and additive functions An arithmetic function ''a'' is * Compl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subbayya Sivasankaranarayana Pillai
Subbayya Sivasankaranarayana Pillai (5 April 1901 – 31 August 1950) was an Indian mathematician specialising in number theory. His contribution to Waring's problem was described in 1950 by K. S. Chandrasekharan as "almost certainly his best piece of work and one of the very best achievements in Indian Mathematics since Ramanujan". Biography Subbayya Sivasankaranarayana Pillai was born to parents Subbayya Pillai and Gomati Ammal. His mother died a year after his birth and his father when Pillai was in his last year at school. Pillai did his intermediate course and B.Sc. Mathematics in the Scott Christian College at Nagercoil and managed to earn a B.A. degree from Maharaja's college, Trivandrum. In 1927, Pillai was awarded a research fellowship at the University of Madras to work among professors K. Ananda Rau and Ramaswamy S. Vaidyanathaswamy. He was from 1929 to 1941 at Annamalai University where he worked as a lecturer. It was in Annamalai University that he did his ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
