Search results
Jump to navigation
Jump to search
Page title matches
- In [[number theory]], an '''arithmetic function''' is a function defined on the set of [[positive integer]]s, usually with ==Classes of arithmetic function==1 KB (159 words) - 06:03, 15 June 2009
- 159 bytes (23 words) - 15:51, 2 December 2008
- 831 bytes (112 words) - 02:21, 3 December 2008
- {{r|Average order of an arithmetic function}} {{r|Normal order of an arithmetic function}}1 KB (179 words) - 06:02, 15 June 2009
- ...athematics]], in the field of [[number theory]], the '''normal order of an arithmetic function''' is some simpler or better-understood function which "usually" takes the * [[Average order of an arithmetic function]]2 KB (276 words) - 16:53, 6 December 2008
- ...thematics]], in the field of [[number theory]], the '''average order of an arithmetic function''' is some simpler or better-understood function which takes the same value2 KB (254 words) - 08:27, 19 December 2011
- 448 bytes (62 words) - 02:23, 3 December 2008
- 491 bytes (65 words) - 02:24, 3 December 2008
- ...c, which "usually" takes the same or closely approximate values as a given arithmetic function.194 bytes (26 words) - 02:28, 3 December 2008
- ..., which on average takes the same or closely approximate values as a given arithmetic function.195 bytes (27 words) - 02:29, 3 December 2008
- {{r|Arithmetic function}} {{r|Normal order of an arithmetic function}}898 bytes (143 words) - 15:37, 9 November 2008
- {{r|Arithmetic function}} {{r|Average order of an arithmetic function}}899 bytes (143 words) - 14:39, 9 November 2008
Page text matches
- In [[number theory]], an '''arithmetic function''' is a function defined on the set of [[positive integer]]s, usually with ==Classes of arithmetic function==1 KB (159 words) - 06:03, 15 June 2009
- #REDIRECT [[Arithmetic function]]33 bytes (3 words) - 14:54, 9 November 2008
- #REDIRECT [[Arithmetic function]]33 bytes (3 words) - 17:21, 2 January 2009
- ...c, which "usually" takes the same or closely approximate values as a given arithmetic function.194 bytes (26 words) - 02:28, 3 December 2008
- #REDIRECT [[Arithmetic function#Multiplicative functions]]58 bytes (5 words) - 15:59, 2 December 2008
- ..., which on average takes the same or closely approximate values as a given arithmetic function.195 bytes (27 words) - 02:29, 3 December 2008
- {{r|Average order of an arithmetic function}} {{r|Normal order of an arithmetic function}}608 bytes (79 words) - 18:38, 11 January 2010
- {{r|Arithmetic function}} {{r|Average order of an arithmetic function}}2 KB (262 words) - 19:07, 11 January 2010
- {{r|Arithmetic function}} {{r|Average order of an arithmetic function}}1 KB (187 words) - 19:18, 11 January 2010
- {{r|Arithmetic function}}436 bytes (54 words) - 11:42, 15 June 2009
- The [[Average order of an arithmetic function|average order]] of ''d''(''n'') is <math>\log(n)</math>. The [[Normal order of an arithmetic function|normal order]] of log(''d''(''n'')) is log(2) log log(''n'').720 bytes (123 words) - 04:26, 1 November 2013
- Arithmetic function which takes the values -1, 0 or +1 depending on the prime factorisation of144 bytes (20 words) - 10:08, 4 September 2009
- An arithmetic function studied by Ramanjuan, the coefficients of the q-series expansion of the mod150 bytes (20 words) - 14:54, 3 December 2008
- {{r|Arithmetic function}}321 bytes (41 words) - 05:50, 15 June 2009
- {{r|Average order of an arithmetic function}} {{r|Normal order of an arithmetic function}}1 KB (179 words) - 06:02, 15 June 2009
- In [[mathematics]], [[Srinivasa Ramanujan]]'s '''tau function''' is an [[arithmetic function]] which may defined in terms of the [[Delta form]] by the formal infinite p516 bytes (82 words) - 15:27, 23 August 2023
- {{r|Arithmetic function}} {{r|Normal order of an arithmetic function}}898 bytes (143 words) - 15:37, 9 November 2008
- {{r|Arithmetic function}} {{r|Average order of an arithmetic function}}899 bytes (143 words) - 14:39, 9 November 2008
- {{r|Average order of an arithmetic function}}553 bytes (71 words) - 20:41, 11 January 2010
- In [[number theory]], the '''Möbius function''' μ(''n'') is an [[arithmetic function]] which takes the values -1, 0 or +1 depending on the [[prime factorisation Let ''f'' be an arithmetic function and ''F''(''s'') the corresponding [[formal Dirichlet series]]. The [[Diri2 KB (261 words) - 04:58, 10 December 2008
- {{r|Arithmetic function}}649 bytes (85 words) - 15:41, 11 January 2010
- ...athematics]], in the field of [[number theory]], the '''normal order of an arithmetic function''' is some simpler or better-understood function which "usually" takes the * [[Average order of an arithmetic function]]2 KB (276 words) - 16:53, 6 December 2008
- {{r|Arithmetic function}}532 bytes (69 words) - 18:44, 11 January 2010
- ...thematics]], in the field of [[number theory]], the '''average order of an arithmetic function''' is some simpler or better-understood function which takes the same value2 KB (254 words) - 08:27, 19 December 2011
- * The [[Average order of an arithmetic function|average order]] of φ(''n'') is <math>\frac{6}{\pi^2} n</math>.1 KB (224 words) - 17:35, 21 November 2008
- * The [[Average order of an arithmetic function|average order]] of ''J''<sub>''k''</sub>(''n'') is ''c'' ''n''<sup>''k1 KB (181 words) - 16:05, 29 October 2008
- The [[Average order of an arithmetic function|average order]] of σ(''n'') is <math> \frac{\pi^2}{6} n</math>.1 KB (172 words) - 04:53, 1 November 2013
- {{r|Arithmetic function}}884 bytes (139 words) - 17:00, 6 December 2008
- {{r|Arithmetic function}}884 bytes (140 words) - 15:13, 2 December 2008
- {{r|Arithmetic function}}491 bytes (62 words) - 21:40, 11 January 2010
- {{r|Arithmetic function}}2 KB (247 words) - 17:28, 11 January 2010
- ...ties of the associated [[Dirichlet series]]. It is used in the study of [[arithmetic function]]s and yields a proof of the [[Prime number theorem]]. It is an example of2 KB (362 words) - 16:05, 9 November 2008
- {{r|Arithmetic function}}853 bytes (136 words) - 15:14, 2 December 2008
- {{r|Arithmetic function}}870 bytes (139 words) - 16:53, 3 December 2008
- * The [[Hardy–Ramanujan theorem]] that the [[normal order of an arithmetic function|normal order]] of ω(''n''), the number of distinct [[prime factor]]s3 KB (494 words) - 15:55, 29 October 2008