Let $Log(n) = \sum\_{i=1}^r \alpha\_i \cdot e\_i$, where $n = \prod\_{i=1}^r p\_i^{\alpha\_i}$ and $p\_i$ is the $i$-th prime, $\alpha\_i \ge 0$, $e\_i$ is the $i$-th standard basis vector. For example $6 = 2\cdot3$, hence:
$$Log(6) = (1,1,0,0,0,\cdots)$$
$$Log(15) = (0,1,1,0,0,\cdots)$$
$$Log(7) = (0,0,0,1,0,\cdots)$$
Consider the $\mathbb{Q}$-vector space generated by the vectors:
$$Log(1),Log(2),\cdots,Log(n)$$
It is not difficult to see that the dimension of this vector space is $\Pi(n)$, where $\Pi$ is the prime counting function.


I am interested if one can get some result of number theoretic interest by looking at these vectors. Is there some reference for literature which pursues this line of thought? For example, let $1 < a\_1,a\_2,\cdots,a\_k \le n$ be a basis for $1,\cdots,n$ (where I mean that $Log(a\_1),Log(a\_2),\cdots,Log(a\_k)$ is a basis for the above vector space), $n\ge 2 , k = \Pi(n)$, then it seems like (I have no proof for this just some intuition), that
$$ a\_1 \cdot a\_2 \cdots a\_k \equiv 0 \mod p\_1\cdots p\_k$$
where $p\_i$ denotes the $i$-th prime number.
Furthermore I conjecture, that if $2 \le m \le n$ and $1 < a\_1,\cdots,a\_k \le m $ is a basis for $1,\cdots,m$ and $\Pi(m)=k,\Pi(n)=l$ then there seems to exist a basis $1<b\_1,\cdots,b\_l\le n$ of $1\cdots,n$ such that:
$$\frac{a\_1\cdots a\_k}{p\_1 \cdots p\_k} = \frac{b\_1 \cdots b\_l}{p\_1 \cdots p\_l}$$


Examples: $m=5,n=7$ then:
$$\frac{3\cdot 4 \cdot 5}{2 \cdot 3 \cdot 5} = \frac{3 \cdot 4 \cdot 5 \cdot 7}{2 \cdot 3 \cdot 5 \cdot 7}$$


So my questions are:


a) Is this line of thought already pursued? If so what is the reference?
 ( Namely using results of linear algebra or geomtric number theory to prove number theoretic results.)
b) Are the above conjectures true, if so how to prove them?


Thanks for your help.


I think I found an exact "formula" for the prime counting function using Euler characteristic:


$$ \Pi(n)= (-1)^{n+1} \sum rank(A) \cdot (-1)^{|A|}$$


where $A$ runs through the subsets of $1\cdots n$ of size $< n$.


For this to be true I need to prove a more general conjecture, which it would be nice if someone knows how to do this:


$$0 = \sum rank(A) \cdot (-1)^{|A|}$$


where $A$ runs through all subsets of some vectors $v\_1,\cdots,v\_n$. Since this is similar to Euler characteristic, it would be nice if someone knows how to prove this, since the prime counting formula would follow from this.


**Edit**:
For the general case this is not true, but computations for small $n$ suggest, that the prime counting formula is correct.



Is this line of thought (using linear algebra to get number theoretic results) already being pursued in the literature?
I don't know of such a reference, but I think I can give you a short proof for your intuition and conjecture, hope that helps:


One basis for $1,...,n$ is given by $e\_1,\ldots, e\_k$, where $k = \Pi(n)$. Now assume we have any basis $v\_1, \ldots , v\_k$ and fix an $1 \leq i \leq k$. Then there exists a $j$ such that $v\_j$ has a non-zero entry at position $i$, as otherwise $e\_i$ can not be written as a linear combination of the $v$. Writing $v\_j = Log(a\_j)$, this means that $p\_i \mid a\_j$, giving you the desired result.


About your conjecture:
Take $b\_i' = p\_i$ for all $i$. Then the number on the right hand side will be $1$. Next, set the $b\_i$ by multiplying $b\_1$ with a factor to satisfy the equality. Due to the fact that $k \leq l$, $b\_i$ will still stay in the same space, and the conjecture is shown.


Unfortunately, I can't comment on the formula for $\Pi(n)$, as I currently can't remember the definition of the rank of a set.


