Search results
Jump to navigation
Jump to search
Page title matches
- In [[number theory]], the '''Lambda function''' is a function on [[positive integer]]s which gives the [[exponent (group796 bytes (127 words) - 15:10, 2 December 2008
- 95 bytes (12 words) - 17:59, 21 November 2008
- 884 bytes (140 words) - 15:13, 2 December 2008
Page text matches
- {{rpl|Lambda function}}173 bytes (22 words) - 05:17, 26 September 2013
- In [[number theory]], the '''Lambda function''' is a function on [[positive integer]]s which gives the [[exponent (group796 bytes (127 words) - 15:10, 2 December 2008
- * Carmichael's [[lambda function]]1 KB (159 words) - 06:03, 15 June 2009
- {{r|Lambda function}}2 KB (262 words) - 19:07, 11 January 2010
- {{r|Lambda function}}1 KB (179 words) - 06:02, 15 June 2009
- {{r|Lambda function}}520 bytes (68 words) - 19:43, 11 January 2010
- ...saying that ''n'' has a primitive root is that the value of Carmichael's [[lambda function]], λ(''n'') is equal to φ(''n'').2 KB (338 words) - 16:43, 6 February 2009
- ...tion, and the second bracketed segment contains the loop - an anonymous or lambda function. The underscore character stands in for the current iteration. The for loop9 KB (1,394 words) - 13:50, 5 August 2010