Connectedness of digraphs from quadratic polynomials
Involve, A Journal of Mathematics(2020)
摘要
Suppose that , where is an odd positive integer. First, an infinite digraph is defined, where the vertex set is and the edge set is . Then the following results are proved: if , then the digraph is weakly connected; if is a safe prime, i.e., both and are primes, then the number of weakly connected components of the digraph is 2. Finally, a conjecture that there are infinitely many primes such that is presented.
查看译文
关键词
connectivity, digraph, prime
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要