Skip to main content
10 events
when toggle format what by license comment
Nov 3, 2014 at 8:01 comment added Sven Wirsing Open problem: so the question is answered!
Nov 1, 2014 at 1:51 comment added Padraig Ó Catháin Zsigmondy's theorem shows that, for fixed p and any value of n, there exists a prime dividing $p^n-1$ which does not divide $p^m-1$ for any $m < n$. en.wikipedia.org/wiki/Zsigmondy's_theorem
Oct 31, 2014 at 17:02 history closed Alex B.
Venkataramana
Chris Godsil
Stefan Kohl
user9072
Not suitable for this site
Oct 31, 2014 at 16:15 comment added Sven Wirsing I think both questions are well formulated. So the answer is what Peter has written already: no answer in general. Thanks:-)
Oct 31, 2014 at 14:58 comment added Boris Bukh Sometimes (p-1)/2 is a prime, sometimes it is not. Conjecturally, the former happens infinitely often. There is no universal answer. Probably you should explain what you are looking for, and why, so that we can help. Are you interested in a worst case? Then define "worst". Are you interested in average-case behavior, then what are you averaging over, p or n, etc.
Oct 31, 2014 at 11:36 review Close votes
Oct 31, 2014 at 17:02
Oct 31, 2014 at 11:36 vote accept Sven Wirsing
Oct 31, 2014 at 11:31 vote accept Sven Wirsing
Oct 31, 2014 at 11:31
Oct 31, 2014 at 9:24 answer added Peter Mueller timeline score: 5
Oct 31, 2014 at 8:54 history asked Sven Wirsing CC BY-SA 3.0