1.) Show that (n+1)! = 2(n-1)! mod n+2(adsbygoogle = window.adsbygoogle || []).push({});

I finished this one. Actually very easy.

2.) Let n > 2 be odd. Prove that if 4[(n-1)! + 1] + n = 0 mod n(n+2) holds, then n, n+2 are twin primes. Hint says to use the previous problem.

I don't even know what to do for this problem.

3.) Prove the converse of the theorem in the preceeding problem is also true. Thus, the two problems together constitute a necessary and sufficient condition for (n, n+2) to be a pair of twin primes.

Obviously, if I can figure out #2, this one will be a walk in the park.

Thanks for any help given, I appreciate it.

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

Dismiss Notice

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!

# 3 Problems

Loading...

Similar Threads - Problems | Date |
---|---|

Least Square basic problem | Jan 20, 2018 |

A Eigenvalue Problem and the Calculus of Variations | Jan 8, 2018 |

I Problem understanding the SPAN | May 1, 2017 |

B Bracket notation problem | Oct 14, 2016 |

I Difference Equation Boundary Conditions0. | Oct 10, 2016 |

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