histocrat
Reputation
207
Top tag
Next privilege 250 Rep.
View close votes
Badges
1 5
Newest
Impact
~115 people reached

• 0 helpful flags
• 4 votes cast

# 14 Actions

 Oct 20 awarded Yearling Oct 7 accepted For every prime $p \gt 3$, is there a number $n$ such that $n! \equiv 1\pmod p$? Oct 7 asked For every prime $p \gt 3$, is there a number $n$ such that $n! \equiv 1\pmod p$? Jan 27 awarded Teacher Apr 26 awarded Editor Apr 26 revised Does there exist a k such that the kth prime is balanced in order k-1? Correct an algebra mistake that doesn't affect the validity of the proof Apr 26 comment Does there exist a k such that the kth prime is balanced in order k-1? Very nice! That means the highest possible order the kth prime can be balanced in is k-2, and there is at least one such prime, 5. Apr 26 suggested approved edit on Does there exist a k such that the kth prime is balanced in order k-1? Apr 26 awarded Scholar Apr 26 accepted Does there exist a k such that the kth prime is balanced in order k-1? Apr 26 awarded Student Apr 26 asked Does there exist a k such that the kth prime is balanced in order k-1? Apr 26 awarded Supporter Nov 12 suggested rejected edit on Are there infinitely many “super-palindromes”?