Fokker block: Difference between revisions
m →First definition of a Fokker block: Cut out more redundancy. |
|||
| Line 23: | Line 23: | ||
<math>S[i] = \bigg\lfloor \dfrac{e_1 i + a_1}{P} \bigg\rfloor t_1 + \cdots + \bigg\lfloor \dfrac{e_n i + a_n}{P} \bigg\rfloor t_n.</math> | <math>S[i] = \bigg\lfloor \dfrac{e_1 i + a_1}{P} \bigg\rfloor t_1 + \cdots + \bigg\lfloor \dfrac{e_n i + a_n}{P} \bigg\rfloor t_n.</math> | ||
Here ⌊''x''⌋ is the [[Wikipedia: Floor and ceiling functions|floor function]], | Here ⌊''x''⌋ is the [[Wikipedia: Floor and ceiling functions|floor function]], which returns the largest integer less than or equal to ''x''. When ''i'' = 0, since ''a''<sub>''k''</sub> < P each term is 0 and so S[0] = 0. Since for integer ''j'', ⌊''x'' + ''j''⌋ = ⌊''x''⌋ + ''j'', we have | ||
<math>S[i+P] = S[i] + e_1 t_1 + e_2 t_2 + … + e_n t_n = S[i] + 1</math> | <math>S[i+P] = S[i] + e_1 t_1 + e_2 t_2 + … + e_n t_n = S[i] + 1</math> | ||