Search results
Jump to navigation
Jump to search
- The '''exponential factorial''' of a positive integer ''n'', denoted by ''n''$, is ''n'' [[exponentiation|raised to the power]] o [[Category:Integer sequences]] ...2 KB (302 words) - 14:49, 1 December 2022
- ...ng function|main article]] gives examples of generating functions for many sequences. Other examples of generating function variants include [[Dirichlet generat Thus for any prescribed integer <math>j \geq 0</math>, we can use the previous integral representation toge ...62 KB (10,416 words) - 21:27, 17 March 2023
- ...ariable, by denoting <math>[n^{-s}] D_f(s) =: f(n)</math> for any positive integer <math>n \geq 1</math>, whenever ...rously by an application of [[integration by parts]], for any non-negative integer <math>m \geq 0</math>: ...13 KB (2,233 words) - 22:32, 20 March 2023
- ...idable in many [[computation]]s, especially when dividing two numbers in [[integer]] or doing [[fixed-point arithmetic]]; when computing mathematical function * Replacing a decimal [[integer]] by an integer with more trailing zeros. For example. 23,217 people by 23,200 people. ...48 KB (7,268 words) - 13:35, 13 November 2024
- ...{pi}}'s digits pass statistical tests for randomness, {{pi}} contains some sequences of digits that may appear non-random to non-mathematicians, such as a [[Six In 2006, Canadian mathematician [[Simon Plouffe]] used the PSLQ [[integer relation algorithm]]<ref>PSLQ means Partial Sum of Least Squares.</ref> to ...101 KB (14,465 words) - 01:01, 25 December 2024