How many trees in a forest? Some time ago I met a forester. He told that there are only larches and spruces in his forest. 
He also said that there are exactly $10$ spruces at the distance of exactly 1 km from each larch. Next, he argued that  there are more larches than spruces in his forest. Can he be right?
Nice number theoretic question in disguise! Not being much of a botanist I'll
call larches X and spruces Y, or I won't be able to tell them apart. Also I
take "argued" in the question to mean "asserted", since one can obviously not
argue that there must be more larches than spruces, but there can be.

Here is a solution, or rather a method to construct a solution. I'll take the
Y trees to form a large square grid, the distances between neigbours being 2
units (the unit of length is to be determined). In those units these trees
therefore occupy the points with both coordinates even, filling a large region
around the origin (we'll see about the boundary of the forest later).

There will be an X tree at $(2a+1,2b)$ and at $(2a,2b+1)$ for any integers
$a,b$ for which this does not come too close to the limit of the Y trees.


    0 0 0 0 0 0 0 0

    0 0*0*0*0*0*0 0
      * * * * * *
    0 0*0*0*0*0*0 0
      * * * * * *
    0 0*0*0*0*0*0 0
      * * * * * *
    0 0*0*0*0*0*0 0    X=*, Y=0
      * * * * * *
    0 0*0*0*0*0*0 0
      * * * * * *
    0 0*0*0*0*0*0 0

    0 0 0 0 0 0 0 0


Within the area occupied by X trees they are twice as numerous as the Y trees,
so we can make the X trees win out overall by making the forest large enough
(the advantage for X increases with the area, while the boundary, where the X
have stopped but not yet the Y, grows only with the circumference).

Now the challenge is to find a radius such that on a circle around each X
there are exactly 10 Y trees. If this works for the X tree at $(1,0)$, it will
work by translation and diagonal reflection symmetry for all X, provided we stop planting X when coming so close to the end of the forest that the circle protrudes outside.

Now we have our number theoretic question: for which integer $N$ (the square of
the radius) are there exactly 10 integer solutions $(x,y)$ to the equation
$(2x-1)^2+(2y)^2=N$ (giving a Y tree at $(2x,2y)$, at distance $\sqrt{N}$ of $(1,0)$)?
Obviously $N$ must be odd, and it is easy to see that dropping the parity
condition on the two squares summing to $N$ will double the amount of
solutions, every (odd,even) solution giving an (even,odd) solution by
interchange. So we need to have $N$ such that $k^2+l^2=N$ has exactly 20
integer solutions $(k,l)$. I claim the smallest such $N$ is $N=5^4=625$. That
it is indeed a solution is easy to see, with 5 solutions in the positive
quadrant (taken to include the the positive x-axis but not the y-axis):
$(25,0)$, $(24,7)$, $(20,15)$, $(15,20)$ and $(7,24)$, and the remaining
solutions are obtained from these by applying quarter turns.

To explain the "smallest such $N$" part, I applied to following theorem 2.3.12 from the course on arithmetic I gave last year (in French; I have no other reference at hand for the full statement, but its first part is well known, and the rest is easy once you know enough about Gaussian integers to prove the first part):

Theorem. Let $N$ be a positive integer, and $N=p_1^{m_1}\ldots p_l^{m_l}$ its
prime factorization. A necessary and sufficient condition for the existence of
integers $a,b$ with $N=a^2+b^2$ is that for every $p_i$ that is congruent to
$3$ modulo $4$ the corresponding exponent $m_i$ be even. Moreover the number
of solutions is given by
$$ 4 \prod_{\kern-14pt p_i\equiv1\pmod4\kern-14pt}(m_i+1).$$

So the number is always divisible by 4 (for obvious reasons) and for the other
factors only primes that are 1 modulo 4 are useful; for a factor 5 one needs
an exponent $m_1=4$, and the smallest appropriate prime is $p_1=5$, whence
$N=5^4=625$. The actual solutions are easily constucted using Gaussian integer
multiplication, from the elements $2\pm\mathbf{i}$ of norm $\sqrt5$.

All that remains is to choose the unit of measure to be $\frac1{25}\,\textrm{km}=40\,\textrm{m}$, and to find a size of the forest large enough that the X outnumber the Y even though they stop a kilometer before the the edge of the area planted with Y trees (left as exercise).

It may be argued that when trees are at least $40$ meters apart, one cannot reasonably talk about a forest. I would roughly guess a realistic distance between trees to be somewhere between $1$ and $5$ meters, which means we need $N$ to be larger, and in particular $\sqrt{N}$ (which is necessarily integer for a solution) in the range from $200$ to $1000$. This leaves us plenty of possibilities for $\sqrt{N}$, which can be any odd number whose set of prime factors $p$ with $p\equiv1\pmod4$ is a singleton, and which prime factor has multiplicity $2$. This leaves the possibilities $225$, $275$, $475$, $507$, $525$, $575$, $675$, $775$, $825$, $867$. Taking $867$ as an interesting value (giving a distance between trees of $\frac{1000}{867}\approx 1.15$ meter) the fundamental solutions of $k^2+l^2=N=867^2=751689$ are $(k,l)$ one of $(867,0)$, $(765,408)$ and $(720,483)$; the $17$ other solutions follow these by obvious symmetries.
Yes, he could. 10 spruces are in the middle of a formation, each point one kilometer away from the spruces. Larches could be planted around them,so there could be 20 larches sharing 10 spruces. Also the spruces could be in one metre square.