Evaluate the limit lim_{x→0} (sin 3x)/(5x).
- 3/5 Correct answer.
- 5/3
- 1
- 0
Explanation
Use the standard limit lim_{u→0} (sin u)/u = 1. Rewrite (sin 3x)/(5x) as (3/5)·(sin 3x)/(3x), and since 3x→0 the second factor tends to 1, leaving 3/5.
One question at a time. Build your GRE Math Subject Test understanding.
First 50 of 200 questions. Each one lists the choices, the correct answer, and an explanation. The checker at the top of this page saves progress in this browser when it is available.
Continue in the practice tool above to load more questions, 50 at a time.
Use the standard limit lim_{u→0} (sin u)/u = 1. Rewrite (sin 3x)/(5x) as (3/5)·(sin 3x)/(3x), and since 3x→0 the second factor tends to 1, leaving 3/5.
There are 36 equally likely ordered outcomes. The favorable pairs are (1,6),(2,5),(3,4),(4,3),(5,2),(6,1), six in total, so the probability is 6/36 = 1/6.
Row reduction shows the second row is twice the first, so the rank is 2 and the null space is one-dimensional. Solving x + 2y + 3z = 0 with y + z = 0 gives y = -z and x = -z, so the null space is spanned by (1,1,-1).
Partial fractions give 1/(n(n+1)) = 1/n − 1/(n+1), so the N-th partial sum telescopes to 1 − 1/(N+1). Letting N→∞ yields 1.
The derivative is f'(x) = 3x² − 3 = 3(x−1)(x+1), which is positive exactly when |x| > 1. Hence f increases on (-∞,-1) and on (1,∞).
Compute powers of 2 modulo 7: 2¹=2, 2²=4, 2³=8≡1. The smallest positive exponent giving 1 is 3, so the order is 3.
Integrating by parts with u = x and dv = e^x dx gives ∫x e^x dx = x e^x − e^x. Evaluating from 0 to 1 gives (e − e) − (0 − 1) = 1.
An element k generates Z/12Z exactly when gcd(k,12) = 1. The residues coprime to 12 are 1, 5, 7, 11, so there are φ(12) = 4 generators.
The ratio test gives |x^{n+1}/3^{n+1}| / |x^n/3^n| = |x|/3, which is less than 1 exactly when |x| < 3. Thus the radius of convergence is 3.
Independence gives P(A ∩ B) = 0.4 × 0.5 = 0.2. Then P(A ∪ B) = P(A) + P(B) − P(A ∩ B) = 0.4 + 0.5 − 0.2 = 0.7.
The sine function has bounded derivative |cos x| ≤ 1, so it is Lipschitz and hence uniformly continuous on (0,1). The other functions blow up or have unbounded oscillation near an endpoint.
The matrix is lower triangular, so its determinant equals the product of the diagonal entries: 2 × 3 × 6 = 36.
Polynomials are continuous everywhere, so f is continuous. However, f is not uniformly continuous on R because points x and x + 1/x can be arbitrarily close while their images differ by about 2.
Euclid's algorithm gives 132 = 1·84 + 48, 84 = 1·48 + 36, 48 = 1·36 + 12, 36 = 3·12 + 0, so the gcd is 12.
The trace of a matrix equals the sum of its eigenvalues. Here the trace is 3 + 5 = 8, and since A is upper triangular the eigenvalues are 3 and 5, whose sum is 8.
The integrand separates: ∫₀¹∫₀¹ xy dy dx = (∫₀¹ x dx)(∫₀¹ y dy) = (1/2)(1/2) = 1/4.
In S₃ the transpositions (1 2) and (2 3) do not commute, so S₃ is nonabelian. The other three groups listed are all abelian.
Squares mod 5 of the residues 0,1,2,3,4 are 0,1,4,4,1 respectively. So the image is {0,1,4}; the residues 2 and 3 are not quadratic residues mod 5.
Use the standard limit lim_{n→∞}(1 + a/n)^n = e^a with a = 3, giving e³. Equivalently, take logarithms: n·ln(1 + 3/n) → 3.
The matrix sends (1,0) to (0,1) and (0,1) to (−1,0), which is exactly a 90° counterclockwise rotation. Its determinant is 1 and it preserves lengths.
The terms 1/√n decrease to 0, so the alternating series test gives convergence. However, the series of absolute values is the p-series with p = 1/2, which diverges, so convergence is conditional.
The gradient is (2xy, x²), which at (1,2) equals (4,1). The directional derivative is the dot product (4,1)·(3/5,4/5) = 12/5 + 4/5 = 16/5.
The exponent of (λ−2) in the characteristic polynomial is the algebraic multiplicity of the eigenvalue 2, which is therefore 3. Geometric multiplicity is at most algebraic multiplicity but need not equal it, so diagonalizability is not guaranteed.
For 0 ≤ x < 1, x^n → 0, while at x = 1, x^n = 1 for all n. The pointwise limit is 0 on [0,1) and 1 at x = 1, which is discontinuous, so convergence is not uniform.
Since 35 = 5·7 with 5 not dividing 7−1, Sylow's theorems force a unique normal Sylow 5-subgroup and a unique normal Sylow 7-subgroup, giving G ≅ Z/5Z × Z/7Z ≅ Z/35Z.
Rationalize by multiplying numerator and denominator by the conjugate: 1/(1+√2) = (1−√2)/((1+√2)(1−√2)) = (1−√2)/(1−2) = (1−√2)/(−1) = √2 − 1. Since √2 − 1 = (−1) + 1·√2, it lies in the field as required.
For m > n, the triangle inequality gives |a_m − a_n| ≤ sum of 2^{−k} for k from n to m−1, which is less than 2^{1−n}. This tends to 0, so the sequence is Cauchy, and in the complete space R every Cauchy sequence converges. Monotonicity is irrelevant to this argument.
The map D² sends a polynomial to its second derivative, and D²p = 0 exactly when p has degree at most 1. The polynomials of degree at most 1 form a span of {1, x}, which has dimension 2. Hence the kernel of D² is two-dimensional.
An element of S₄ has order 2 exactly when its cycle type is a product of disjoint transpositions: either one transposition or two disjoint transpositions. There are C(4,2) = 6 single transpositions and 3 double transpositions, giving 9 elements in total.
An element a of Z/nZ is a zero divisor exactly when gcd(a, n) > 1 and a is nonzero. Since gcd(6, 20) = 2, the element 6 is a zero divisor (for instance 6·10 ≡ 0 mod 20). The other listed residues are coprime to 20 and hence are units.
The number of trials until the first success in independent trials with success probability p = 1/6 is geometric, with mean 1/p = 6 and variance (1−p)/p² = (5/6)/(1/36) = 30. So the variance is 30, not the mean.
On a closed interval the extremes occur at critical points or endpoints. Here f′(x) = 3x² − 3 vanishes at x = ±1; evaluating gives f(−1) = 2, f(1) = −2, f(−2) = −2, and f(2) = 2. The maximum value 2 is attained at both x = −1 and x = 2, but x = 2 is offered as a separate option, so only x = −1 among the listed interior candidates is a maximizer that is not also an endpoint competitor listed separately; f(−1) = 2 equals f(2) = 2, and among the options the maximum value 2 is achieved at x = −1.
The characteristic polynomial is (λ−2)², so the only eigenvalue is 2. The eigenspace for λ = 2 is one-dimensional, since A − 2I has rank 1, so the geometric multiplicity is 1 while the algebraic multiplicity is 2. Non-diagonalizability with a single eigenvalue means one Jordan block of size 2.
The function |x| is even, so its Fourier sine coefficients, which involve the integral of an odd integrand over a symmetric interval, all vanish. Its cosine coefficients do not all vanish, since f is not the zero function and is continuous, so its Fourier series converges to f. Hence the sine coefficients vanish and the cosine coefficients are nonzero.
Conditioning on the first flip being heads, exactly 4 of the remaining 9 flips must be heads. The conditional probability is C(9,4)/2⁹ = 126/512 = 63/256. The unconditional probability C(10,5)/2¹⁰ = 252/1024 is different because the conditioning changes the sample space.
On the disk, f(x, y) = x² + y² ≤ 1 by definition of the constraint, and equality holds at every boundary point such as (1, 0). The interior critical point (0, 0) gives the minimum value 0. Thus the maximum is 1, attained on the unit circle.
A simple graph on 4 labeled vertices is determined by choosing which of the C(4,2) = 6 possible edges are present. Each of the 6 edges is independently present or absent, giving 2⁶ = 64 labeled graphs. The count 11 refers to unlabeled graphs up to isomorphism, which is a different question.
The integrand 1/z is analytic except at z = 0, which lies inside the circle |z| = 2. The residue at the simple pole z = 0 is 1, and the residue theorem gives 2πi times the residue, namely 2πi.
Scaling an n×n matrix by a scalar c multiplies the determinant by cⁿ, because each of the n rows is scaled. Here n = 3 and c = 2, so det(2A) = 2³·det(A) = 8·5 = 40.
For a uniform density 1/2 on [0, 2], M_X(t) = E[e^{tX}] = (1/2)∫₀² e^{tx} dx = (1/2)·(e^{2t} − 1)/t. This simplifies to (e^{2t} − 1)/(2t), which tends to 1 as t → 0, as any moment generating function must.
Divide 2024 by 748: 748·2 = 1496, and 2024 − 1496 = 528. So the first remainder is 528. The algorithm then continues with the pair (748, 528), producing the next remainder 220.
In R² compactness is equivalent to being closed and bounded. The closed unit disk is closed (it is the preimage of a closed set under a continuous map) and bounded, so it is compact. The other sets fail one of these conditions.
The intersection H ∩ K is a subgroup of H, so by Lagrange's theorem its order divides 6; being also a subgroup of K, its order divides 10. The common divisors of 6 and 10 are 1 and 2, so the order of the intersection is 1 or 2, and further information would be needed to decide which.
The intermediate value theorem applies to the continuous function f on the interval [0, 1]: since 1/2 lies between f(0) = 0 and f(1) = 1, there is some c in (0, 1) with f(c) = 1/2. Continuity alone does not imply differentiability, monotonicity, or the location of extrema.
Since 1/(n² + n) is asymptotic to 1/n² and the p-series with p = 2 converges, the comparison test gives convergence. In fact 1/(n² + n) = 1/n − 1/(n+1), so the series telescopes to 1.
The rank-nullity theorem states that rank(T) + nullity(T) equals the dimension of the domain. Here the domain has dimension 3 and the rank is 2, so the nullity, which is the dimension of the kernel, equals 3 − 2 = 1.
By the rational root theorem, any rational root of a monic integer polynomial is an integer dividing the constant term 2, so the candidates are ±1 and ±2. Evaluating gives 1 − 4 + 2 = −1, −1 + 4 + 2 = 5, 32 − 8 + 2 = 26, and −32 + 8 + 2 = −22, none of which is zero. Hence the polynomial has no rational roots.
If Av = λv with v ≠ 0, then A²v = λ²v, while A²v = Av = λv, so λ² = λ and λ is 0 or 1. If 0 were not an eigenvalue, then A would be invertible; multiplying A² = A by A⁻¹ gives A = I, contrary to hypothesis. Hence 0 is an eigenvalue as well.
The difference quotient at 0 is (f(h) − f(0))/h = h sin(1/h), whose absolute value is at most |h| and hence tends to 0 as h → 0. So f is differentiable at 0 with derivative 0. The oscillatory factor sin(1/x) is bounded, which is what tames the behavior near the origin.
The second supplement to quadratic reciprocity states that (2/p) = 1 when p ≡ ±1 mod 8 and (2/p) = −1 when p ≡ ±3 mod 8. Since p ≡ 1 mod 8 falls in the first case, 2 is a quadratic residue modulo p and the symbol equals 1.