@HarryEvans If A and B were sets; and I wanted to define thier union: would x, such that x∈A or x∈B be enough? Or would that just define the union of two single elements (and not every element)?
@robjohn I'm currently working on a homework and I need someone's help. First, suppose we have the power series $\sum_{n = 0}^{\infty} \frac {B_n z^n}{n!}$ which converges to $f(z) = 1$ if $z = 0$ and $f(z) = \frac {z} {e^z - 1}$ whenever $z \ne 0$. We need to show its radius of convergence is $2 \pi$
I don't know if Hadamard's formula works here. In fact, we need to also show that $B_n = - \frac {1} {n + 1} \sum_{k = 0}^{n -1} C(n+1, k) B_k$
Is this the Identity Theorem: If $f$ is analytic on $D \subseteq \mathbb {C}$, $f = 0$ on $S \subset D$ contains an accumulation point in $D$. Then, $f = 0$?
Proof Verification: A group of order $595$ has a normal Sylow 17-subgroup.
$|G|=595=5.7.17$
The divisors of $595$ are $1,5,7,17,35,85,119,595$.
$17|n_{17}-1\implies n_{17}=1,35\\7|n_7-1\implies n_7=1,85,119\\5|n_5-1\implies n_5=1$
If possible let $n_{17}=35.$ Then there is at least $35.1...
@BAYMAX, by the Sylow theorems, since 17 is a factor of 595, we determine how many Sylow 17-subgroups there are. The possibilities are 1 or 35. Now, there cannot be 35 Sylow 17-subgroups since that would be a contradiction
@BAYMAX, all of these are consequences of the Third SYlow Theorem
@BAYMAX, If there are 35 Sylow 17-subgroups, then if there are at least 85 Sylow 7-subgroups, then $35 \cdot (17 -1) + 85 \cdot (7 - 1)$. What is the total?
@DHMO ,but Sir (don't think I am going to make wrong thing correct) in my book what it did was the above one and used G.P ,there was a G.P ,which led to the answer. Let me post the image for better understanding.
The vacuous truth will hold even if u is in only one of the sets X or Y?
because if u in X and u not in Y, then by the truth table of "and", you get "false" as a result, even if u in A where A is empty is vacuously true, thus you have true=false, and I don't know how that will be consistent
Consider X={1,2,3} and Y={4,5,6}. Clearly they are disjoint sets, thus A is empty. Now let u=4, then u in Y but not in X, thus "u in Y and u in X" is false. Now for the left side of the $\equiv$ there is no element in A, thus for all u in A, (property) is vacously true. Thus we have true $\equiv$ false, which is absurd
you're trying to do part (b) in the imgur link on the starboard? if so, plugging the desired formula for $B_n$ into the power series works as verification, but it doesn't tell you how the recursion was derived in the first place - which is what you find out when you follow the directions
@HarryEvans You see how that $\sum$ is supposed to be a fraction right? It's supposed to be $f(z)=\frac{z}{e^z-1}$. The Cauchy product involves multiplying by another function. What other function $g(z)$ do you think we're going to multiply $f(z)$ by?
Hint: $f(z)$ is expressed as a fraction. What do we tend to multiply fractions by?
it just seemed a bit weird that he'd (ny teacher) give different examples of P(A) and P(B), yet keep them mutually exclusive and keep asking for p(a and b)