I write, therefore I am

Note1: This lemma is used to prove the Dyadic Convolution Theorem . Note2: To understand this proof, you should have a good understa...

The Dyadic (XOR) convolution of the sequences $a$ and $b$ is the sequence $c=a*b$ defined by $c_k=\displaystyle\sum_{i\oplus j = k}a_...

It's interesting to note how each type of Generating function has its own advantages and disadvantages. For example, we saw how, given ...

This code uses the algorithm described here . The same algorithm has been used for SumOfPrimes function here . #include<stdio.h> ...

We saw the algorithm for the generalized Prime counting function in the previous post . Here is the C code for the same, with some sli...

In Counting Primes - Prime Counting function - Part III , we saw the function used to calculate the sum of all primes less than a given...

This post continues what we discussed here . Pólya's Enumeration theorem allows us to do much more. In all of the examples above, w...