I'm looking at a card shuffle. And in shuffle would be the permutation (1, 2, 3, ..., n, n+1, n+2, n+3, ...2n) to (2, 4, 6, ..., 2n 1, 3, 5, ...2n-1) I know that it would take 52 perfect shuffles to get the deck of cards back in the original order. I think that I'm supposed to show this using Fermats Little Theorem.(adsbygoogle = window.adsbygoogle || []).push({});

Fermats little theorem says a^{ p-1}≡ 1(mod p) or a^{p}≡ a(mod p). Now I'm pretty sure that using the permutation from above plugging in for Fermat'l Little Theorem looks like: 52 ≡ 2(mod 2n+1)

If that is right I'm not sure how to show that I came up with that 52.

Can somebody please help?

Thanks you so much!! Nicole

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Fermats little theorem on permutations

Loading...

Similar Threads - Fermats little theorem | Date |
---|---|

I Fermat's Little Theorem ... Anderson and Feil, Theorem 8.7 . | Feb 26, 2017 |

Expansion of Fermat's Little Theorem | Apr 5, 2010 |

A Proof of Fermat's Little Theorem | Dec 6, 2009 |

Fermat's little theorem | Nov 30, 2009 |

Proof of Fermat's Little Theorem | Sep 8, 2005 |

**Physics Forums - The Fusion of Science and Community**