The sum of "mobius of n" over n, for n>2 was going to converge to zero. This is great for when we look at the density of a set formed by sieving 0 mod "all the primes" or "n mod 'all the primes'" when n is a positive integer. The problem I run into is where we DON'T use residue classes across all the primes as moduli with a singleton finite intersection property. In weak terms, I don't get a coset being eliminated so the density calculation should not converge to zero. I'll go over the weak coset theorems again on my end, but I recall looking at sieving {1 mod 2} and {0 mod p} for primes greater than 2 as an example to show what happens when there's no coset of Z+ (positive integers) sieved. _The fraction_ of the density vanishes exponentially. What happens is we don't see powers of 2 sieved out and therefore the number of elements not sieved expands asymptotically with log_2 of n + O(1) in the interval (0,n] when "n" goes to infinity. Is that correct as simple example?

The pairs of differential equations reminded me of Fourier transforms...I wonder if there is an approximate counting link between sieve methods and Fourier methods...

i'm grade 9, thanks for wikipedia for teaching me to understand this, it's easy for me to learn them.

So this is where the mobius function plays a key role

Hello

@lultopkek

3 жыл бұрын

yoooo

@cupass6179

2 жыл бұрын

Hi!

awful eraser

Seems like the guy is too intelligent with MATH , assumes we know most of it.