Skip to main content

All Questions

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
15 votes
0 answers
487 views

Word complexity of primes mod 4

For an infinite binary word $w$, the word complexity $f_w(n)$ is defined as the number of different subwords of length $n$. The asymptotic behavior of this function is an important parameter of the ...
Igor Pak's user avatar
  • 17.1k
2 votes
0 answers
199 views

Not a twin prime pair test using $\gcd$ only

Let $m$ be an odd positive integer such that $m=2k+1$, $k\in\mathbb{N}$. Let $v$ be a vector of $n$ positive integers. Let $v(i)$ be the $i$-th element of the vector. Then we start with $v(i)=m(i+1)-2$...
Notamathematician's user avatar