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)?(adsbygoogle = window.adsbygoogle || []).push({});

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).

**Physics Forums | Science Articles, Homework Help, Discussion**

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

# Longest repeated sequence in the prime counting function

**Physics Forums | Science Articles, Homework Help, Discussion**