- #1

- 3,077

- 3

## Main Question or Discussion Point

Is there a longest repeated sequence (congruency) in the prime counting function [tex] \pi (x) [/tex] (that which gives the number of primes less than or equal to x)?

Recall that [tex] \pi (x) [/tex], although infinite, may not be random, and itself starts out with an unrepeated sequence [tex] \pi (2)=1 [/tex] and [tex] \pi (3)=2 [/tex] (with a "slope" of 1).

Recall that [tex] \pi (x) [/tex], although infinite, may not be random, and itself starts out with an unrepeated sequence [tex] \pi (2)=1 [/tex] and [tex] \pi (3)=2 [/tex] (with a "slope" of 1).