Strong Laws of Large Numbers by Elementary Tauberian Arguments

For Kolmogorovs strong law of large numbers an alternative short proof is given which weakens Etemadis condition of pairwise independence. The argument uses the known – and elementary – equivalence of (Cesàro) C₁- and C₂-summability for one-sided bounded sequences. Also other strong laws of large numbers are established, in part via Borel summability.