Citation Hunt

The Wikipedia snippet below is not backed by a reliable source. Can you find one?

Click I got this! to go to Wikipedia and fix the snippet, or Next! to see another one. Good luck!

In page Lagged Fibonacci generator:

"

The maximum period of lagged Fibonacci generators depends on the binary operation {\displaystyle \star } . If addition or subtraction is used, the maximum period is (2k − 1) × 2M−1[citation needed]. If multiplication is used, the maximum period is (2k − 1) × 2M−3, or 1/4 of period of the additive case. If bitwise xor is used, the maximum period is 2k − 1.