instruction_seed
stringlengths
120
1.22k
source
stringclasses
1 value
embeddings
listlengths
1.02k
1.02k
mean_positive_score
float64
0.78
0.86
mean_negative_score
float64
0.76
0.83
difference_score
float64
0.02
0.04
Given a geodesic segment defined by points \( p_0 = (x_0, y_0, z_0) \) and \( p_1 = (x_1, y_1, z_1) \) on the surface of a unit sphere, where \( p_0 \) and \( p_1 \) are not opposite each other, determine the necessary and sufficient conditions under which a point \( p = (x, y, z) \) lies on the shorter geodesic path b...
automath
[ -0.015392743982374668, 0.029904862865805626, -0.023148387670516968, -0.0493001788854599, 0.01745549403131008, -0.014904331415891647, -0.019852805882692337, 0.049449559301137924, 0.03544960916042328, 0.00816606730222702, 0.00740019092336297, 0.027198007330298424, 0.0023608480114489794, -0.0...
0.818873
0.795133
0.02374
Consider the dynamical system given by $$\begin{cases} \dot x = y - \varepsilon (x^2+y^2)x \\ \dot y = -x - \varepsilon (x^2+y^2)y \end{cases}$$ where $\varepsilon$ is a small parameter. If $(x(t), y(t)) = (\cos t, \sin t)$ is a periodic solution with period $T = 2\pi$, and the matrix $d\phi_0^T(x_0)$ has eigenvalue...
automath
[ 0.013969482854008675, 0.02374790422618389, -0.03710220381617546, -0.03739311918616295, 0.034863997250795364, -0.009665456600487232, -0.03133688122034073, 0.09855563938617706, 0.018467208370566368, -0.010657860897481441, -0.010718254372477531, 0.027804197743535042, -0.03419594094157219, -0....
0.801514
0.781185
0.020328
Let \( E \) be a metric space that is purely \( k \)-unrectifiable. If every countably \( \mathcal{H}^k \)-rectifiable subset \( S \) of \( E \) satisfies \( \mathcal{H}^k(S) = 0 \), what can be said about the \( k \)-dimensional Hausdorff measure of the entire space \( E \) in relation to \( k \)-rectifiability? Speci...
automath
[ 0.021631548181176186, 0.03373938798904419, -0.01271559577435255, -0.04322908818721771, 0.03841828927397728, -0.02119111828505993, -0.005204604472965002, 0.06177666783332825, 0.047178175300359726, -0.010873261839151382, 0.012009883299469948, 0.04071524366736412, -0.00869368202984333, -0.021...
0.815883
0.797154
0.018729
Suppose that for every integer \( k \), the series \( \sum_{n=0}^\infty \frac{a_{k+n}}{n!} = e \) holds true. Does this imply that \( \lim_{k \to \infty} a_k = 1 \)? If not, provide a counterexample or justify your reasoning.
automath
[ 0.006791817024350166, 0.03450758382678032, -0.026545951142907143, -0.04607768729329109, 0.04132477194070816, -0.022780245169997215, 0.0023125424049794674, 0.055258121341466904, 0.030871408060193062, -0.03480200842022896, 0.0021467581391334534, 0.022322893142700195, -0.04176458716392517, -0...
0.834257
0.818084
0.016173
Let \( A \) be a \( m \times n \) matrix, and suppose \( Az = y \) for some vector \( z \in \mathbb{R}^n \) and \( A^T x = 0 \) for some vector \( x \in \mathbb{R}^m \). Which of the following statements must be true? 1. \( x^T y = 0 \) 2. \( \|x\|_2 = \|y\|_2 \) 3. \( \|x\|_2 < \|y\|_2 \) 4. \( x = ay \) for some rea...
automath
[ 0.0443556047976017, 0.04450659453868866, -0.03132331371307373, -0.047067102044820786, 0.06077570095658302, -0.020463459193706512, -0.015441621653735638, 0.0714116171002388, 0.03242335096001625, -0.020721444860100746, -0.003208486596122384, 0.01083543710410595, -0.0407445952296257, -0.01461...
0.827916
0.807249
0.020667
Given an abelian group \( G \) and rings \( A, B \), consider the cup product \( H^p(G; A) \otimes H^q(G; B) \to H^{p+q}(G; A \otimes B) \). Using the axiomatic approach to cup products in group cohomology, define a specific example with \( G = \mathbb{Z}/2\mathbb{Z} \) and \( A = B = \mathbb{Z} \). What can you say ab...
automath
[ 0.024607371538877487, 0.03486275672912598, -0.01602824218571186, -0.013568883761763573, 0.01369678694754839, -0.028896238654851913, -0.012904489412903786, 0.06919053196907043, 0.030690088868141174, -0.007803027518093586, 0.00428781658411026, 0.007738283835351467, -0.02027774415910244, -0.0...
0.811119
0.788125
0.022994
Let \( R \) be the relation on \( \mathbb{Z} \times \mathbb{Z} \) defined by \[ R = \{((a, b), (c, d)) \in \mathbb{Z} \times \mathbb{Z} : a + 3b = c + 3d\}. \] Determine whether \( R \) is an equivalence relation by verifying its reflexivity, symmetry, and transitivity properties. After doing so, find the equivalenc...
automath
[ 0.057103510946035385, 0.022233720868825912, -0.035854242742061615, -0.036355867981910706, 0.046654775738716125, -0.0110327685251832, 0.012334661558270454, 0.06476332992315292, 0.02609226666390896, -0.018701743334531784, 0.012525674887001514, 0.020507069304585457, -0.0390821173787117, -0.02...
0.830206
0.809485
0.020722
Let \( F \) be the set of families with two representatives each, denoted as \( R_1 \) and \( R_2 \), where \( R_1 \) and \( R_2 \) belong to the same family. Suppose we define a function \( f: F \to X \) such that \( f(R_1) \) is the eye color of one representative and \( f(R_2) \) is the eye color of another. If we h...
automath
[ 0.02183879353106022, 0.03425239026546478, -0.04745030030608177, -0.02536705695092678, 0.03386739641427994, -0.014329868368804455, -0.013162706978619099, 0.06197105348110199, 0.03862462937831879, -0.005590931512415409, 0.010688391514122486, 0.02250143140554428, -0.01823868602514267, -0.0130...
0.82422
0.807044
0.017176
Let \( f_n : \mathbb{N} \to \mathbb{R} \) be defined by \[ f_n(s) = \begin{cases} \frac{1}{n} & \text{if } 1 \leq s \leq n \\ 0 & \text{if } s > n \end{cases} \] and let \( f : \mathbb{N} \to \mathbb{R} \) be defined by \( f(s) = 0 \) for all \( s \geq 1 \). 1. Does the sequence of functions \( \{ f_n \} \) conver...
automath
[ 0.02519897371530533, 0.034543588757514954, -0.042996909469366074, -0.02484559454023838, 0.03662929683923721, -0.009719576686620712, -0.03178327530622482, 0.06094389781355858, 0.016495531424880028, 0.01366912480443716, -0.008002327755093575, 0.016861235722899437, -0.028163224458694458, -0.0...
0.825888
0.801341
0.024547
Given two ordered sets \(A\) and \(B\), with their respective order relations \(<_A\) and \(<_B\), let \( (a_1, b_1), (a_2, b_1), (a_3, b_1), (a_1, b_3) \) be elements of \(A \times B\) where \(a_1, a_2, a_3 \in A\) and \(b_1, b_3 \in B\). 1. What is the condition required for \( (a_1, b_1) < (a_2, b_1) \) to hold tr...
automath
[ 0.04334581270813942, 0.023938177153468132, -0.03793107718229294, -0.03245237469673157, 0.02169225923717022, -0.01450941152870655, -0.025080380961298943, 0.04751008003950119, 0.021298540756106377, 0.004634140059351921, -0.0004371079267002642, 0.01931585744023323, -0.041777774691581726, 0.00...
0.820786
0.803597
0.017189
Can you provide an example of a Lebesgue nonmeasurable set \( N \) in the interval \([0, 1]\), and explain why the set \( N \times \{0\} \) in \(\mathbb{R}^2\) is Lebesgue measurable while the function \( f(x) = (x, 0) \) fails to be Lebesgue measurable?
automath
[ 0.020518075674772263, 0.04134795069694519, -0.0337609127163887, -0.0438135489821434, 0.029331373050808907, 0.004049223382025957, -0.03658663481473923, 0.06075681746006012, 0.037859246134757996, 0.011518297716975212, 0.03119194693863392, -0.002876797690987587, -0.03405683860182762, -0.01545...
0.805788
0.787885
0.017903
Consider two closed sets \( A \) and \( B \) in \( \mathbb{R}^2 \) defined as follows: - Let \( A \) be the vertical line given by \( x = 0 \), which includes all points of the form \( (0, y) \) for \( y \in \mathbb{R} \). - Let \( B \) be the graph of the function \( f \) defined on the interval \( [0, 1) \) by \( f(...
automath
[ 0.020529869943857193, 0.04005509242415428, -0.049066077917814255, -0.03650464490056038, 0.0298061054199934, -0.014332783408463001, -0.017220694571733475, 0.0712071880698204, 0.039990417659282684, -0.01180015504360199, 0.004918936640024185, 0.025120507925748825, -0.011787313967943192, -0.00...
0.817615
0.786344
0.031271
In the context of category theory, consider a sequence of functors defined as follows: let \( F_0 : C \to D \) have a left adjoint \( G_0 : D \to C \); let \( F_1 : C \to D \) have a left adjoint \( G_1 : D \to C \); and continue this process indefinitely. If such a sequence of functors exists, under what conditions wi...
automath
[ 0.03803107514977455, 0.020912544801831245, -0.02971879206597805, -0.015136119909584522, 0.03152313828468323, -0.017491335049271584, -0.024007873609662056, 0.07774163782596588, 0.01804012805223465, -0.00633413577452302, -0.0031675039790570736, 0.04167309030890465, -0.02330133318901062, -0.0...
0.815558
0.7919
0.023657
In the context of quantifiers in logic, consider the following statements: 1. $$\forall x \in \mathbb{R}, \forall y \in \{ z \in \mathbb{R} \mid z = x + 3 \}, p(x, y)$$ 2. $$\exists y \in \{ z \in \mathbb{R} \mid z = x + 3 \}, \forall x \in \mathbb{R}, p(x, y)$$ What specific logical implications or properties distin...
automath
[ 0.0330050028860569, 0.019023697823286057, -0.04503607004880905, -0.018145164474844933, 0.02557302638888359, -0.015084384940564632, -0.015565633773803711, 0.0714508444070816, 0.042358141392469406, -0.03132977709174156, 0.016682373359799385, 0.024191386997699738, -0.03397789224982262, 0.0017...
0.804541
0.785525
0.019016
Given independent and identically distributed random variables \( X_1, \ldots, X_n \) with distribution \( F \), mean \( \mu \), median \( \theta \), and variance \( \sigma^2 \), we know that the sample mean \( \hat{\mu}_n \) and the sample median \( \hat{\theta}_n \) satisfy the central limit theorems: \[ \sqrt{n} (\...
automath
[ 0.010459736920893192, 0.028388647362589836, -0.05754509195685387, -0.02190515398979187, 0.038800764828920364, -0.013063742779195309, -0.034344714134931564, 0.0722239762544632, 0.03368878737092018, -0.01657315529882908, -0.011113502085208893, 0.02876180224120617, -0.03938284143805504, -0.00...
0.815576
0.799037
0.01654
Let \( f(z) = \frac{z}{|z|^2} \) where \( z = x + iy \). Determine the values of \( z \) in the complex plane where \( f(z) \) is differentiable. Specifically, calculate the total number of distinct points (in terms of \( (x, y) \) coordinates) where the Cauchy-Riemann equations are satisfied, and classify the differen...
automath
[ 0.027034450322389603, 0.04787538945674896, -0.04364229366183281, -0.04078589752316475, 0.03089151903986931, -0.008397182449698448, 0.003275226568803191, 0.047394365072250366, 0.038215942680835724, 0.01650075986981392, 0.008806567639112473, 0.027415724471211433, -0.041109368205070496, -0.01...
0.816467
0.79827
0.018197
Let $\Delta = \{ x \in \mathbb{R}^d_+ : \sum_{i=1}^d x^i \leq 1 \}$ be the standard $d$-dimensional simplex. Given a finite set of points $A = \{ x_1, x_2, \ldots, x_k \} \subset \Delta$ and a point $y \in \Delta$, define the set \( C \) as described above. What is the number of extreme points in the intersection \( \D...
automath
[ 0.02400912344455719, 0.029482204467058182, -0.04048030823469162, -0.04622809216380119, 0.02273990586400032, -0.009470805525779724, -0.03125477954745293, 0.05950555205345154, 0.04892587661743164, -0.02119099348783493, 0.0048364317044615746, 0.03157738596200943, -0.01966116577386856, -0.0138...
0.850716
0.820922
0.029795
Let \( f(r) \) be a \( 2\pi \)-periodic function that is \( \alpha \)-Holder continuous with \( \alpha < 1 \). Define the principal value integral \[ I = p.v.\int_{-\infty}^\infty \frac{f(r)}{r} \, dr. \] What conditions on the function \( f \) ensure that the integral \( I \) is finite? Specifically, if \( f(r) \) ...
automath
[ 0.012239736504852772, 0.0421915128827095, -0.025494741275906563, -0.01824277639389038, 0.01259293407201767, -0.010365966707468033, -0.029839646071195602, 0.05412661284208298, 0.012623408809304237, 0.004174577537924051, -0.005316582042723894, 0.020744575187563896, -0.016676105558872223, -0....
0.820822
0.800699
0.020123
Let \( f: \mathbb{R}^2 \to \mathbb{R} \) be defined as follows: \[ f(x,y) = \begin{cases} \frac{xy}{x^2+y^2} & \text{if } (x,y) \neq (0,0), \\ 0 & \text{if } (x,y) = (0,0). \end{cases} \] Compute the partial derivatives \( \frac{\partial f}{\partial x} \) and \( \frac{\partial f}{\partial y} \) at all points in \(...
automath
[ -0.00208123866468668, 0.054253872483968735, -0.032070670276880264, -0.03412032499909401, 0.032937075942754745, -0.005688629578799009, -0.00018643902149051428, 0.0696176290512085, 0.04634399339556694, -0.013014320284128189, 0.0035762544721364975, 0.02536584809422493, -0.025338130071759224, ...
0.80244
0.775044
0.027396
Given a sequence of numbers \( a_n \) such that \( \lim_{n\to\infty} \prod_{k=1}^n a_k = 0 \), if \( \norm{a_n} \) denotes the absolute value of \( a_n \), what can we conclude about \( \lim_{n\to\infty} \prod_{k=1}^n \norm{a_k} \)? Provide a rigorous justification for your conclusion.
automath
[ 0.017604077234864235, 0.039900463074445724, -0.022854309529066086, -0.016219645738601685, 0.014657656662166119, -0.018089517951011658, -0.037633370608091354, 0.06116194278001785, 0.025329353287816048, -0.01955081708729267, -0.018235186114907265, 0.03296731784939766, -0.0487484410405159, -0...
0.833712
0.813276
0.020436
Given an observation vector \( x_i \) in \( \mathbb{R}^n \) and a unit vector \( w \) in the same space, what is the geometric interpretation of \( a_i = w^T x_i \), and how can it be understood as a projection of \( x_i \) onto the direction defined by \( w \)? Additionally, compute the value of \( a_i \) if \( w = \b...
automath
[ 0.004178858362138271, 0.04068374261260033, -0.048139140009880066, -0.04798594117164612, 0.03869294002652168, -0.014842445030808449, -0.03408607468008995, 0.0799563005566597, 0.05583610758185387, 0.0024501709267497063, 0.005138440057635307, 0.008909768424928188, -0.027509763836860657, -0.02...
0.811962
0.794975
0.016987
Let \( \mathcal{I} \) be a \( \sigma \)-ideal on a set \( X \). If it is known that \( \text{add}(\mathcal{I}) = \aleph_1 \), \( \text{cov}(\mathcal{I}) = \aleph_2 \), and \( \text{cof}(\mathcal{I}) = \aleph_3 \), what can be determined about the relationship between these cardinal characteristics of the \( \sigma \)-i...
automath
[ 0.04154389724135399, 0.0328499972820282, -0.03226723149418831, -0.03414596617221832, 0.038340505212545395, -0.011377638205885887, -0.007814031094312668, 0.08086876571178436, 0.02515752986073494, -0.020822996273636818, 0.005818111822009087, 0.015016727149486542, -0.057908061891794205, -0.01...
0.821532
0.801051
0.020481
Given a cuboid defined by the inequalities \(|x| \leq N\), \(|y| \leq N\), and \(|z| \leq N\) where \(N\) can be up to \(10^9\), determine the number of distinct integer points \((a,b,c)\) on the surfaces of the cuboid such that the line segment from the origin \((0,0,0)\) to the point \((a,b,c)\) contains at least \(M...
automath
[ 0.019802875816822052, 0.040615685284137726, -0.047929197549819946, -0.021653354167938232, 0.026196930557489395, -0.020578792318701744, -0.02520977146923542, 0.051458247005939484, 0.032855816185474396, -0.0002648086519911885, -0.0022746389731764793, 0.03402261435985565, -0.014230254106223583,...
0.846215
0.82097
0.025245
Suppose \( p(x) \) is a univariate polynomial of degree \( n \) that has at least one real root. Can you describe a systematic method to find all the real roots of \( p(x) \) numerically, considering factors such as the use of Descartes' Rule, Sturm's Theorem, Newton's method, and interval searching techniques? Specifi...
automath
[ 0.014531019143760204, 0.033148523420095444, -0.03592837229371071, -0.029472997412085533, 0.0012933441903442144, -0.040235307067632675, 0.014695139601826668, 0.038958821445703506, 0.007317627314478159, -0.006860052235424519, 0.01749398186802864, 0.03680083528161049, -0.034012570977211, -0.0...
0.816668
0.799449
0.017219
In a Noetherian ring \( A \), let \( \mathfrak{a} \) be an ideal and \( x \in A \). When considering the set \( (\mathfrak{a}:x) = \{ r \in A : rx \in \mathfrak{a} \} \), why can we assume that \( \mathfrak{a} = 0 \) when analyzing the prime ideals contained in \( (\mathfrak{a}:x) \)? Could you provide a detailed expla...
automath
[ 0.052733905613422394, 0.04267492890357971, -0.024113813415169716, -0.01998947188258171, 0.024541053920984268, -0.02123035117983818, 0.011972314678132534, 0.06780049204826355, 0.04818788543343544, -0.01596040278673172, -0.008719399571418762, -0.0004589063173625618, -0.0310174822807312, -0.0...
0.812339
0.787823
0.024516
Let \( N \in \mathbb{N} \), and suppose \( \phi \) is a submeasure on the set \([1, N] = \{1, 2, \dots, N\}\) that satisfies the following conditions: 1. If \( A \subseteq B \), then \( \phi(A) \leq \phi(B) \). 2. \( \phi(A \cup B) \leq \phi(A) + \phi(B) \) for any \( A, B \subseteq [1,N] \). 3. \( \phi(\emptyset) = 0...
automath
[ 0.02128051407635212, 0.015151084400713444, -0.03139003738760948, -0.010278061963617802, 0.042417436838150024, 0.004395023919641972, -0.029754670336842537, 0.05131341144442558, 0.037110939621925354, 0.0013478315668180585, -0.001303123659454286, 0.02149563655257225, -0.04091883450746536, 0.0...
0.829663
0.793335
0.036328
Consider the set \(I_n = \{2^n + 1, 2^n + 2, 2^n + 3, \dots, 2^{n+1}\}\). How many Fibonacci numbers are in the sequence \(I_n\) for a given \(n\)? Based on your calculations, determine an exact expression for the number of Fibonacci numbers \(F_k\) such that \(2^n < F_k \leq 2^{n+1}\).
automath
[ 0.03684386983513832, 0.02914539724588394, -0.05340757220983505, -0.01812155358493328, 0.05014113336801529, -0.020902547985315323, -0.03723933547735214, 0.07274100184440613, 0.021444158628582954, -0.008923670276999474, 0.011254092678427696, 0.03296699747443199, -0.047656793147325516, -0.014...
0.836081
0.817478
0.018603
Consider a countable collection of open intervals whose lengths sum to a finite value. If the outer measure \( m^* \) of the union of these intervals is equal to the sum of their individual outer measures, what can be concluded about the measure of their intersection? Specifically, if the lengths of the intervals are \...
automath
[ 0.03006688505411148, 0.016430431976914406, -0.04242026060819626, -0.028542542830109596, 0.022546984255313873, 0.0075740329921245575, -0.035714827477931976, 0.033656589686870575, 0.04586713761091232, -0.008672289550304413, 0.015826905146241188, 0.01736667938530445, -0.03663419559597969, -0....
0.820739
0.791297
0.029441
Let \( W = \{ (x, y) \in \mathbb{R}^2 : y = ax, \, a \text{ is an integer} \} \). Determine whether \( W \) is a subspace of \( \mathbb{R}^2 \) for the case when \( a \) can be any integer (not fixed). If it is not a subspace, provide an example that demonstrates the failure of one of the subspace criteria.
automath
[ 0.010648345574736595, 0.03130897507071495, -0.022497428581118584, -0.04327137768268585, 0.03560242801904678, -0.007986156269907951, 0.0018624606309458613, 0.07440735399723053, 0.04372838884592056, 0.001875544199720025, 0.025550194084644318, 0.027457870543003082, -0.03341888263821602, -0.02...
0.823341
0.803873
0.019468
Evaluate the limits: 1. \( \lim_{n \to \infty} \left( \sqrt{n^2+n} - n \right) \) 2. \( \lim_{n \to \infty} \frac{|\cos(\frac{n\pi}{2}) + \sin(\frac{n\pi}{2})|(2n-1)}{n+2} \) Determine whether each limit converges or diverges, and find the value of those that converge.
automath
[ 0.011618377640843391, 0.04040941968560219, -0.030863333493471146, -0.028545161709189415, 0.03075796738266945, -0.02213158831000328, -0.02399054542183876, 0.05523835867643356, 0.02904304675757885, 0.010921345092356205, 0.01343495398759842, 0.024632470682263374, -0.029070857912302017, -0.020...
0.829146
0.807772
0.021374
Given a sly number \( A \) represented as an array of \( N \) integers from the set \{0, 1, 2\}, where \( A[0] = 1 \) and \( A[i] = 0 \) for \( i = 1, 2, \ldots, N-1 \), and a positive integer \( Q \) such that \( 2 \leq Q \leq 100 \), determine if there exists an inverse sly number \( B \) such that the result of the ...
automath
[ 0.013131996616721153, 0.05838315933942795, -0.01712954044342041, -0.03364816680550575, 0.03593636676669121, -0.022093582898378372, -0.017787080258131027, 0.0662156343460083, 0.025467758998274803, -0.0052003744058310986, 0.005515917204320431, 0.006183435209095478, -0.045643728226423264, -0....
0.827341
0.809487
0.017854
Given two circles with radii \( R_1 \) (larger circle) and \( R_2 \) (smaller circle), where the smaller circle is tangent to the larger circle at one point, derive a formula for the distance \( X \) between the two circles, measured at the radius of the larger circle, as a function of the angle \( \theta_1 \) (the ang...
automath
[ 0.0021058835554867983, 0.0484602265059948, -0.04467703774571419, -0.03767972066998482, 0.025872811675071716, 0.0027564705815166235, -0.0338171124458313, 0.047659628093242645, 0.028345804661512375, 0.002201483119279146, 0.025958359241485596, 0.01792667806148529, -0.036469731479883194, 0.017...
0.812772
0.792368
0.020404
Given a continuous function \( g : \mathbb{R} \to \mathbb{R} \) such that \( g(t) \) is non-negative for \( t \in [a, b] \) and \( g(t) \) is integrable over the interval, define the recursive sequence \( z_0 = \int_{a}^{b} g(t) \, dt \) and \( z_{i+1} = F(z_i) \) where \( F(z) = \int_{-z}^{z} g(t) \, dt \). What con...
automath
[ 0.027517231181263924, 0.03916057571768761, -0.026081416755914688, -0.025484323501586914, 0.04647953808307648, -0.0016770485090091825, -0.011558949947357178, 0.0670219361782074, 0.022424887865781784, 0.0006482183816842735, 0.012473020702600479, -0.0005729218828491867, -0.03111414983868599, ...
0.825648
0.806483
0.019165
Given a CES utility function of the form \( U(x_1, x_2) = \frac{x_1^\rho + x_2^\rho}{\rho} \) for \( \rho > 0 \), how can we demonstrate that this function exhibits strictly convex preferences? Please provide a detailed verification of strict convexity, including a specific example with utility values for two bundles t...
automath
[ -0.005487531423568726, 0.045605193823575974, -0.043864164501428604, -0.010364643298089504, 0.004323720466345549, -0.020022621378302574, -0.007690753787755966, 0.0719025731086731, 0.04039561375975609, -0.019987350329756737, 0.010332576930522919, 0.03167376667261124, -0.00889221578836441, -0...
0.813234
0.795194
0.01804
Consider an ellipse centered at the origin in the vertical plane defined by the equation \(\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1\). If an arbitrary point \(P\) lies on the vertical axis at a distance \(h\) from the center of the ellipse, express the solid angle \(\Omega\) subtended by the ellipse at the point \(P\) as ...
automath
[ -0.0007557226927019656, 0.03762081637978554, -0.047207947820425034, -0.04215515777468681, 0.03049582615494728, -0.01610216498374939, -0.008404986001551151, 0.0635349228978157, 0.053556911647319794, -0.001990199787542224, 0.016838854178786278, 0.021492015570402145, -0.027100015431642532, -0...
0.820531
0.801829
0.018703
Let \( X \) be a metrizable space with topology \( \tau \) and \( Y \) be a metric space with metric \( d \). If there exists a continuous function \( f : X \to Y \) that is non-expansive (i.e., such that \( d(x, x') \geq d(f(x), f(x')) \) for all \( x, x' \in X \)), what can we conclude about the relationship between ...
automath
[ 0.020638253539800644, 0.03449118882417679, -0.060773491859436035, -0.03970647230744362, 0.021871665492653847, 0.00786514487117529, -0.007139154709875584, 0.06533174961805344, 0.05304783210158348, -0.010041470639407635, 0.01900390163064003, 0.018332289531826973, -0.02807285264134407, -0.006...
0.803804
0.775839
0.027965
Let \( G = \langle a, b \mid R \rangle \) be a group defined by generators \( a \) and \( b \) and a set of relations \( R \). Suppose there is a group action of \( G \) on a finite set \( X \). If \( |X| = n \) and \( a \) and \( b \) act on \( X \) such that the action defined by \( a \) permutes the elements of \( X...
automath
[ 0.04843496158719063, 0.03315800800919533, -0.03564837947487831, -0.03480662778019905, 0.001536938943900168, -0.022664638236165047, -0.02039223350584507, 0.055747613310813904, 0.021643180400133133, -0.00786776002496481, 0.012213959358632565, 0.011976324021816254, -0.019256282597780228, -0.0...
0.816097
0.792921
0.023176
Given a continuous function \( f : [a, b] \to \mathbb{R} \) and a variable \( x \in [a, b] \), is there a change of variable \( g(u, x) \) such that the integral \[ F(x) = \int_{a}^{x} f(s) \, ds \] can be expressed as an infinite integral of the form \[ F(x) = \int_{0}^{\infty} f(g(u, x), x) \, du \] for some su...
automath
[ 0.021128827705979347, 0.05306784808635712, -0.02969319559633732, -0.03436605632305145, 0.03323526680469513, -0.007534762844443321, -0.024778254330158234, 0.06430729478597641, 0.035599227994680405, -0.006931291427463293, 0.017360594123601913, 0.002028615213930607, -0.025118669494986534, -0....
0.811906
0.793307
0.018599
In a monoidal category \( M \), let \( x, y, z \) be arbitrary objects. If the associator \( a_{x,y,z} \) satisfies the pentagon identity, how many distinct ways can you express the composition of three tensor products involving \( x, y, z \) in terms of rearranging them while maintaining the equivalences dictated by t...
automath
[ 0.042963773012161255, 0.015268268063664436, -0.032828569412231445, -0.021699758246541023, 0.025986405089497566, -0.02140641026198864, -0.034070227295160294, 0.055956099182367325, 0.04332525655627251, 0.003670901758596301, -0.0015904053580015898, 0.02438189461827278, -0.029019413515925407, ...
0.821338
0.802556
0.018782
Given a set \( S \) of \( n \) distinct elements, with \( n \) even, is it true that for any incomplete set of fresh 2-partitions \( T \) of \( S \), it is always possible to extend \( T \) to a complete fresh set of 2-partitions, ensuring no pair is repeated? In other words, can every incomplete fresh set be a subset ...
automath
[ 0.03660593181848526, 0.013674148358404636, -0.044378191232681274, -0.010091833770275116, 0.021594909951090813, -0.0278580654412508, -0.00020657556888181716, 0.06059018895030022, 0.027429895475506783, -0.021270645782351494, 0.030493395403027534, 0.012843431904911995, -0.032066602259874344, ...
0.816829
0.790751
0.026079
Given a hand-drawn curve represented as a binary image, describe an algorithm that can automatically detect and extract the pixel coordinates of the points on the curve. Additionally, determine the minimum number of endpoints (vertices of degree 1) that the algorithm should identify, and explain how it might categorize...
automath
[ -0.022916262969374657, 0.025311360135674477, -0.02518898993730545, -0.03772013634443283, 0.0203365720808506, -0.032140061259269714, -0.023043138906359673, 0.06390129029750824, 0.036724019795656204, -0.015906617045402527, -0.0022542893420904875, 0.021565906703472137, -0.025203939527273178, ...
0.811067
0.791215
0.019852
Given an array \( B = [b_1, b_2, \ldots, b_n] \), where each \( b_i \) is a positive integer, how can you construct an array \( A \) such that the sum of the absolute differences of consecutive elements, represented as \( S = \sum_{i=2}^{n} | A[i] - A[i-1] | \), is maximized, while ensuring that \( 1 \leq A[i] \leq B[i...
automath
[ 0.020235663279891014, 0.02380758337676525, -0.04288562387228012, -0.020446287468075752, 0.022699832916259766, -0.03181050345301628, -0.044548675417900085, 0.056437890976667404, 0.050420697778463364, -0.019581275060772896, 0.014575312845408916, 0.028276953846216202, -0.04464789107441902, 0....
0.827797
0.810194
0.017603
Consider the sequences defined by \( a_n = (-1)^n \frac{1}{\sqrt{n}} \) and \( b_n = n \). Determine whether the series \( \sum a_n \), given its divergence, satisfies the condition that \( \sum a_n b_n \) converges, and if so, provide a justification for the convergence or divergence of \( \sum a_n b_n \).
automath
[ 0.006586028262972832, 0.043435413390398026, -0.03866909071803093, -0.019498219713568687, 0.043850287795066833, -0.01203771773725748, -0.015701593831181526, 0.0644557923078537, 0.03520223870873451, 0.0047177583910524845, -0.0067593734711408615, 0.009937232360243797, -0.05187221243977547, -0...
0.828897
0.807503
0.021394
Given two circles, A and B, with radii of 1, where the center of circle A is chosen uniformly in the segment from (0,0) to (2,0) and the center of circle B is chosen uniformly in the segment from (0,1) to (2,1), calculate the probability P that the circles intersect. Then, find the value of \(\left\lfloor {10^4 P + 0.5...
automath
[ 0.01700018346309662, 0.02845195308327675, -0.04433272033929825, -0.016121743246912956, 0.034312617033720016, -0.021487176418304443, -0.038104888051748276, 0.027315940707921982, 0.03250892087817192, 0.009283575229346752, 0.02628924697637558, 0.021634384989738464, -0.01874677836894989, -0.01...
0.826808
0.80897
0.017838
Given points \( A = (0, 1) \), \( B = (1, 1) \), and a sequence of points \( C = (0, 0) \) and \( D_n = \left(1, \frac{1}{n}\right) \) for natural numbers \( n \), what is the maximum distance from point \( C \) to the intersection of the lines \( AB \) and \( CD_n \) as \( n \) approaches infinity?
automath
[ 0.028755296021699905, 0.02155677229166031, -0.03367093577980995, -0.03177717700600624, 0.022086896002292633, -0.0070171719416975975, -0.029365872964262962, 0.03916541114449501, 0.03589845076203346, -0.003424838650971651, 0.014057498425245285, 0.035353124141693115, -0.024487406015396118, -0...
0.839106
0.820106
0.019
Let \( M \) be the surface of a circular cone defined by the equation \( z = \sqrt{x^2 + y^2} \) for \( (x, y) \in \mathbb{R}^2 \) and consider the point \( (0, 0, 0) \) which is the vertex of the cone. What is the tangent cone \( \mathbb{T}(M, (0, 0, 0)) \) at this point, and what is its dimension?
automath
[ 0.010667212307453156, 0.04809441417455673, -0.05067247897386551, -0.048115044832229614, 0.03653373196721077, 0.0025272523052990437, -0.022600732743740082, 0.06857006251811981, 0.03458787128329277, 0.0027725284453481436, -0.01195182092487812, 0.02488262951374054, -0.03555179014801979, -0.04...
0.815709
0.795359
0.02035
Let $\Omega$ be the sample space consisting of all outcomes defined by three successive flips of a fair coin. Let event $D$ be defined as the outcomes where the second flip is a head, and event $E$ as the outcomes where the last flip is a tail. 1. Calculate the probabilities $P(D)$, $P(E)$, and $P(D \cap E)$. 2. If a...
automath
[ -0.006277966313064098, 0.01497680600732565, -0.04649835824966431, -0.027228539809584618, 0.02502010017633438, -0.002372803632169962, -0.017602970823645592, 0.06314995884895325, 0.022100258618593216, -0.0016654219944030046, 0.00619952566921711, 0.030327200889587402, -0.024171562865376472, -...
0.838003
0.811049
0.026954
Given a matrix \( N \in \mathbb{R}^{9 \times n} \) representing the null space that does not intersect with the column space of the matrix \[ M(R) = \begin{bmatrix} 0 & -r_3 & r_2 \\ r_3 & 0 & -r_1 \\ -r_2 & r_1 & 0 \end{bmatrix} \in \mathbb{R}^{9\times3}, \] where \( r_1, r_2, r_3 \in \mathbb{R}^3 \) are columns of...
automath
[ 0.0025242415722459555, 0.008007233031094074, -0.04323956370353699, -0.04528779909014702, 0.03278172016143799, 0.0030575497075915337, 0.005038099829107523, 0.06761080026626587, 0.027444105595350266, -0.007683014031499624, 0.007782247383147478, 0.016449635848402977, -0.01863853447139263, -0....
0.811789
0.787813
0.023976
Given a set of discs of radius \( r \) centered at \( n \) points in the plane, compute the area of the region covered by these discs. If the area of one disc is subtracted from the total area covered by the other discs, what is the maximum possible area that can be lost due to overlapping regions? Assume the discs are...
automath
[ 0.020412098616361618, 0.03917146101593971, -0.06305941939353943, -0.027885736897587776, 0.022722594439983368, 0.0006699443911202252, -0.02792493999004364, 0.05499929189682007, 0.03016292303800583, 0.014414442703127861, 0.007970144972205162, 0.04059527814388275, -0.04933265596628189, -0.012...
0.83234
0.81107
0.021271
Let \( a_n = \frac{1}{n^2} \) and \( b_n = \frac{1}{n} \). Determine the convergence or divergence of both series \( \sum_{n=1}^{\infty} a_n \) and \( \sum_{n=1}^{\infty} b_n \) using the Comparison Test. What conclusions can be drawn about the convergence of these series?
automath
[ 0.002460106275975704, 0.04281776398420334, -0.03055715188384056, -0.030420564115047455, 0.03635847941040993, -0.0182644110172987, 0.00007422084308927879, 0.06728605926036835, 0.043825674802064896, -0.014617492444813251, -0.01757393777370453, -0.00833132117986679, -0.038948141038417816, 0.0...
0.815129
0.796464
0.018665
Let \( T \) be a normal operator on a finite-dimensional Hilbert space \( \mathcal{H} \) with a discrete spectrum \( \sigma(T) = \{\sigma_1, \sigma_2, \ldots, \sigma_m\} \). Using the Spectral Theorem, the operator \( T \) can be expressed as \[ T = \sum_{j=1}^m \sigma_j P_j \] where \( P_j \) are the orthogonal pro...
automath
[ -0.007507973350584507, 0.031454671174287796, -0.048494067043066025, -0.029359905049204826, 0.04928387328982353, -0.017998438328504562, -0.023480361327528954, 0.05230114981532097, 0.04273297265172005, -0.003031147876754403, 0.005586449988186359, 0.03697371110320091, -0.030295681208372116, -...
0.806298
0.786701
0.019596
Given the statement of Euler's theorem which asserts that for a homogeneous function \( f(x_1, x_2, \ldots, x_n) \) of degree \( k \), the relation \[ \sum_{i=1}^{n} x_i \frac{\partial f}{\partial x_i} = kf(x_1, x_2, \ldots, x_n) \] holds, find the degree of homogeneity \( k \) for the function \( f(x, y) = 2x^3 + 3...
automath
[ 0.023264316841959953, 0.03694984316825867, -0.037252411246299744, -0.04778231680393219, 0.03813425824046135, 0.0016055966261774302, -0.02299981191754341, 0.07364211976528168, 0.029384372755885124, 0.006565298419445753, -0.004260702058672905, 0.038351938128471375, -0.028296664357185364, -0....
0.824704
0.805049
0.019655
Given the first three terms of a Tribonacci sequence and the first two terms of a numerical spiral, find the first common number that appears in both sequences, ensuring the value is within the range [1, 1,000,000]. If no common number exists within this range, report "No". The Tribonacci sequence starts with integers ...
automath
[ 0.021542157977819443, 0.028555648401379585, -0.03634623810648918, -0.03885592147707939, 0.041583847254514694, -0.0028958823531866074, -0.03780140355229378, 0.07597502321004868, 0.014402827247977257, -0.009711225517094135, 0.02821974642574787, 0.0014072611229494214, -0.02736947499215603, -0...
0.82424
0.804337
0.019904
Let \( f(x) = a(x^2 - Sx + P) \) and \( g(x) = x^2 - Sx + P \). Given that \( S = -\frac{b}{a} \) and \( P = \frac{c}{a} \) for the quadratic function \( y = ax^2 + bx + c \), can you provide an example where \( f(x) \) and \( g(x) \) have the same roots but different function values at a specific point \( x = r \), an...
automath
[ 0.023792624473571777, 0.04260839521884918, -0.05733589082956314, -0.042725786566734314, 0.024958450347185135, -0.04153202101588249, -0.004469395149499178, 0.07396400719881058, 0.019171448424458504, -0.007839796133339405, 0.015799490734934807, 0.018588902428746223, -0.04146784543991089, -0....
0.827946
0.811079
0.016867
Consider a sequence of random variables \((t_n)\) that take values in \(\mathbb{N}\). Suppose that these random variables are not necessarily independent but satisfy the condition that \(\mathbb{E}[t_n \mid \mathcal{F}_{n-1}] \leq T\) for some expected value \(T\). If the sequence of probabilities \(\mathbb{P}[t_n = t ...
automath
[ 0.011736833490431309, 0.029416225850582123, -0.03791668638586998, -0.0330507829785347, 0.02534714713692665, -0.015387778170406818, -0.03455301746726036, 0.04961967095732689, 0.019697794690728188, -0.012938237749040127, 0.006111922673881054, 0.01290207076817751, -0.04335678741335869, 0.0057...
0.826295
0.798463
0.027831
Let \( A \) be a \( 2 \times 2 \) invertible matrix with \(\det(A) = k\) where \( k \neq 0 \). Define the matrix \( B = \frac{1}{\sqrt{|k|}} A \). If the determinant of \( B \) is either \( 1 \) or \( -1 \), is it true that \( B \) is an orthogonal matrix? Provide a counterexample if the statement is false.
automath
[ 0.02133099175989628, 0.04350753873586655, -0.043439190834760666, -0.0320197157561779, 0.04256027936935425, -0.018295304849743843, 0.004332316108047962, 0.08297102153301239, 0.030600057914853096, 0.0028922450728714466, 0.00038584647700190544, 0.017239471897482872, -0.03250620886683464, -0.0...
0.820884
0.804056
0.016828
Given a square matrix \( \mathbf{A} \in \mathbb{R}^{8 \times 8} \) and the inequality system \( \mathbf{Ax} > \mathbf{0} \) with no sign constraints on the vector \( \mathbf{x} \), determine whether this system is feasible through an appropriate reformulation that can be addressed by a linear programming solver, specif...
automath
[ 0.01975218392908573, 0.041043221950531006, -0.031229941174387932, -0.04521546885371208, 0.030292833223938942, 0.01997900754213333, -0.0024314296897500753, 0.09775897860527039, 0.027663927525281906, -0.018894022330641747, -0.01830543950200081, 0.029100602492690086, -0.024742113426327705, -0...
0.815439
0.794907
0.020531
Let \( A_n = \left(1 + \frac{2}{n}\right)^n \). (a) Determine whether the series \( \sum_{n=1}^{\infty} A_n \) converges or diverges. (b) Find the limit of the sequence \( A_n \) as \( n \) approaches infinity.
automath
[ 0.01803692616522312, 0.04270876571536064, -0.018528174608945847, -0.014794514514505863, 0.024141130968928337, -0.023856641724705696, -0.02200106717646122, 0.07364483922719955, 0.0389188788831234, -0.0024333910550922155, -0.0038181892596185207, 0.01216818392276764, -0.04035242646932602, -0....
0.827311
0.810885
0.016426
For \( n \geq 5 \), consider \( n \) lines in general position in \( \mathbb{R}^2 \). What is the best established lower bound for the maximum number \( T(n) \) of empty triangles formed by these lines? Additionally, is there a known upper bound for \( T(n) \) that holds for all \( n \)? Can you compute \( T(n) \) for ...
automath
[ 0.016795018687844276, 0.03578741103410721, -0.04515518620610237, -0.02872219868004322, 0.043386656790971756, -0.005627496168017387, -0.025079207494854927, 0.055911336094141006, 0.024589285254478455, -0.008738030679523945, 0.00796103198081255, 0.0376339890062809, -0.016508039087057114, -0.0...
0.837727
0.814143
0.023583
What is the asymptotic probability \( p_{n,k} \) that \( n \) independent \( k \)-element random subsets of a set \( A \) with \( n \) elements will evenly cover \( A \) as \( n \to \infty \), under the conditions that either \( k = o(n^{1/2}) \) or \( k \asymp n - k \asymp n \)?
automath
[ 0.0238250270485878, 0.020433582365512848, -0.04219548776745796, -0.02961745671927929, 0.02628450281918049, -0.027035847306251526, -0.013635611161589622, 0.04510414972901344, 0.00872715376317501, 0.001763750915415585, 0.020257310941815376, 0.021772749722003937, -0.023109542205929756, 0.0069...
0.817365
0.799375
0.01799
Given that the sine of an angle in a right-angled triangle is defined as the ratio of the length of the opposite side to the length of the hypotenuse, confirm the value of \( \sin 30^\circ \) using the side lengths of both triangles \( \Delta RST \) and \( \Delta EFG \). Then, calculate the sine of an angle \( \theta \...
automath
[ -0.009009527042508125, 0.028192758560180664, -0.038784611970186234, -0.047865431755781174, 0.020081792026758194, -0.020743370056152344, -0.01943991892039776, 0.05372021347284317, 0.029119011014699936, 0.013717062771320343, 0.024168798699975014, 0.02936706133186817, -0.03644528239965439, -0...
0.812746
0.796516
0.01623
Given a bivariate Bernoulli random vector \((X_1, X_2)\) with joint probabilities \(p_{11}, p_{10}, p_{01}, p_{00}\) such that the correlation \(\text{Corr}(X_1, X_2)\) can be expressed in terms of \(p_{11}, p_{10}, p_{01}, p_{00}\), calculate this correlation in terms of \(p_{11}, p_{10}, p_{01}, p_{00}\) and derive t...
automath
[ -0.008343294262886047, 0.02699175477027893, -0.03736593946814537, -0.021584076806902885, 0.028964340686798096, -0.004223271273076534, -0.022070612758398056, 0.05795745179057121, 0.04533964768052101, 0.0038667151238769293, -0.004711125046014786, 0.027934566140174866, -0.025554150342941284, ...
0.814859
0.796654
0.018205
Let $\mathscr{T}$ be the topology on $\Bbb R$ consisting of the empty set, $\Bbb R$, and the sets of the form $(r, \infty)$ for $r \in \Bbb R$. Determine whether the following statements are true or false: 1. The space $(\Bbb R, \mathscr{T})$ is Hausdorff. 2. The space $(\Bbb R, \mathscr{T})$ is second-countable. 3. T...
automath
[ 0.02355213835835457, 0.05732792988419533, -0.03885301947593689, -0.047947242856025696, 0.047654010355472565, -0.0032480983063578606, -0.00830013956874609, 0.07971678674221039, 0.04132867977023125, -0.010090477764606476, 0.0032074216287583113, 0.020088912919163704, -0.023508766666054726, -0...
0.810746
0.780371
0.030375
Let \( S = \{1, 2, 3, \ldots, 10\} \). If \( \mathcal{C} = \{ \{1, 2\}, \{2, 3, 4\}, \{4, 5, 6, 7\}, \{8, 9\}, \{10\} \} \), determine if \( \mathcal{C} \) is a cover for the subset \( T = \{2, 4, 10\} \). If so, explain why \( \mathcal{C} \) qualifies as a cover for \( T \).
automath
[ 0.03578248992562294, 0.04232535511255264, -0.04115490987896919, -0.01640738546848297, 0.04575411602854729, -0.04872512072324753, -0.023256786167621613, 0.07994113862514496, 0.022566765546798706, -0.008522157557308674, 0.01902797631919384, 0.025837864726781845, -0.04531112313270569, -0.0126...
0.832246
0.806633
0.025612
Given non-negative numbers \( a_1, a_2, \ldots, a_n \) and \( b_1, b_2, \ldots, b_n \) such that \( \sum_{i=1}^n a_i = 1 \), \( \sum_{i=1}^n b_i = 1 \), and \( 0 \leq a_i, b_i \leq 1 \) for all \( i \), can you determine if the inequality \[ \frac{1}{n} \leq \sum_{i=1}^n a_i b_i \] holds true for all valid choices o...
automath
[ 0.0012670139549300075, 0.024728910997509956, -0.04312189295887947, -0.03169047832489014, 0.036899011582136154, -0.007165680173784494, -0.018430395051836967, 0.0718131735920906, 0.02312583103775978, -0.016209978610277176, -0.0005583953461609781, 0.023747872561216354, -0.03730558976531029, -...
0.8484
0.816073
0.032327
Consider the space \(\mathbb{Q}\) with the standard metric \(d(x,y) = |x-y|\) and the metric \(d'(x,y) = 0\) if \(x = y\) and \(d'(x,y) = 1\) otherwise. Is \(\mathbb{Q}\) complete with respect to both metrics? If not, for which metric is \(\mathbb{Q}\) complete, and why does this illustrate the dependence of completene...
automath
[ 0.017870252951979637, 0.019990360364317894, -0.04842967540025711, -0.04022187367081642, 0.02107304520905018, -0.009718608111143112, -0.018648119643330574, 0.05069823935627937, 0.04227162152528763, -0.021289004012942314, -0.004801085218787193, 0.030726542696356773, -0.017334505915641785, -0...
0.816204
0.786932
0.029272
In the context of constrained optimization, consider a linear programming problem defined by the objective function \( f(x) = c^T x \) subject to the constraints \( Ax = b \), where \( A \) is a matrix, \( b \) is a vector, and \( c \) is a coefficient vector. If the point \( x^* \) is a basic feasible solution that mi...
automath
[ -0.004074097611010075, 0.03749562427401543, -0.04582637920975685, -0.03225593641400337, 0.04314151033759117, 0.0029669110663235188, -0.017469873651862144, 0.08574780076742172, 0.02463489957153797, 0.009519183076918125, -0.016588589176535606, 0.013511767610907555, -0.026200998574495316, 0.0...
0.816974
0.79226
0.024714
For a prime \( p > 7 \), is every integer in \( \mathbb{F}_p \) expressible as the sum of two cubes, i.e., does there exist integers \( X \) and \( Y \) such that \( X^3 + Y^3 \equiv a \mod p \) for every \( a \in \mathbb{F}_p \)?
automath
[ 0.032088592648506165, 0.018180295825004578, -0.044337980449199677, -0.025922026485204697, 0.027393754571676254, -0.02344522625207901, -0.007196328137069941, 0.05209430679678917, 0.04140293598175049, -0.021705863997340202, 0.005653236992657185, 0.03539617732167244, -0.05378534644842148, -0....
0.838447
0.819098
0.019349
Let \( S \) be a finite set with \( n \) elements. If \( \tau_1 \) is the discrete topology on \( S \) and \( \tau_2 \) is a topology on \( S \) such that \( \tau_1 \subseteq \tau_2 \), how many distinct topologies \( \tau_2 \) are there that can be considered expansions of \( \tau_1 \)?
automath
[ 0.028093446046113968, 0.024304693564772606, -0.05893578752875328, -0.036779049783945084, 0.03120560012757778, -0.011695687659084797, -0.01379233505576849, 0.053381215780973434, 0.050105683505535126, 0.0032611675560474396, 0.017924709245562553, 0.017016513273119926, -0.04770474508404732, -0...
0.819397
0.802541
0.016856
Given the equation \[ 1 = (Ax + B)(x^2 + 1) + (Cx + D)(x^2 + 5) \] determine the values of \(A\), \(B\), \(C\), and \(D\) such that the polynomial identity holds. Specifically, solve the following set of equations resulting from equating coefficients: 1. \(0 = A + C\) 2. \(0 = B + D\) 3. \(0 = A + 5C\) 4. \(1 = B +...
automath
[ 0.03700300678610802, 0.02960565872490406, -0.04448598995804787, -0.0479239746928215, 0.03728592023253441, -0.036247264593839645, 0.013005072250962257, 0.07271906733512878, 0.046362705528736115, -0.010742517188191414, 0.008560565300285816, 0.01597450114786625, -0.027178708463907242, -0.0331...
0.832956
0.816568
0.016388
Let \( \kappa \) be an infinite cardinal. Consider the space \( \ell^2(\kappa) \) defined as follows: \[ \ell^2(\kappa) := \left\{ x: \kappa \to \mathbb{K} \mid \sum_{i \in \kappa} |x(i)|^2 < \infty \right\} \] where \( \mathbb{K} \) is the field of real or complex numbers. Based on this space, determine the cardinal...
automath
[ 0.018557235598564148, 0.045052967965602875, -0.03375473618507385, -0.03270069137215614, 0.019263656809926033, -0.013057580217719078, -0.011863503605127335, 0.05954551324248314, 0.02532719448208809, -0.00037440418964251876, 0.009599491953849792, 0.0277091171592474, -0.03423518314957619, -0....
0.824844
0.795729
0.029115
Let \( T, U, V, W \) be finite-dimensional vector spaces over a field \( \mathbb{F} \). Let \( \alpha: T \to U \) and \( \beta: V \to W \) be linear maps with ranks \( r \) and \( s \) respectively. Define the linear map \( \Phi: \mathcal{L}(U,V) \to \mathcal{L}(T,W) \) by \( \Phi(\theta) = \beta \circ \theta \circ \al...
automath
[ 0.01193645503371954, 0.043931011110544205, -0.04355981573462486, -0.04591028019785881, 0.04535701498389244, -0.025098182260990143, -0.0223762895911932, 0.05213167145848274, 0.02671230584383011, -0.02359362691640854, -0.007065882906317711, 0.026297640055418015, -0.029217936098575592, -0.009...
0.823742
0.806986
0.016757
Given a square-based pyramid with vertices at \( O(0,0,0) \), \( A(1,0,0) \), \( B(1,1,0) \), \( C(0,1,0) \), and \( D(0,0,1) \), find the angle between the faces \( ABD \) and \( BCD \). What is the measure of the dihedral angle formed by these two faces?
automath
[ 0.027649907395243645, 0.021659141406416893, -0.03488846495747566, -0.04429474100470543, 0.01198763307183981, -0.01101140771061182, -0.005251666065305471, 0.06048106029629707, 0.028678756207227707, 0.0025280064437538385, 0.010716604068875313, 0.028757039457559586, -0.04215703532099724, -0.0...
0.824235
0.807266
0.016969
Given the second order differential equation \[ x^2 y''(x) + (2b + 1) x y'(x) + c y(x) = 0, \] where \( b \) and \( c \) are real numbers with the condition \( b^2 > c \), apply the substitution \( x = e^z \) to find the general solution. Then, verify the special solution \( y(x) = x^p \) to determine the value of ...
automath
[ 0.014920944347977638, 0.03624122962355614, -0.036913659423589706, -0.04377349838614464, 0.010731727816164494, -0.007849126122891903, -0.00008436031203018501, 0.08346825838088989, 0.054222047328948975, -0.009432843886315823, -0.007519839331507683, 0.007376076187938452, -0.033994823694229126, ...
0.813363
0.795386
0.017977
Given a region \( Q \) defined by the inequalities \( a \leq x \leq b \), \( h_1(x) \leq y \leq h_2(x) \), and \( g_1(x,y) \leq z \leq g_2(x,y) \), let’s explore the implications of changing the order of integration. If \( g_1(x,y) \) and \( g_2(x,y) \) are functions of \( x \) and \( y \), under what conditions can th...
automath
[ 0.03692283481359482, 0.04723961651325226, -0.03814981132745743, -0.025096582248806953, 0.025327036157250404, 0.015652744099497795, -0.02577417716383934, 0.061442963778972626, 0.021282223984599113, 0.0021709853317588568, 0.0056097060441970825, 0.02114376239478588, -0.027743257582187653, -0....
0.816784
0.792887
0.023897
Let \( \{ X_n \} \) be a sequence of independent random variables, each identically distributed as a standard normal random variable \( Z \sim N(0, 1) \). Define \( S_n = \frac{1}{n} \sum_{i=1}^{n} X_i \). What is the limiting distribution of \( S_n \) as \( n \to \infty \)?
automath
[ -0.017837662249803543, 0.026507370173931122, -0.04386609420180321, -0.034033577889204025, 0.025263434275984764, -0.004961983300745487, -0.020857512950897217, 0.0503566600382328, 0.030809735879302025, -0.01953745447099209, -0.00161193055100739, 0.02160712145268917, -0.0349164754152298, 0.01...
0.820365
0.798005
0.022361
Consider a bounded function \( f: [0,1] \to \mathbb{R} \) defined by \[ f(x) = \begin{cases} 1 & \text{if } x \in [0, 0.5) \\ 0 & \text{if } x \in [0.5, 1]. \end{cases} \] Determine whether \( f \) is Riemann integrable on the interval \( [0, 1] \), and calculate the value of the integral \( \int_0^1 f(x) \, dx \). ...
automath
[ 0.026724228635430336, 0.053521107882261276, -0.025978542864322662, -0.03132689744234085, 0.040798649191856384, -0.006032693199813366, -0.01050886046141386, 0.07655762135982513, 0.03440501168370247, 0.01102681364864111, 0.0012602790957316756, 0.011043934151530266, -0.03637447953224182, -0.0...
0.806175
0.78901
0.017165
Given a tetrahedron with isoperimetric faces, if the lengths of the opposite edges are represented as \(a\), \(a'\), \(b\), \(b'\), \(c\), and \(c'\) such that the perimeters of the four faces are equal, what can be concluded about the relationships between the edges \(a\), \(b\), and \(c\)? Specifically, what are the ...
automath
[ 0.02079201303422451, 0.030332740396261215, -0.05003689229488373, -0.0251955296844244, 0.026611465960741043, -0.01456716563552618, -0.01823168620467186, 0.059669747948646545, 0.029422614723443985, -0.0030676499009132385, 0.007003575097769499, 0.0327400378882885, -0.03778820112347603, -0.018...
0.820609
0.803451
0.017157
Consider Poisson's equation \( \frac{\partial^2 w}{\partial x^2} + \frac{\partial^2 w}{\partial y^2} = f(x,y) \) with the boundary conditions \( w(x,0) = w(x,b) = w(0,y) = w(a,y) = 0 \) for a rectangular domain \( 0 < x < a \) and \( 0 < y < b \). If we assume a solution of the form \[ w(x,y) = \sum_{n=1}^{\infty} a_...
automath
[ -0.005850004497915506, 0.032763101160526276, -0.03947605937719345, -0.051952529698610306, 0.029195060953497887, -0.0027367030270397663, -0.007311902940273285, 0.08020278811454773, 0.04433123767375946, 0.011777134612202644, 0.006260273978114128, 0.03214642405509949, -0.03544045612215996, -0...
0.811799
0.787237
0.024562
Let \( H: C([0,1]) \to C([0,1]) \) be defined by \[ Hf(x) = \frac{1}{x} \int_0^x f(t) \, dt \] for \( f \in C([0,1]) \) and \( x > 0 \), with the convention that \( Hf(0) = f(0) \). (a) Demonstrate that \( H \) is a bounded operator and that it is not compact. Specifically, provide an example of a sequence \( (f_n...
automath
[ 0.010830491781234741, 0.05713469162583351, -0.022322721779346466, -0.029379092156887054, 0.04227595031261444, -0.011541023850440979, -0.01761343888938427, 0.08847896754741669, 0.03758217766880989, 0.006086446810513735, 0.012437707744538784, 0.008425667881965637, -0.018576592206954956, -0.0...
0.811686
0.794307
0.017379
For a given positive integer \( n \), consider arranging the integers \( \{1,2,\ldots,n\} \) on a circle. Let \( S \) be defined as the maximum sum of all adjacent \( k \) integers in any arrangement. What is the minimum value of \( S \) for arbitrary \( n \) and \( k \), and can you provide a specific arrangement that...
automath
[ 0.03310565650463104, 0.023759985342621803, -0.053798895329236984, -0.016071725636720657, 0.036072567105293274, -0.009618081152439117, -0.01599670760333538, 0.028373869135975838, 0.03217841312289238, 0.005314322654157877, 0.015001632273197174, 0.02484949119389057, -0.02176237851381302, -0.0...
0.84807
0.822042
0.026028
Given a Boolean function \( F : \{0,1\}^* \to \{0,1\} \) that is in the class \( \mathbf{NP} \), can you construct a polynomial-time verifier \( V \) such that for any string \( x \in \{0,1\}^n \), if \( F(x) = 1 \), there exists a certificate \( w \) with length \( |w| \leq a n^b \) (for some constants \( a, b \in \ma...
automath
[ 0.01640344224870205, 0.0318676121532917, -0.027716591954231262, -0.02319936268031597, 0.023514866828918457, -0.042326848953962326, -0.024329978972673416, 0.07587803155183792, 0.013916615396738052, -0.007644196972250938, 0.018687095493078232, 0.03469812497496605, -0.0054159811697900295, -0....
0.819544
0.800018
0.019526
Consider a sequence of Riemann integrable functions \( \{f_n\} \) defined on the interval \([0, 1]\) such that each \( f_n(x) \) is bounded by 1, i.e., \( |f_n(x)| \leq 1 \) for all \( x \in [0, 1] \) and for all \( n \). If \( f_n(x) \) converges pointwise to a function \( f(x) \) on \([0, 1]\), under what conditions ...
automath
[ 0.016380207613110542, 0.04988441616296768, -0.024804094806313515, -0.037844881415367126, 0.02516482211649418, 0.00648417416960001, -0.025298934429883957, 0.063810795545578, 0.028392231091856956, -0.004881684202700853, 0.007389297243207693, 0.008937633596360683, -0.04037172719836235, -0.013...
0.815972
0.785684
0.030288
Let \( X_n \) be a sequence of random variables and \( X \) a random variable. Define the event that \( X_n \) does not converge in probability to \( X \). What are the conditions or a mathematical expression that must hold true for there to exist some \( \epsilon > 0 \) and \( \varepsilon > 0 \) such that for any posi...
automath
[ 0.0013165794080123305, 0.00944038201123476, -0.05436386540532112, -0.023433642461895943, 0.031441450119018555, 0.0067981453612446785, -0.040361251682043076, 0.06974676251411438, 0.031739167869091034, -0.002208433812484145, -0.000430732179665938, 0.01410799939185381, -0.030452441424131393, ...
0.824911
0.802441
0.022471
Given \( t \) closed convex sets \( C_i \subseteq \mathbb{R}^N \) for \( i = 1, \ldots, t \) and \( r \) closed convex sets \( Q_j \subseteq \mathbb{R}^M \) for \( j = 1, \ldots, r \), what is the dimension of the intersection \( C = \bigcap_{i=1}^t C_i \) in terms of \( N \) and \( t \), provided that each \( C_i \) i...
automath
[ 0.03929264843463898, 0.05159316956996918, -0.045402612537145615, -0.020114926621317863, 0.0327303446829319, 0.0034377663396298885, -0.041959576308727264, 0.04148112237453461, 0.04005897045135498, -0.013764644972980022, 0.016564635559916496, 0.019520316272974014, -0.0266327615827322, -0.014...
0.818389
0.80098
0.017409
Consider the map $$\psi:\text{GL}^+(V) \to \text{GL}(\bigwedge^{k}V)$$ defined by $$\psi(A)=\bigwedge^{k}A.$$ Under what conditions on the dimensions $k$ and $d$ of the vector space $V$ can we guarantee that the image of $\psi$ is an embedded submanifold of $\text{GL}(\bigwedge^{k}V)$? Specifically, if $k = d-1$ and $k...
automath
[ 0.01701405644416809, 0.030305955559015274, -0.012954752892255783, -0.04909550026059151, 0.022707447409629822, -0.018704000860452652, 0.013653656467795372, 0.07217928767204285, 0.03274700418114662, -0.023180143907666206, 0.018725208938121796, 0.027639590203762054, -0.022468555718660355, -0....
0.811155
0.793052
0.018104
Given the universal set \( U = \{1, 2, 3, 4, 5, 6\} \), let \( A = \{4, 5, 6\} \) represent the set of good Star Wars movies, and \( B = \{1, 3, 5\} \) represent the set of odd-numbered Star Wars movies. Calculate \( \overline{A \cup B} \) and provide the final result.
automath
[ 0.02913082391023636, 0.02352329157292843, -0.0465548001229763, -0.020063670352101326, 0.029592063277959824, -0.018837150186300278, -0.042109835892915726, 0.047429367899894714, 0.03564952313899994, -0.010170351713895798, 0.019701192155480385, 0.020728357136249542, -0.02474621869623661, -0.0...
0.830831
0.814179
0.016653
Consider a measurable mapping \( f: (X, \mathcal{A}) \to (Y, \mathcal{B}) \), where \( \mathcal{A} \) is the Borel \( \sigma \)-algebra on a topological space \( X \) and \( \mathcal{B} \) is the Borel \( \sigma \)-algebra on a separable metric space \( Y \). If the measure \( \mu \) on \( X \) is finite and regular, a...
automath
[ 0.03636375069618225, 0.04118697717785835, -0.03866196051239967, -0.028819529339671135, 0.04810761660337448, -0.013237370178103447, -0.025699468329548836, 0.061461806297302246, 0.06294547021389008, -0.01524201687425375, 0.0023998701944947243, 0.03470468893647194, -0.02570621855556965, -0.00...
0.808068
0.780178
0.02789
Let \( X \) be a complete metric space, and consider a countable collection of dense open subsets \( \{U_n\} \) of \( X \). If it is known that the intersection of every countable collection of dense open subsets of \( X \) is non-empty, must it necessarily be dense in \( X \)? If not, provide an example of a complete ...
automath
[ 0.02827426604926586, 0.027062105014920235, -0.03646416217088699, -0.01544857770204544, 0.02419475093483925, -0.01159113459289074, -0.02577565424144268, 0.047079898416996, 0.04914688318967819, -0.01356114074587822, 0.0203078780323267, 0.01310042105615139, -0.0311142411082983, -0.01588607765...
0.808514
0.775212
0.033302
Consider the sequence defined by \( x_n = \sqrt{x_{n-1} y_{n-1}} \) with \( y_n = 1 \) if \( n = 1 \), and \( y_n = \frac{1}{2}\left(\frac{1}{x_n} + \frac{1}{y_{n-1}}\right) \) for \( n > 1 \), where \( x_1 = \frac{1}{2} \). What value do both sequences \( x_n \) and \( y_n \) converge to as \( n \to \infty \)?
automath
[ -0.012118740007281303, 0.05493740737438202, -0.04599643498659134, -0.043014928698539734, 0.03348232060670853, 0.0072617498226463795, -0.023279879242181778, 0.08023273199796677, 0.028719313442707062, -0.018656713888049126, -0.0035783001221716404, 0.016182251274585724, -0.025588508695364, -0...
0.830649
0.809268
0.021381
Consider a complex Hermitian matrix \( C \in \mathcal{H}_n \). If the unitary orbit \( \mathcal{U}(C) \) consists of all matrices unitarily similar to \( C \), what is the necessary and sufficient condition for every matrix in the convex hull of \( \mathcal{U}(C) \) to be expressed as the average of two matrices in \( ...
automath
[ 0.017213042825460434, 0.025572992861270905, -0.040708016604185104, -0.04711151495575905, 0.040837742388248444, -0.02387078106403351, -0.023995963856577873, 0.05588417127728462, 0.0103932349011302, -0.021737881004810333, 0.002640513004735112, 0.00890679843723774, -0.019896071404218674, -0.0...
0.807029
0.778892
0.028137
Suppose \( k \geq 1 \) and \( x \) is a positive integer such that \( 2^{2k} - x^2 \mid 2^{2k} - 1 \). Is it necessarily true that \( x = 1 \)? Furthermore, if there are two positive divisors of \( 2^{2k} - 1 \) that average to \( 2^k \), must these divisors be \( 2^k - 1 \) and \( 2^k + 1 \)?
automath
[ 0.0357024259865284, 0.04587024077773094, -0.03972655162215233, -0.0375833660364151, 0.04156503453850746, -0.017673928290605545, -0.010975032113492489, 0.06275822222232819, 0.024520574137568474, -0.018681075423955917, 0.002951203379780054, 0.01694374531507492, -0.038177404552698135, -0.0248...
0.842327
0.817953
0.024373
Given a martingale \( X_n \) defined by the recurrence relation \( X_{n+1} = 1-p + p X_n \) with probability \( X_n \) and \( X_{n+1} = p X_n \) with probability \( 1 - X_n \), where \( p \in [0, 1] \), determine the value of \( \mathbb{E}[X_{\infty}] \) as \( n \to \infty \). What theorem guarantees the almost sure co...
automath
[ -0.016572145745158195, 0.028250504285097122, -0.029676610603928566, -0.02121759206056595, 0.03346914425492287, 0.002379999728873372, -0.012588899582624435, 0.06039194017648697, 0.017000358551740646, -0.014502408914268017, -0.001311669358983636, 0.018041782081127167, -0.025852562859654427, ...
0.818585
0.794052
0.024533
Given two square matrices \( \mathbf{A} \) and \( \mathbf{B} \), let \( r(\mathbf{A}) \) and \( r(\mathbf{B}) \) denote their spectral radii. Under what conditions does the sequence \( \mathbf{X}_k = \mathbf{A} \mathbf{X}_{k-1} \mathbf{B} \) converge for every initial matrix \( \mathbf{X}_0 \)? Provide a complete chara...
automath
[ 0.021610217168927193, 0.047075752168893814, -0.05388893187046051, -0.037460096180438995, 0.01935342699289322, 0.004044237080961466, -0.0029553649947047234, 0.07526224106550217, 0.034428827464580536, -0.01644311659038067, 0.00873951893299818, 0.007809704169631004, -0.030505474656820297, -0....
0.824191
0.801167
0.023023
Let \( S = \{ v_1, v_2, \ldots, v_k \} \) and \( T = \{ v_1, v_2, \ldots, v_m \} \) be sets of vectors in \( \mathbb{R}^n \), where \( k \leq m \). If the span of \( S \) is a subset of the span of \( T \), express the relationship between the span of these two sets in terms of linear combinations. Specifically, can yo...
automath
[ 0.024218128994107246, 0.04146360978484154, -0.052080005407333374, -0.04471607133746147, 0.05839225649833679, -0.015773778781294823, -0.01709410548210144, 0.04736930876970291, 0.039244841784238815, 0.006953198462724686, 0.018226036801934242, 0.022827351465821266, -0.03536281734704971, -0.00...
0.812279
0.793675
0.018604
Let sets \( A \) and \( B \) be defined as follows: \[ A = \{x \in \mathbb{Z} \mid 1 \leq x \leq 10\} \] \[ B = \{x \in \mathbb{Z} \mid x \text{ is even and } 0 \leq x \leq 10\} \] Calculate the number of elements in the intersection \( A \cap B \) and provide the elements of this intersection.
automath
[ 0.07090231031179428, 0.012486934661865234, -0.034726355224847794, -0.011028217151761055, 0.032854896038770676, -0.01720265857875347, -0.01768477074801922, 0.047061000019311905, 0.0520523265004158, -0.009441685862839222, 0.006137887481600046, 0.016147075220942497, -0.030215702950954437, -0....
0.831702
0.811351
0.020352
Given the sets of vectors \( A = \{(3,1,4,1), (5,9,2,6), (5,3,5,8)\} \) and \( B = \{(9,7,9,3), (2,3,6,4), (6,2,8,4)\} \) in \( \mathbb{R}^4 \), where both sets contain linearly independent vectors, determine the dimension of the intersection of the spans of \( A \) and \( B \). Additionally, provide a basis for this i...
automath
[ 0.05359778553247452, 0.025287160649895668, -0.048981886357069016, -0.05230554938316345, 0.05012275651097298, -0.0014973629731684923, -0.014532049186527729, 0.0364164374768734, 0.05896918103098869, -0.011288587935268879, 0.017763445153832436, 0.022046806290745735, -0.019221598282456398, -0....
0.818482
0.798893
0.01959
Consider two \( n \times n \) real matrices \( A \) and \( B \) that are similar over \( \mathbb{C} \) such that there exists a matrix \( P \in \text{GL}_n(\mathbb{C}) \) satisfying \( PA = BP \). Under what conditions can it be guaranteed that there exists a real matrix \( X \) such that \( A = XBX^{-1} \)? If such co...
automath
[ 0.01733766868710518, 0.025048643350601196, -0.05642521381378174, -0.037645235657691956, 0.034901414066553116, -0.014819278381764889, 0.02017899416387081, 0.08287711441516876, 0.041678860783576965, -0.019959190860390663, -0.0036740207578986883, 0.03155369684100151, -0.053762923926115036, -0...
0.82657
0.794369
0.032201
Let \( R \) and \( R' \) be two finite rings such that each proper ideal in \( R \) is isomorphic to some ideal in \( R' \). Is it true that \( R \cong R' \)? If false, what additional conditions would need to be met for the statement to hold true? Provide a brief justification for your answer.
automath
[ 0.04454426467418671, 0.04086759313941002, -0.02289857529103756, -0.01668139174580574, 0.018486859276890755, -0.04376598820090294, 0.0023684133775532246, 0.0633658766746521, 0.020168405026197433, -0.02331654168665409, 0.018227797001600266, 0.016613109037280083, -0.024890456348657608, -0.022...
0.814479
0.79632
0.018159
Let \( G \) be a cyclic group of order 15. An element \( x \in G \) satisfies that the set \( \{x^3, x^5, x^9\} \) contains exactly two distinct elements. What is the number of distinct elements in the set \( \{x^{13n} : n \in \mathbb{Z}_{>0}\} \)?
automath
[ 0.04251839593052864, 0.02048858255147934, -0.04825908690690994, -0.041688814759254456, 0.030092323198914528, -0.026217611506581306, 0.0018814010545611382, 0.06755662709474564, 0.05051808804273605, -0.019255800172686577, 0.008680005557835102, 0.009246651083230972, -0.03472692146897316, -0.0...
0.840863
0.821129
0.019734