00:01
So here in this question, let s be the set of all positive integers.
00:04
Let, sorry, let s be the set, be the set of all positive, all positive integers, all positive integers less than, less than or equals to n.
00:24
Then let a be the set of integers divisible by q.
00:28
Let a be divisible, be divisible by p and b be divisible, be divisible by q, by q and c be the set of integers divisible by both, c be divisible, be divisible by both, by both.
00:59
Now, the principle of inclusion -exclusion states that the number of elements in the finite union of sets can be calculated by taking the sum of cardinalities of individual sets minus the sum of cardinalities of all pairwise intersections plus the sum of cardinalities of triplewise intersections and so on.
01:18
Now, in this case, we want to find the number of integers in s that are not in a, b or c that is relatively prime to n.
01:27
Now, we calculate the individual set size.
01:31
So, s is n, which is a number of integers from 1 to n...