|
Functional Programming with Python LG #109 (1813 words) |
 | The functional programming paradigm encourages us to structure our programs as collections of `pure' functions which do not have any global state and which do not make use of the assignment operator (note that this is not possible in all situations; a banking system will surely have to `remember' lots of stuff). |
 | Functional programmers use recursive invocation of functions (iteration is considered to be a special case of recursion and specific iteration constructs like the `while' or `for' loop may be absent altogether) to program repetitive behaviour. |
 | Functions are considered `first class', ie, they can be passed to other functions and returned from other functions thereby facilitating the creation of what are called `higher order functions' - a powerful idea which can capture concisely many complex computational patterns when combined with the idea of `closures'. |
| Divisor function - Wikipedia, the free encyclopedia (596 words) |
 | In mathematics, and specifically in number theory, a divisor function is an arithmetical function related to the divisors of an integer. |
 | Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities. |
 | The behaviour of the sigma function is irregular. |