arXiv:1503.08359 [math.NT]AbstractReferencesReviewsResources
On The Number Of Topologies On A Finite Set
Published 2015-03-28Version 1
We denote the number of distinct topologies which can be defined on the set $X$ with $n$ elements by $T(n)$. Similarly, $T_0(n)$ denotes the number of distinct $T_0$ topologies on the set $X$. In the present paper, we prove that for any prime $p$, $T(p^k)\equiv k+1 \ mod \ p$, and that for each non-negative integer $n$ there exists a unique $k$ such that $T(p+n)\equiv k$. We calculate $k$ for $n=1,2,3,4$. We give an elementary proof for a result of Z.I.Borevich to the effect that $T_0(p+n)\equiv T_0(n+1) \ mod \ p$.
Related articles: Most relevant | Search more
arXiv:1705.03011 [math.NT] (Published 2017-05-08)
An Elementary Proof for Ljunggren Equation
Existence of primes in the interval $ [15x,16x] $ -- An entirely elementary proof --
arXiv:1108.2361 [math.NT] (Published 2011-08-11)
An elementary proof of a congruence by Skula and Granville