I am studying probability theory and I need to understand moment generating functions (MGFs). The MGF of a random variable X is: M_X(t) = E[e^(tX)] = ∑_x e^(tx) P(X = x) & discrete \ ∫_(-∞)^(∞) e^(tx) f_X(x) dx & continuous My questions: 1. Why is it called a "moment generating" function? How do I extract moments from it? 2. Find the MGF of X ∼ Exponential(λ) and use it to find E[X] and E[X²]. 3. What is the domain of t for which the MGF exists? 4. How do MGFs help prove the sum of independent Poissons is Poisson? 5. What is the relationship between MGFs and characteristic functions? I want to see the computations step by step.

I need to understand the logistic growth model: dP/dt = rP(1 - P/K) where r is the growth rate and K is the carrying capacity. I know this is a separable ODE, but I'd like help with: 1. Step-by-step separation of variables and integration using partial fractions 2. Finding the equilibrium solutions and their stability 3. What happens when P₀ > K? Does the population decrease to K? 4. How to fit this model to real-world data Can someone solve: dP/dt = 0.5P(1 - P/1000), P(0) = 50

I need to understand the simplex algorithm for solving linear programming problems. Consider the problem: Maximize z = 3x₁ + 2x₂ Subject to: x₁ + x₂ ≤ 4 2x₁ + x₂ ≤ 6 x₁, x₂ ≥ 0 Can someone walk through the steps: 1. Convert to standard form by adding slack variables 2. Set up the initial simplex tableau 3. Identify the entering and leaving variables using the ratio test 4. Perform row operations to pivot 5. Determine optimality Also, what happens when there are degenerate solutions or unbounded problems?

I am studying complex analysis / PDEs and I need to understand harmonic functions. A function u(x, y) is harmonic if it satisfies Laplace's equation: ∂² u/∂ x² + ∂² u/∂ y² = 0 or in polar coordinates: Δ u = 0. My questions: 1. What is the physical significance of harmonic functions (steady-state heat, electrostatics, fluid flow)? 2. How does the mean value property characterise harmonic functions? 3. How do I solve the Dirichlet problem: find u harmonic in the unit disk |z| < 1 with boundary condition u(1, θ) = f(θ)? 4. What is Poisson's integral formula? 5. How are harmonic functions related to analytic functions? I want to see the solution for f(θ) = sin² θ on the unit disk.

I am studying graph theory and I need to understand Dijkstra's algorithm for finding the shortest path from a source vertex to all other vertices in a weighted graph. I know the basic idea: 1. Set distance to source = 0, all others = ∞ 2. Mark all vertices as unvisited 3. For the current vertex, consider all unvisited neighbors and update their distances 4. Mark current as visited, select the unvisited vertex with smallest distance 5. Repeat until all visited But I have specific questions: 1. Why does Dijkstra's algorithm fail with negative edge weights? 2. What is the time complexity with different data structures? 3. Can someone walk through the algorithm step-by-step on a concrete graph? For example, find shortest paths from A on: - A→B: 4, A→C: 2 - B→C: 1, B→D: 5 - C→D: 8, C→E: 10 - D→E: 2, D→Z: 6 - E→Z: 3

I am studying graph theory and I need to understand minimum spanning trees (MST). A spanning tree of a connected, undirected graph is a subgraph that is a tree and includes all vertices. I know two algorithms: 1. Kruskal's algorithm: Sort edges by weight, add edges one by one if they don't form a cycle 2. Prim's algorithm: Start from a vertex, repeatedly add the smallest edge connecting the tree to a vertex outside My questions: 1. Why do these algorithms work (correctness proof)? 2. What are the time complexities of each? 3. When should I use Kruskal vs Prim? 4. How do I detect cycles efficiently in Kruskal's algorithm? 5. Can I apply MST to a real-world problem like designing a fiber optic network connecting cities? For example, find the MST of the graph with vertices A-F and edges: AB:4, AC:2, BC:1, BD:5, CD:8, CE:10, DE:2, DZ:6, EZ:3.

I am studying complex analysis and I need to understand conformal mappings — angle-preserving transformations of the complex plane. I know that any analytic function with non-zero derivative is conformal (preserves angles). The key examples are: - w = z + a (translation) - w = e^(iθ) z (rotation) - w = kz (scaling) - w = 1/z (inversion) - w = z² (maps upper half-plane to whole plane minus a slit) My specific questions: 1. How do I find a conformal map from the unit disk |z| < 1 to the upper half-plane Im(w) > 0? 2. What is the Möbius transformation w = az + b/cz + d and how do I determine its parameters? 3. How do I map a strip 0 < Im(z) < π to the upper half-plane? 4. What is the Riemann mapping theorem and why is it important? I want concrete formulas with explanations.

I am studying complex analysis and I learned the argument principle: 1/2π i ∮_C f'(z)/f(z) dz = N - P where N is the number of zeros inside C, P is the number of poles inside C (counting multiplicities), and f is meromorphic on and inside C. My questions: 1. What is the intuition behind this formula? Why does f'(z)/f(z) capture zeros and poles? 2. How can I use Rouché's theorem to determine the number of zeros of f(z) = z⁵ + 3z² + 1 in |z| < 1? 3. What is a concrete application of the argument principle in control theory or signal processing? 4. How does the argument principle relate to the winding number? I need examples that show the practical use of these powerful theorems.

I am learning complex analysis and I need to compute residues for applying the residue theorem. For a simple pole at z₀, the residue is: Res(f, z₀) = \lim_(z → z₀) (z - z₀) f(z) For a pole of order m at z₀, the formula is: Res(f, z₀) = 1/(m-1)! \lim_(z → z₀) \frac d^(m-1) dz^(m-1) [(z - z₀)^m f(z)\ ight] I need help with: 1. Computing Res(e^z/z² + 1, i\ ight) — a simple pole 2. Computing Res(1/(z-1)²(z-2), 1\ ight) — a pole of order 2 3. Are there shortcuts for rational functions? I also want to understand what the residue represents geometrically.