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
Let \( a, b, c \) be real numbers such that the quadratic equation \( ax^2 + bx + c = 0 \) has real roots. Is it true that the roots of the equation are equal if the following conditions hold? 1) The numbers \( 2a, b, \) and \( 2c \) are in arithmetic progression. 2) The numbers \( a, \frac{b}{2}, \) and \( c \) are i...
automath
[ 0.03812853619456291, 0.0427924208343029, -0.05058557912707329, -0.04145069047808647, 0.029517658054828644, -0.03339986130595207, 0.0243073720484972, 0.08615032583475113, 0.014636391773819923, -0.02683023177087307, 0.0020537639502435923, -0.007202350068837404, -0.04466196894645691, -0.03641...
0.826824
0.803305
0.023518
What conditions must be satisfied for the following equality to hold true? $$\frac{1}{n}\int_{0}^\infty p_n(r)\,r\,dr = \frac{1}{m}\int_{0}^\infty p_m(r)\,r\,dr$$ where \( p_v(r) = \int_0^\infty P(k) J_v(rk)\,k\,dk \) and \( J_v \) denotes the Bessel function of the first kind?
automath
[ 0.008516657166182995, 0.03045785054564476, -0.039863601326942444, -0.035139862447977066, 0.03678440302610397, 0.0083817383274436, -0.023909715935587883, 0.06058675795793533, 0.023281851783394814, -0.00852626096457243, -0.0056960973888635635, 0.01203476544469595, -0.012447451241314411, -0.0...
0.834256
0.81805
0.016205
Let \( X \) be a compact topological space and \( (x_a)_{a \in A} \) be a net in \( X \). If the net converges to some point \( x \in X \), how many distinct points can the net converge to, and what is the relationship between this convergence and the compactness of the space?
automath
[ 0.013951758854091167, 0.035133156925439835, -0.048717960715293884, -0.0034418210852891207, 0.02697855606675148, -0.007616383954882622, -0.025583641603589058, 0.04909450188279152, 0.04334324225783348, 0.012429961934685707, 0.004516699351370335, 0.021184228360652924, -0.04285028204321861, -0...
0.817573
0.798503
0.019069
Let \( X = [0, 1] \) with the standard topology on \(\mathbb{R}\), and define an equivalence relation \(\sim\) on \(X\) by \( x \sim y \) if \(x = y\) or if \(x\) and \(y\) are both endpoints (0 and 1) of the interval. What is the quotient space \( Y = X/{\sim} \), and what is its topological character (for example, is...
automath
[ 0.026477009057998657, 0.005098922643810511, -0.04705536365509033, -0.033087704330682755, 0.033589918166399, 0.0019885473884642124, -0.005679265595972538, 0.08006500452756882, 0.032955143600702286, -0.01773870177567005, 0.0018039012793451548, 0.03197509050369263, -0.03390693664550781, -0.01...
0.814114
0.792402
0.021711
Given the continuous, non-negative functions \( f(x) \) and \( \phi(x) \) on the interval \( (0, \infty) \) such that \( |f(x)| \leq \phi(x) \) for all \( x > 0 \), and the improper integral \( \int_0^{\infty} \phi(x) \, dx \) converges to some finite value \( l \). What can you conclude about the convergence of the im...
automath
[ 0.0023072618059813976, 0.037434302270412445, -0.014473150484263897, -0.033114779740571976, 0.01876913197338581, 0.006685993634164333, -0.027216468006372452, 0.05042000859975815, 0.03570207953453064, 0.0067794169299304485, 0.01611960679292679, 0.013590813614428043, -0.015022828243672848, -0...
0.812104
0.795896
0.016208
Given a vector \( x = (x_1, x_2) \) where \( x_i > 0 \) for \( i = 1, 2 \), and a positive constant \( L \), find the minimal integer vector \( n = (n_1, n_2) \in \mathbb{N}^2 \) such that the inequality \( n^T x \geq L \) holds, and \( |n| = n_1 + n_2 \) is minimized. What is the value of \( n_1 \) and \( n_2 \) in th...
automath
[ 0.007468488533049822, 0.03607381135225296, -0.04256849363446236, -0.0310868751257658, 0.0420403890311718, 0.005403295159339905, -0.03037068620324135, 0.07843464612960815, 0.03288346901535988, -0.023586733266711235, -0.0045199622400105, 0.020462648943066597, -0.021619945764541626, -0.016353...
0.842001
0.82227
0.019732
Consider a bipartite graph with \( n \) vertices on the left set and \( m \) vertices on the right set, such that every left vertex is connected to exactly one right vertex. If the starting point \( S \) is a vertex in the left set and is included in every maximum matching, how many moves can the first player make befo...
automath
[ 0.02780584990978241, 0.007577093318104744, -0.05757119879126549, -0.02783723920583725, 0.01001683995127678, -0.01985079236328602, -0.018136857077479362, 0.054215338081121445, 0.03350524976849556, -0.01966869831085205, 0.026322437450289726, 0.014801530167460442, -0.02234145812690258, -0.019...
0.827873
0.802981
0.024891
Given an \( n \times p \) matrix \( X \) where \( n \) is the number of observations and \( p \) is the number of variables, consider the centered matrix \( Z = PX \) defined by \( P = I - \frac{1}{n} \mathbf{11}^T \). If \( X \) is a full column rank matrix with \( p < n \), what conditions on \( X \) ensure that the ...
automath
[ 0.03911297768354416, 0.025571122765541077, -0.052457064390182495, -0.020151861011981964, 0.039454277604818344, -0.021979255601763725, 0.008246568031609058, 0.05270107835531235, 0.024002820253372192, 0.0006533549167215824, -0.010302199050784111, 0.006645000074058771, -0.04780363664031029, 0...
0.8132
0.790484
0.022716
Consider the semidefinite program defined by the feasible region \( S_3 = \{X: X \succeq 0, X_{11} = X_{22} = X_{33} = 1\} \), where \( X \) is a \( 3 \times 3 \) symmetric positive semidefinite matrix. If we project this feasible region onto the variables \( x, y, z \) and consider the set \( U = \{(x, y, 0): x^2 + y^...
automath
[ -0.00004062983862240799, 0.03748759254813194, -0.05366501212120056, -0.03506632149219513, 0.04307228699326515, -0.0005413709441199899, -0.02433268167078495, 0.08384352922439575, 0.03086930140852928, -0.01402510516345501, 0.024176184087991714, 0.053920503705739975, -0.020733166486024857, -0...
0.81959
0.793317
0.026273
Consider a Markov chain with the transition probability matrix given by \[ P = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}. \] Determine whether this Markov chain possesses a limiting distribution. If so, find the limiting distribution. If not, provide a justification for your answer. Additionally, identify if this M...
automath
[ 0.028139669448137283, 0.016032224521040916, -0.02538679540157318, -0.033244650810956955, 0.04344189912080765, -0.018862079828977585, -0.015599108301103115, 0.08525329828262329, 0.010104882530868053, -0.008303077891469002, -0.0038112911861389875, 0.013297357596457005, -0.018295634537935257, ...
0.794297
0.777918
0.016378
Given two points in polar coordinates, \( A = (r_a, \theta_a) \) and \( B = (r_b, \theta_b) \), let the vector from \( A \) to \( B \) be defined as \( \mathbf{c} = \mathbf{b} - \mathbf{a} \). If \( \theta_c \) is the angle that vector \( \mathbf{c} \) makes with the horizontal, can you express \( \theta_c \) in terms ...
automath
[ 0.029469281435012817, 0.03410279005765915, -0.03547826036810875, -0.02661062590777874, 0.010520988143980503, -0.01866190694272518, -0.021125903353095055, 0.06399870663881302, 0.03254508972167969, -0.015106530860066414, -0.0017566278111189604, 0.017707668244838715, -0.03829308971762657, -0....
0.823933
0.806673
0.017259
Given a finite group \( G \) with order \( n \), what is the largest fraction \( \frac{A}{B} \) such that there exists an automorphism \( f: G \to G \) mapping exactly \( \frac{A}{B} \) of the elements of \( G \) to their own inverses, and can you provide an example of such a group \( G \) for several specific values o...
automath
[ 0.0447981059551239, 0.046774089336395264, -0.02738504484295845, -0.03864065557718277, 0.015961628407239914, -0.028142588213086128, 0.006383673753589392, 0.041309505701065063, 0.02534821815788746, -0.004737605806440115, 0.016853198409080505, 0.012867003679275513, -0.021711988374590874, 0.00...
0.821684
0.804493
0.017191
Given a convex quadrilateral \(ABCD\) with midpoints \(E\), \(F\), \(G\), and \(H\) on sides \(AB\), \(BC\), \(CD\), and \(DA\) respectively, let \(P\), \(Q\), \(R\), and \(S\) be the intersections of lines \(AF\) with \(DE\), \(AF\) with \(BG\), \(BG\) with \(CH\), and \(CH\) with \(DE\) respectively. If the area of q...
automath
[ 0.01348859816789627, 0.020925672724843025, -0.050215862691402435, -0.040898337960243225, 0.02140735648572445, -0.00817774049937725, -0.012538224458694458, 0.052094291895627975, 0.04291180148720741, -0.0122538972645998, -0.014020470902323723, 0.026800477877259254, -0.03642328456044197, -0.0...
0.840248
0.823802
0.016446
Given two randomly oriented subspaces \( A \) and \( B \) in \( \mathbb{R}^d \) with dimensions \( a \) and \( b \) respectively, express the probability that these subspaces intersect non-trivially in terms of \( a, b, \) and \( d \). What is the condition under which this probability equals 1, and under which it equa...
automath
[ -0.00158629787620157, 0.011639351956546307, -0.028533978387713432, -0.023455355316400528, 0.033499106764793396, 0.0273891631513834, -0.005978013854473829, 0.0391986183822155, 0.04631103575229645, 0.00007788604852976277, 0.01353852916508913, 0.0061923181638121605, -0.01963687501847744, -0.0...
0.828219
0.805269
0.02295
Let \(X\) be a Banach space and \(Y\) be a normed linear space. Consider a bounded linear operator \(T : X \to Y\) such that for every \(y \in T(X)\), there exists an \(x \in X\) satisfying \(T(x) = y\) and \(\| x \| \leq M \| y \|\) for some constant \(M > 0\). If \(y_n \in T(X)\) is a sequence such that \(\lim_{n \to...
automath
[ 0.014809519052505493, 0.03211164474487305, -0.039920613169670105, -0.024994179606437683, 0.023453041911125183, 0.005876891780644655, -0.0341973677277565, 0.0649467185139656, 0.029883738607168198, -0.009990067221224308, -0.000815639621578157, 0.032385751605033875, -0.03601175546646118, -0.0...
0.822046
0.798862
0.023184
Given the equations of a circle and a parabola, specifically the upper half of the circle defined by \( x^2 + y^2 = 1 \) and the parabola defined by \( y = x^2 - 1 \), determine the number of intersection points between these two curves.
automath
[ 0.025997690856456757, 0.01547412108629942, -0.025386802852153778, -0.03264397755265236, 0.04558837413787842, -0.023481355980038643, -0.0163591131567955, 0.06737145781517029, 0.03394567221403122, -0.019458672031760216, 0.01063892338424921, 0.01816822960972786, -0.02888065204024315, -0.01449...
0.815999
0.798483
0.017516
Consider a game played on a chessboard of size \((n+1) \times (n+1)\) where two players alternate turns moving a piece starting from an initial position \((i, j)\). The players can move the piece either one square right, one square down, or one square diagonally up and to the left, with the restriction that they cannot...
automath
[ 0.01714031957089901, 0.015729166567325592, -0.05891439691185951, -0.01757020130753517, 0.01350134052336216, -0.0009823438012972474, -0.008784226141870022, 0.0639098584651947, 0.028934698551893234, -0.033254459500312805, 0.020871102809906006, 0.013593659736216068, -0.05343478173017502, -0.0...
0.826286
0.798558
0.027728
Given the functions \( f = c[1] + c[1,2] + c[1,2,3] \) and \( g = c[2] + c[2,1] \), where the coefficients \( c[I] \) are positive and satisfy the condition \( c[x] > c[y] \) whenever \( x \) lexicographically precedes \( y \), determine the conditions under which \( f > g \). Specifically, find the explicit conditions...
automath
[ 0.024135634303092957, 0.03902507573366165, -0.039528317749500275, -0.0318870022892952, 0.043212685734033585, 0.0011590806534513831, -0.04303541034460068, 0.08177084475755692, 0.032344620674848557, 0.00303979916498065, -0.0016457457095384598, 0.015081007033586502, -0.04795091599225998, -0.0...
0.827718
0.804956
0.022762
Let \( f: I \to \mathbb{R} \) be a function defined on an interval \( I \) that satisfies the condition \( |f(x)| \leq (x - c)^2 \) for all \( x \in I \). Determine the value of \( f'(c) \).
automath
[ 0.018852081149816513, 0.030648140236735344, -0.0575549341738224, -0.020858604460954666, 0.03744551166892052, -0.031312424689531326, -0.010955668985843658, 0.062239062041044235, 0.028116339817643166, -0.01350729912519455, 0.004180643707513809, 0.04209201782941818, -0.031422827392816544, 0.0...
0.82184
0.802806
0.019034
Find all integer solutions \((x, y, z)\) to the equation \(x^2 + y^2 = 2z^2\). Additionally, determine the conditions under which these solutions can be expressed in terms of two integers \(m\) and \(n\) such that \(m > n > 0\), \(\gcd(m, n) = 1\), and \(m\) and \(n\) are of opposite parity.
automath
[ 0.029588334262371063, 0.029246237128973007, -0.03577175736427307, -0.05545452609658241, 0.03889165446162224, -0.01651780493557453, -0.009287562221288681, 0.05553731322288513, 0.03915100917220116, -0.01713220775127411, 0.013912970200181007, 0.0176499355584383, -0.024879740551114082, -0.0330...
0.839384
0.813702
0.025682
Given triangle \( ABC \) with \( AC = 3 \), \( BC = 4 \), and \( AB = 5 \), there is a point \( D \) on line segment \( \overline{AB} \) such that line \( \overline{CD} \) bisects the right angle at \( C \). If the radii of the inscribed circles of triangles \( ACD \) and \( BCD \) are denoted as \( r_a \) and \( r_b \...
automath
[ 0.02331259287893772, 0.035982731729745865, -0.04137897118926048, -0.03671668469905853, 0.027332952246069908, -0.019497402012348175, -0.004863029345870018, 0.0509645938873291, 0.031017092987895012, 0.005095341708511114, 0.030669787898659706, 0.03920478746294975, -0.014161728322505951, 0.007...
0.836113
0.818464
0.017649
Find all surjective functions \( f: \mathbb{R} \to \mathbb{R} \) such that for all \( x, y \in \mathbb{R} \), \[ f(x + f(x) + 2f(y)) = f(2x) + f(2y). \] Determine how many such functions \( f \) exist.
automath
[ 0.03248221054673195, 0.030376669019460678, -0.04642253741621971, -0.0416913703083992, 0.030445458367466927, -0.0038428078405559063, -0.02074320986866951, 0.06921451538801193, 0.035616435110569, -0.007190528325736523, 0.002936434233561158, 0.02496415376663208, -0.029022343456745148, -0.0309...
0.837442
0.82008
0.017362
If \( S_1, S_2, \dots \) are sets of real numbers such that \( \bigcup_{j=1}^{\infty} S_j = \mathbb{R} \), what can be concluded about the elements of at least one of the sets \( S_j \) in terms of countability? Specifically, must at least one set \( S_j \) be uncountable?
automath
[ 0.02291264943778515, 0.037739358842372894, -0.03453018143773079, -0.03549604490399361, 0.025358105078339577, -0.012300779111683369, -0.010964483954012394, 0.0599062405526638, 0.03276657313108444, -0.01756385713815689, 0.012148157693445683, 0.022989638149738312, -0.037973497062921524, -0.02...
0.824578
0.801256
0.023323
Let \( f(z) = \sum_{n=0}^\infty a_n z^n \) be a holomorphic function on the closed unit disk. If we define \( \overline{f(z)} = \sum_{n=0}^\infty \overline{a_n} \overline{z}^n \), and we consider the integral \[ I(a) = \frac{1}{2\pi i} \int_\gamma \frac{\overline{f(z)}}{z - a} \, dz, \] where \( \gamma \) is the uni...
automath
[ 0.02876882068812847, 0.050537820905447006, -0.044619008898735046, -0.020847659558057785, 0.027058551087975502, 0.01647903025150299, -0.010838363319635391, 0.05444202572107315, 0.030930479988455772, 0.01829647459089756, 0.02146037481725216, 0.013634703122079372, -0.03390161693096161, -0.003...
0.805398
0.784909
0.020489
Consider an ellipse defined by its foci \( F_1 \) and \( F_2 \) such that the sum of the distances from any point \( P \) on the ellipse to these foci is a constant \( C \). If \( F_1 \) is situated at the coordinates \( (0, c) \) and \( F_2 \) at \( (0, -c) \) on the Cartesian plane, and the distance \( d \) from the ...
automath
[ 0.008470333181321621, 0.047068800777196884, -0.04128321260213852, -0.02460046298801899, 0.03107045404613018, -0.01831846870481968, -0.03647446632385254, 0.05593318119645119, 0.04624004662036896, -0.00771645363420248, 0.017476215958595276, 0.027210012078285217, -0.03307513892650604, -0.0127...
0.822317
0.800924
0.021393
Is it true that if \( R \) is any ring, \( M \) is a finitely generated \( R \)-module, and \( P \) is a projective \( R \)-module of finite type, then the statement "If \( x = \sum_i m_i \otimes p_i \) is in \( M \otimes_R P \) such that \( \sum_i m_i \phi(p_i) = 0 \) for all \( \phi \in P^* \), then \( x = 0 \)" hold...
automath
[ 0.014492781832814217, 0.03605835139751434, -0.0287314560264349, -0.03955595940351486, 0.024081014096736908, -0.03963550925254822, -0.0012376848608255386, 0.05084769055247307, 0.030737174674868584, -0.023941276594996452, 0.008298225700855255, 0.03530000150203705, -0.024431008845567703, -0.0...
0.804806
0.785507
0.019299
Given the probability distribution table for detecting corners in three different objects (sphere, cylinder, box), where the probabilities of finding 0 to 5 corners for each object are provided, calculate the following: 1. If exactly 3 corners were found and each object is equally likely to be the presented object, wh...
automath
[ 0.005431427154690027, 0.023122726008296013, -0.042737506330013275, -0.00968365278095007, 0.03036746196448803, -0.017367379739880562, -0.023104975000023842, 0.05268285050988197, 0.042925357818603516, -0.007250759284943342, 0.005764360539615154, 0.025547180324792862, -0.014010968618094921, 0...
0.810928
0.790969
0.019959
Given positive integers \( m \) and non-negative integer \( n \), evaluate the divisibility of \( (mn)! \) by \( (n!) \cdot (m!)^n \) by proving that: \[ (n!) \cdot (m!)^n \mid (mn)! \] using the lemma that states: \[ \frac{\left(\sum_{i=1}^n a_i\right)!}{\prod_{i=1}^n a_i!} \in \mathbb{N} \] for appropriate choice...
automath
[ 0.031857140362262726, 0.03178524971008301, -0.037758056074380875, -0.035667166113853455, 0.04764312505722046, -0.02263651229441166, -0.023640353232622147, 0.05992705002427101, 0.016369350254535675, -0.01802551932632923, -0.010298289358615875, 0.02320426143705845, -0.04443066567182541, -0.0...
0.832532
0.811998
0.020533
Let \( f(z) \) be a non-constant analytic function defined on a neighborhood of \( 0 \) such that \( f(0) = 0 \). If it is known that the number of zeros of \( f \) inside a small disk centered at \( 0 \) is given by the winding number \( \frac{1}{2\pi i} \oint_{\gamma} \frac{f'(z)}{f(z)} \, dz \), where \( \gamma \) i...
automath
[ 0.018963636830449104, 0.04659620672464371, -0.04076874256134033, -0.009836269542574883, 0.017229754477739334, 0.025412579998373985, -0.027147207409143448, 0.031067799776792526, 0.04043005779385567, 0.028391186147928238, 0.008516342379152775, 0.01576283760368824, -0.02889704704284668, -0.02...
0.811448
0.79509
0.016358
Given an \( n \times n \) cost matrix \( C \) where \( C_{ij} \) represents the cost of assigning job \( j \) to worker \( i \), explain why it is essential for all elements \( C_{ij} \) to be nonnegative in the context of the Hungarian algorithm. If the matrix contains negative entries, how can we transform it into a ...
automath
[ 0.0010669610928744078, 0.01305779442191124, -0.03724382445216179, -0.013983628712594509, 0.030253173783421516, -0.004544604104012251, -0.015079227276146412, 0.050149329006671906, 0.026744438335299492, -0.015035778284072876, 0.008294378407299519, 0.014735270291566849, -0.02434850111603737, ...
0.802706
0.785847
0.016859
If in triangle \( ABC \), the altitudes from vertices \( A \) and \( B \) to the opposite sides \( BC \) and \( AC \) are equal, which of the following statements is necessarily true about triangle \( ABC \)? (a) The triangle is equilateral. (b) The triangle is isosceles. (c) The triangle is scalene. (d) The triang...
automath
[ 0.029899315908551216, 0.014033590443432331, -0.035125479102134705, -0.03899267315864563, 0.031999167054891586, -0.034366775304079056, 0.006066914182156324, 0.06247952952980995, 0.03551223874092102, -0.012773933820426464, 0.00806247629225254, 0.026067456230521202, -0.030665235593914986, -0....
0.822635
0.804619
0.018016
Given a system of partial differential equations for two functions \( f(s,t) \) and \( g(s,t) \) defined by \[ f_{ss}f_{tt} - f_{st}^2 = 0, \quad g_{ss}g_{tt} - g_{st}^2 = 0, \quad f_t^2 + g_t^2 = 1, \] where \( s \) and \( t \) are parameters and \( f \) and \( g \) are functions of these parameters, how can one de...
automath
[ 0.009094037115573883, 0.027304282411932945, -0.05649101361632347, -0.03468867018818855, 0.046988651156425476, -0.003690183162689209, -0.015720205381512642, 0.06923450529575348, 0.01489457581192255, -0.017656806856393814, 0.0005422374233603477, 0.03740472346544266, -0.011434314772486687, 0....
0.808893
0.786633
0.02226
Let \( R \) be a field and consider polynomials \( f_1, \ldots, f_c \) in \( R[x_1, \ldots, x_n] \) such that \( n \geq c \). If the following \( c \times n \) matrix is formed: \[ M = \begin{matrix} \partial f_1/\partial x_1 & \partial f_2/\partial x_1 & \ldots & \partial f_c/\partial x_1 \\ \partial f_1/\partial x...
automath
[ 0.04510584473609924, 0.029567621648311615, -0.06905801594257355, -0.040059927850961685, 0.0341956727206707, -0.014383496716618538, -0.03768381103873253, 0.05783485993742943, 0.03538751229643822, -0.016447557136416435, -0.010732121765613556, 0.03927500918507576, -0.03499478101730347, -0.025...
0.823729
0.804993
0.018736
Let \( T: X \to X \) be a contraction mapping on a complete metric space \( (X, d) \) with contraction constant \( c \) such that \( 0 < c < 1 \). If we define a sequence \( (x_n) \) by \( x_{n+1} = Tx_n \) starting from an arbitrary point \( x_0 \in X \), can you determine the exact limit \( \lim_{n \to \infty} x_n \)...
automath
[ 0.009186583571135998, 0.03497246652841568, -0.040390729904174805, -0.027193892747163773, 0.020633401349186897, 0.005733180791139603, -0.010844528675079346, 0.07043593376874924, 0.042063139379024506, -0.017572050914168358, -0.005406966432929039, 0.0184941366314888, -0.02588195912539959, -0....
0.817008
0.797205
0.019803
Given a linear transformation \( T: V \to W \) represented by the transformation matrix \( A = \begin{bmatrix} I_k & 0 \\ 0 & 0 \end{bmatrix} \), where \( I_k \) is the \( k \times k \) identity matrix and \( V \) and \( W \) are vector spaces such that \( \dim V = n \) and \( \dim W = m \) with \( k \leq \min(n, m) \)...
automath
[ 0.036018840968608856, 0.03310973942279816, -0.04209645465016365, -0.04140160605311394, 0.049863848835229874, -0.014265747740864754, -0.0015078408177942038, 0.05745604261755943, 0.007070581428706646, -0.014900551177561283, 0.008707886561751366, 0.004802317824214697, -0.02205774001777172, -0...
0.813643
0.797449
0.016193
In the topological space \( \mathbb{R} \) with the usual topology, consider the subset \( A = \mathbb{Q} \) (the rational numbers). How many points are in the closure of \( A \) in \( \mathbb{R} \), and what does this imply about the density of \( A \) in \( \mathbb{R} \)?
automath
[ 0.03375270590186119, 0.030917925760149956, -0.04152222350239754, -0.02269228734076023, 0.027722476050257683, -0.01196308434009552, -0.018223049119114876, 0.030252059921622276, 0.040786225348711014, -0.019768161699175835, -0.0069613587111234665, 0.03186613321304321, -0.03480863198637962, -0...
0.820258
0.802541
0.017717
Consider a mathematical object defined as a set of all bijections from \(\mathbb{N}\) to \(\mathbb{N}\). What is the cardinality of the group of all bijections, and how does this cardinality relate to the concept of a countably generated group? Specifically, demonstrate whether this group is countably generated, and pr...
automath
[ 0.031123533844947815, 0.021255623549222946, -0.04905262589454651, -0.03271389752626419, 0.040039338171482086, -0.057067349553108215, -0.01904607005417347, 0.05115531384944916, 0.03639259561896324, -0.01708395779132843, -0.0004278888809494674, 0.018005818128585815, -0.041196081787347794, -0...
0.818526
0.801153
0.017374
Let \( f(x) = x^{-\frac{1}{p+1}} \) for \( x \in (0, 1) \). Determine whether \( f \) is essentially bounded on the interval \( (0, 1) \). If it is not, provide a specific value of \( M \) such that for any \( \varepsilon > 0 \), there exists a set of positive measure where \( |f(x)| > M \). Additionally, can you find ...
automath
[ 0.012734556570649147, 0.030593466013669968, -0.03379625454545021, -0.02356133423745632, 0.02326575107872486, -0.019753800705075264, -0.017231294885277748, 0.0694117471575737, 0.03410276398062706, 0.003051417414098978, 0.004035146441310644, 0.005624644923955202, -0.03239990025758743, -0.026...
0.819772
0.797871
0.021902
Let \( X \) be a normed space, and define the function \( f : X \to \mathbb{R} \) by \( f(x) = \|x\| \). If \( x_0 \in X \) and \( \varepsilon > 0 \), determine the value of \( \delta \) such that if \( \|x - x_0\| < \delta \), then \( |f(x) - f(x_0)| < \varepsilon \). Specifically, express \( \delta \) in terms of \( ...
automath
[ 0.00572983780875802, 0.02122945711016655, -0.04120998829603195, -0.04127924144268036, 0.033349212259054184, -0.004290245473384857, -0.02528349868953228, 0.08113021403551102, 0.03924277797341347, -0.0028632504399865866, -0.006961137522011995, 0.03143718093633652, -0.049114588648080826, -0.0...
0.819988
0.799475
0.020513
Given a set of \( n \) points in a metric space and two constraints for similar and dissimilar pairs, determine the minimum number of mappings \( f: X \to Y \) such that all \( \binom{n}{2} \) pairs are correctly classified according to their similarity or dissimilarity. If \( u \) is the maximum distance allowed for s...
automath
[ 0.0051624649204313755, 0.01207585260272026, -0.03351861611008644, -0.024818232282996178, 0.03699406236410141, -0.007831213995814323, -0.02861298806965351, 0.04055934026837349, 0.03858960047364235, 0.0013212930643931031, 0.014630642719566822, 0.04258522763848305, -0.013092323206365108, -0.0...
0.832394
0.812546
0.019848
Let \(\{a_n\}_{n \in \mathbb{N}}\) be a decreasing sequence of nonnegative real numbers such that \(\lim_{n \to \infty} na_n = 0\). What is the necessary and sufficient condition for the series \(\sum_{n=1}^{\infty} a_n \sin(nx)\) to converge uniformly on \(\mathbb{R}\)?
automath
[ -0.00788350123912096, 0.03766219690442085, -0.043330464512109756, -0.04036499559879303, 0.029455192387104034, 0.01711880788207054, -0.028723597526550293, 0.04858347028493881, 0.036463044583797455, -0.005139144137501717, 0.011799318715929985, -0.005319587420672178, -0.036349646747112274, -0...
0.822216
0.796841
0.025375
Let \( A \) be an \( n \times n \) invertible matrix over a field \( \mathbb{F} \), and let \( \lambda_1, \lambda_2, \ldots, \lambda_n \) be its eigenvalues. If \( A \) has exactly \( k \) distinct eigenvalues, where \( k < n \), what is the maximum possible dimension of the generalized eigenspace corresponding to any ...
automath
[ 0.029693834483623505, 0.03307841718196869, -0.022829778492450714, -0.05076964199542999, 0.041813891381025314, -0.016937261447310448, -0.013252947479486465, 0.050170958042144775, 0.03097527101635933, -0.013346577063202858, 0.00553393829613924, 0.04245169460773468, -0.04013786464929581, -0.0...
0.824168
0.803579
0.020589
Given a finite system of non-strict real polynomial inequalities defining a compact convex set \( S \) in \( \mathbb{R}^n \) that satisfies the Archimedean condition, how many Lasserre relaxations are necessary to represent the polynomial optimization problem over \( S \) exactly, assuming each defining polynomial meet...
automath
[ 0.011704480275511742, 0.008513824082911015, -0.05071388930082321, -0.04265158623456955, 0.023782581090927124, -0.007849963381886482, -0.02526259794831276, 0.042191281914711, 0.02999980002641678, -0.0159190371632576, 0.016637543216347694, 0.013065268285572529, -0.029936667531728745, -0.0252...
0.816735
0.79177
0.024965
Given a measure space \( (X, \mu) \) and a measurable transformation \( f : X \to X \), if \( \{ U_n : n \in \mathbb{N} \} \) is a countable basis of open sets in \( X \) such that \( \mu(U_n') = 0 \) for each \( n \), where \( U_n' = \{ x \in U_n : \forall n \geq 1, f^n(x) \notin U_n \} \), what can be concluded about...
automath
[ 0.014455425553023815, 0.025060521438717842, -0.04393354058265686, -0.024082466959953308, 0.0349913090467453, -0.0059373024851083755, -0.01351655088365078, 0.06436589360237122, 0.049584005028009415, -0.0009010417852550745, 0.0044159539975225925, 0.022558223456144333, -0.0312955416738987, 0....
0.810854
0.78683
0.024023
Given measurable functions \( f, g \) from a probability space \( (\Omega, \mathcal{F}, \mathbb{P}) \) to measurable spaces \( (X, \mathcal{A}) \) and \( (Y, \mathcal{B}) \), respectively, under the condition that \( \sigma(f) \supset \sigma(g) \mod \mathbb{P} \) and that \( (Y, \mathcal{B}) \) is a standard Borel spac...
automath
[ 0.0025576232001185417, 0.03310056030750275, -0.03645174577832222, -0.018311774358153343, 0.039680879563093185, -0.007959526963531971, -0.042979758232831955, 0.04850700497627258, 0.039266396313905716, -0.009062428027391434, -0.005261791404336691, 0.01825007237493992, -0.01811027154326439, -...
0.817907
0.79988
0.018027
Given a positive integer \( n \), define the highest multiplicity of a prime \( p \) that divides \( n \) as \( d \), where \( n \) can be expressed in the form \( n = p^d \cdot m \) for some integer \( m \) that is not divisible by \( p \). If \( n = 60 \), find the highest multiplicity of \( 2 \) that divides \( 60...
automath
[ 0.03426668792963028, 0.025526612997055054, -0.01589493453502655, -0.022570548579096794, 0.02327500842511654, -0.02558937668800354, -0.016787635162472725, 0.05993524566292763, 0.02778695896267891, -0.016526170074939728, 0.0011969481129199266, 0.028978729620575905, -0.019679365679621696, -0....
0.819577
0.801863
0.017714
Let \( G \) be a finite group of order \( n \). If every automorphism of \( G \) is either inner or extensible to some larger group, what can be concluded about the structure of \( G \)? Specifically, determine the maximum possible number of distinct inner automorphisms of \( G \) given that \( G \) has exactly \( k \)...
automath
[ 0.04182082787156105, 0.024317586794495583, -0.029944438487291336, -0.034763868898153305, 0.01595105230808258, -0.03804735094308853, -0.020883189514279366, 0.0325128473341465, 0.026720495894551277, -0.010017583146691322, 0.014543723315000534, 0.01876303181052208, -0.04433247074484825, -0.00...
0.825843
0.80545
0.020394
Let \( U_1 \) and \( U_2 \) be finite groups, and let \( \Gamma \) be a subgroup of the direct product \( U_1 \times U_2 \) such that the projections onto \( U_1 \) and \( U_2 \) are both surjective. Is it always possible to find a group \( G \) such that \( \Gamma \) is isomorphic to the fiber product \( U_1 \times_G ...
automath
[ -0.010162119753658772, 0.05041804909706116, -0.020992333069443703, -0.02637728489935398, 0.03163446858525276, -0.024078814312815666, -0.01715542934834957, 0.07640377432107925, 0.03338833898305893, 0.004082111641764641, 0.022054191678762436, 0.02243356965482235, -0.025111829861998558, -0.03...
0.81365
0.784941
0.028709
Given the existence of a Borel set \( A \subset [0, 1] \) such that \( 0 < m(A \cap I) < m(I) \) for every subinterval \( I \) of \( [0, 1] \), what is the precise measure of the set \( A \) if it is constructed as the union of disjoint intervals of equal measure? Additionally, can you provide an example of a Borel set...
automath
[ 0.024946244433522224, 0.03130394220352173, -0.012598303146660328, -0.013766925781965256, 0.0358508825302124, -0.007070562336593866, -0.02018621936440468, 0.06018868461251259, 0.040728941559791565, -0.015542486682534218, 0.020462170243263245, 0.014765208587050438, -0.04455152899026871, -0.0...
0.816443
0.799831
0.016613
Given an infinite-dimensional Banach space \( X \) and a continuous function \( f: X \to \mathbb{R} \) defined as \( f(x_n) = n \) for a sequence of distinct points \( (x_n) \) in the unit ball that has no convergent subsequence, what can be said about the boundedness of \( f \) on the unit ball of \( X \)? Specificall...
automath
[ 0.005794083699584007, 0.050430167466402054, -0.034493234008550644, -0.023927543312311172, 0.01615927554666996, -0.00097154505783692, -0.006719448138028383, 0.06870868802070618, 0.02784176729619503, -0.0071804034523665905, 0.013417948968708515, 0.011668073944747448, -0.011478947475552559, 0...
0.797491
0.775572
0.021919
Let \(\{a_n\}\) be a sequence of positive numbers such that \(a_n \to 0\) as \(n \to \infty\). Determine whether the series \(s_n = \sum_{k=1}^{n} a_k^2\) converges or diverges in the following cases: 1. \(a_n = \frac{1}{n}\) 2. \(a_n = \frac{1}{\sqrt{n}}\) 3. \(a_n = \frac{1}{\ln(n)}\) for \(n \geq 2\) Provide verif...
automath
[ 0.014784695580601692, 0.04606814682483673, -0.02419368177652359, -0.028453879058361053, 0.03771377354860306, -0.020126212388277054, -0.023776663467288017, 0.06159072741866112, 0.040277428925037384, 0.0013675341615453362, 0.01106112077832222, -0.0002452839398756623, -0.03442363068461418, -0...
0.828161
0.804406
0.023754
Let \( M \) be a monoid, where the operation is denoted by \( * \) and \( e \) is the identity element. Consider the set of strings \( List_{0,1} \) composed of the characters 0 and 1 along with the empty string as the identity element under concatenation. Given that concatenation of two strings is associative and the ...
automath
[ 0.039124149829149246, 0.03130133077502251, -0.02041798084974289, -0.019535789266228676, 0.04340490326285362, -0.044185832142829895, 0.0016093595186248422, 0.08046780526638031, 0.040886007249355316, -0.004305404145270586, 0.0019321783911436796, 0.011489549651741982, -0.030722353607416153, -...
0.804157
0.787686
0.016471
Let \( K \) be a field and \( f(x) \in K[x] \) an irreducible polynomial of degree \( n \). Let \( L \) be the splitting field of \( f \) over \( K \). If \( \beta \in L \) is any root of the minimal polynomial of some \( c \in L \), what is the degree of the extension \( [L : K(c)] \), and how does it relate to the de...
automath
[ 0.021916327998042107, 0.0318942554295063, -0.04714387655258179, -0.03375387564301491, 0.027531029656529427, -0.02377406321465969, -0.008269964717328548, 0.050229787826538086, 0.0345747135579586, -0.009342517703771591, 0.006873265374451876, 0.01740373857319355, -0.039268095046281815, 0.0008...
0.820911
0.802999
0.017912
Let \( T(z) = \frac{az+b}{cz+d} \) be a linear fractional transformation where \( a, b, c, d \in \mathbb{R} \) and \( ad - bc = 1 \). If \( z \) is restricted to the positive imaginary axis \( \{iy: y > 0\} \), determine the conditions under which the image of this transformation is: 1. A vertical line at \( x = \frac...
automath
[ 0.013418962247669697, 0.05064484104514122, -0.04127969592809677, -0.04953708499670029, 0.047880083322525024, 0.0018531314563006163, 0.00177027250174433, 0.06092490628361702, 0.027991056442260742, 0.002951554488390684, -0.007356440648436546, -0.004757990594953299, -0.022159891203045845, -0....
0.824776
0.80461
0.020165
Let $X$ be a discrete random variable taking values $1, 2, 3, \ldots, n$ with probabilities $\Pr(X = i) = p_i$ for $i = 1, 2, \ldots, n$, where $p_i > 0$ and $\sum_{i=1}^n p_i = 1$. If the expected value \( E[X] \) is given by \( E[X] = 10 \), and \( X \) takes on values from 1 to 20, what is the maximum possible value...
automath
[ -0.006229388527572155, 0.010211924090981483, -0.04699419066309929, -0.033689964562654495, 0.023306218907237053, -0.012095915153622627, -0.03358760476112366, 0.053455933928489685, 0.016943547874689102, -0.0008079669787548482, 0.00903315469622612, 0.052722521126270294, -0.045231252908706665, ...
0.828266
0.811429
0.016837
Given a symmetric matrix \( A \in \mathbb{R}^{n \times n} \) with eigenvalues \( \lambda_1(A) \leq \lambda_2(A) \leq \cdots \leq \lambda_n(A) \), and a diagonal matrix \( D \) with diagonal entries \( d_1, d_2, \ldots, d_n \), what are the conditions under which the eigenvalues of the matrix \( A + D \) can be guarante...
automath
[ 0.010729407891631126, 0.023309076204895973, -0.03401685506105423, -0.05202702432870865, 0.022903522476553917, -0.011477344669401646, -0.00857576448470354, 0.06789889931678772, 0.025168202817440033, -0.015656694769859314, 0.009972372092306614, 0.023104149848222733, -0.035514067858457565, -0...
0.805545
0.781669
0.023877
Let \( B \) be an abelian finite group of order \( p^r \) for a prime \( p \) and integer \( r \). If the decomposition of \( B \) is given by \( B \cong B_1 \times B_2 \times \cdots \times B_k \), where each \( B_i \) is a cyclic group, what is the maximum possible number of distinct cyclic subgroups that can occur in...
automath
[ 0.029564030468463898, 0.029256034642457962, -0.047405265271663666, -0.02108408324420452, 0.016817953437566757, -0.029912760481238365, -0.022533928975462914, 0.034295905381441116, 0.02953619882464409, 0.011526376008987427, -0.0035431100986897945, 0.03462551161646843, -0.022239983081817627, ...
0.825499
0.808275
0.017224
Given two infinite-dimensional linear operators \( A: V \to V \) and \( B: V \to V \) on a vector space \( V \) with a basis such that every element in \( V \) can be represented by a finite linear combination of basis elements, can we define the Kronecker product \( A \otimes B \) and ensure that it satisfies the prop...
automath
[ 0.023872746154665947, 0.04429624229669571, -0.036830008029937744, -0.03532467409968376, 0.045708782970905304, 0.00030397684895433486, -0.008451770059764385, 0.08106406778097153, 0.041752006858587265, 0.004838157910853624, 0.015633853152394295, 0.0373932346701622, -0.02393491007387638, -0.0...
0.803423
0.784674
0.018749
In a stable $\infty$-category $C$, given two morphisms $f, f': X \to Y$, under what conditions can we conclude that the coequalizer of $f$ and $f'$ is isomorphic to the cofiber of the morphism $f - f'$? Provide a specific example of such morphisms where this holds true, and illustrate the construction of the correspond...
automath
[ 0.0098245395347476, 0.023533286526799202, -0.03663618117570877, -0.023210695013403893, 0.027484877035021782, -0.012208176776766777, -0.007924471981823444, 0.08751879632472992, 0.04108751565217972, -0.01455836370587349, 0.000468275451567024, 0.019091887399554253, -0.011982973664999008, 0.01...
0.813046
0.794146
0.0189
Let \( f(x,y,m) = (x^2 + y^2)^2 - m (x^2 - y^2) \). For which values of \( m \) does the level set \( f(x,y,m) = 0 \) have real solutions in the region \( x^2 \neq y^2 \) for \( x \) and \( y \) such that \( -2 \leq x, y \leq 2 \)? Determine the range of \( m \) that yields a non-empty contour plot of \( f(x,y,m) = 0 \...
automath
[ 0.020492423325777054, 0.021806105971336365, -0.061400700360536575, -0.05514240637421608, 0.038411013782024384, -0.006659405771642923, -0.02521480992436409, 0.08020554482936859, 0.03518664464354515, -0.01740804873406887, 0.005109874531626701, 0.041373107582330704, -0.025613438338041306, -0....
0.824571
0.803023
0.021547
Let \( f: \mathbb{R} \to \mathbb{R} \) be the function defined by \( f(x) = e^{\sin(x)} \cdot \cos(x) \). Determine the codomain of the function \( f \) and find the range of \( f \). Then, explain whether the function \( g: \mathbb{R} \to \mathbb{R} \) defined as \( g(x) = \sin(x) \) is surjective onto its codomain. W...
automath
[ 0.019575312733650208, 0.031888194382190704, -0.04578612372279167, -0.03433462232351303, 0.030879659578204155, -0.009273365139961243, -0.010799185372889042, 0.06537123024463654, 0.03702987730503082, 0.00963672250509262, 0.013136218301951885, 0.024015458300709724, -0.028868822380900383, -0.0...
0.820225
0.800982
0.019243
In triangle \( ABC \), with \( AB = 2 \cdot AC \), points \( D \) and \( E \) lie on \( \overline{AB} \) and \( \overline{BC} \) respectively such that \( \angle BAE = \angle ACD \), and the intersection of segments \( AE \) and \( CD \) is point \( F \). If triangle \( CFE \) is equilateral, what is the measure of ang...
automath
[ 0.040391530841588974, -0.005393079947680235, -0.038988202810287476, -0.047425203025341034, 0.018947241827845573, -0.023263253271579742, -0.001667262869887054, 0.04977041482925415, 0.03239751234650612, 0.00839040707796812, 0.01527863647788763, 0.029117856174707413, -0.02671426348388195, -0....
0.818434
0.801571
0.016862
Given \( N \) balls of different colors and \( M \) bins with sizes \( S_i \) for \( 1 \leq i \leq M \), if you randomly distribute the \( N \) balls among the bins such that each bin \( B_i \) can hold up to \( S_i \) balls, what is the probability of finding exactly \( n_i \) balls in bin \( B_i \) for \( 1 \leq i \l...
automath
[ -0.006606084294617176, 0.02993950992822647, -0.04645228013396263, -0.01571556366980076, 0.023456541821360588, -0.0038146590813994408, -0.034030891954898834, 0.028865376487374306, 0.027666909620165825, -0.006963970139622688, 0.008023973554372787, 0.04241077974438667, -0.013558389618992805, ...
0.825575
0.808093
0.017482
Given the complex function \( f(z) = \sqrt{z-1} \cdot \sqrt{z+1} \), determine the exact values of the points where branch cuts begin, and check whether \( z = \infty \) is a branch point. Specifically, can you derive a rigorous argument that uses the substitution \( z = \frac{1}{w} \) to analyze the behavior of \( f(z...
automath
[ 0.022871803492307663, 0.05874432623386383, -0.03560658171772957, -0.05048612877726555, 0.021868612617254257, 0.00006821403803769499, 0.011799906380474567, 0.0643284022808075, 0.025333711877465248, 0.006288773845881224, 0.011632584035396576, 0.006115135736763477, -0.03622608631849289, -0.01...
0.825014
0.803064
0.021949
Consider an inner product space \( V \) of dimension \( n \), and let \( (e_1, e_2, \ldots, e_n) \) be an orthonormal basis for \( V \). If \( v \) is a vector in \( V \) such that \( \|v\| = 5 \), what is the maximum possible value of \( |\inner{v}{e_k}| \) for any \( k = 1, 2, \ldots, n \)?
automath
[ 0.034600064158439636, 0.03200533613562584, -0.03647304326295853, -0.017569903284311295, 0.03843983635306358, 0.0036474019289016724, -0.027689095586538315, 0.06336064636707306, 0.02054634690284729, -0.0019765293691307306, -0.005317801609635353, 0.04311603307723999, -0.027651378884911537, -0...
0.823602
0.804233
0.019369
Given a bounded measurable set \( A \subset \mathbb{R}^d \) with Lebesgue measure \( m(A) \), what is the largest \( \varepsilon > 0 \) such that there exists a compact set \( K_{\varepsilon} \subset A \) satisfying \( m(A \setminus K_{\varepsilon}) < \varepsilon \)? Assume \( m(A) \neq 0 \).
automath
[ 0.03151819482445717, 0.04063935950398445, -0.029823075979948044, -0.03681061044335365, 0.04400161653757095, -0.0016601007664576173, -0.024507489055395126, 0.0641888752579689, 0.0668669268488884, 0.0018246732652187347, 0.010001862421631813, 0.008746374398469925, -0.035784393548965454, 0.013...
0.826757
0.800621
0.026136
Let \( A \) and \( B \) be \( n \times n \) positive definite matrices. If the eigenvalues of \( A \) are \( \lambda_1, \lambda_2, \ldots, \lambda_n \) and the eigenvalues of \( B \) are \( \mu_1, \mu_2, \ldots, \mu_n \), determine the maximum value of \( \text{tr} \exp(A+B) \) in terms of the traces of \( \exp(A) \) a...
automath
[ 0.02539198286831379, 0.013326010666787624, -0.04813291132450104, -0.0341971255838871, 0.033898066729307175, -0.013282655738294125, -0.009982882998883724, 0.05999244004487991, 0.041522491723299026, -0.009599268436431885, 0.013644051738083363, 0.04298081248998642, -0.0423947311937809, -0.007...
0.817676
0.801161
0.016515
Given a 5x4 grid of lights where each light can be blue, red, purple, or green, and changing the color of one light affects its adjacent lights by cycling their colors, determine whether it is always possible to reach a configuration where all lights are blue from any initial configuration. If possible, demonstrate you...
automath
[ -0.0023411556612700224, 0.04395696520805359, -0.030429579317569733, -0.03183255344629288, 0.016116872429847717, -0.039270173758268356, -0.021327408030629158, 0.07590609043836594, 0.03191814944148064, -0.017486758530139923, 0.016560347750782967, 0.01581924594938755, -0.013073138892650604, -...
0.830958
0.809926
0.021031
For a smooth, lower bounded convex function \( F(x) \) defined on \( \mathbf{R}^n \) with positive definite Hessian matrix and a gradient sequence \( \{\mathbf{g}_k\} \) that converges to zero, does the condition \( F(x_{k+1}) \leq F(x_k) \) guarantee that \( \lim_{k \to \infty} F(x_k) = \inf_{x \in \mathbf{R}^n} F(x) ...
automath
[ -0.017435438930988312, 0.045768704265356064, -0.04337187111377716, -0.03528022766113281, 0.04208871349692345, -0.005807379260659218, -0.029235906898975372, 0.07789203524589539, 0.01002397108823061, -0.02435016818344593, -0.014347964897751808, 0.019240625202655792, -0.037165310233831406, -0...
0.818394
0.795876
0.022517
Given two edge-directed graphs \( G_1 \) and \( G_2 \) with bounded degree, where each vertex has a maximum out-degree and in-degree of \( d \), describe a method to construct a corresponding undirected graph \( H \) from each \( G_i \) such that a graph isomorphism between the undirected graphs \( H_1 \) and \( H_2 \)...
automath
[ 0.008305814117193222, 0.03009452298283577, -0.018847350031137466, -0.007897790521383286, 0.009998583234846592, -0.013454792089760303, -0.01794099062681198, 0.048653047531843185, 0.0235391017049551, -0.020580753684043884, 0.025363897904753685, 0.024731621146202087, -0.01405180711299181, 0.0...
0.814971
0.792831
0.02214
Determine all real-valued continuous functions \( f: \mathbb{R} \to \mathbb{R} \) such that for all \( x, y, x_1, y_1 \) satisfying \( x^2 + y^2 = x_1^2 + y_1^2 \), the equation \[ f(x) f(y) = f(x_1) f(y_1) \] holds. What can you conclude about the form of such functions \( f \)?
automath
[ 0.02222530171275139, 0.04751330986618996, -0.05782892927527428, -0.04841693118214607, 0.040487661957740784, -0.011125869117677212, 0.000625109882093966, 0.07311299443244934, 0.0394328273832798, -0.025837788358330727, 0.007904686033725739, 0.03302943333983421, -0.02281997539103031, -0.01875...
0.834005
0.805053
0.028952
Let \( X = \mathbb{P}^3 \) and consider a line \( C \) in \( X \) defined by the ideal \( \langle y_2, y_3 \rangle \) in homogeneous coordinates \( [y_0, y_1, y_2, y_3] \). Determine the length of the cokernel of the inclusion of the ideal \( \langle a_{i,j} \rangle^2 \) in the defining ideal of the closed subscheme \(...
automath
[ 0.00790474284440279, 0.02402583509683609, -0.04746437445282936, -0.026044422760605812, 0.011714349500834942, -0.007925332523882389, -0.004591561388224363, 0.07698862254619598, 0.03603913635015488, -0.006184050813317299, 0.001293935696594417, 0.032667241990566254, -0.030017796903848648, -0....
0.826344
0.804562
0.021781
Given three externally tangent circles with radii \( r_1, r_2, \) and \( r_3 \), let their centers be \( c_1, c_2, \) and \( c_3 \) respectively. Is it possible to construct three smaller circles that are tangent to each other and also tangent to the original circles? If so, what is the relationship between the radii o...
automath
[ 0.012160349637269974, 0.055379483848810196, -0.03954101353883743, -0.02357817441225052, 0.03137682005763054, 0.0030194614082574844, -0.01006184983998537, 0.049092140048742294, 0.020102139562368393, -0.0032143855933099985, 0.010379375889897346, 0.016390899196267128, -0.0554371140897274, -0....
0.820033
0.797458
0.022575
Let \( X \) and \( Y \) be two independent random variables uniformly distributed on the interval \( (0, 1) \). If \( E[X^n Y^m] = E[X^n] E[Y^m] \) holds for all \( n, m \in \mathbb{N} \), what is the value of \( E[X^2 Y^3] \)?
automath
[ 0.007046371698379517, 0.013627827167510986, -0.056053489446640015, -0.030987974256277084, 0.034975774586200714, -0.0014782021753489971, -0.020527277141809464, 0.051371365785598755, 0.0452742837369442, -0.031130557879805565, 0.01103237271308899, 0.03310279920697212, -0.04426542669534683, -0...
0.826487
0.807465
0.019022
Given \( Z_n = \max_{1 \leq i \leq n} X_i \) where \( X_i \) are i.i.d. random variables following the standard normal distribution \( \mathscr{N}(0,1) \), what is the behavior of the sequence \( Z_n \) as \( n \) approaches infinity? Specifically, demonstrate that \[ \frac{Z_n}{\sqrt{2 \log n}} \overset{a.s.}{\to} 1....
automath
[ 0.0008072986383922398, 0.038465384393930435, -0.023640112951397896, -0.035511646419763565, 0.016935955733060837, -0.007615271955728531, -0.027027616277337074, 0.04130617529153824, 0.017859984189271927, -0.02006768435239792, 0.01515643484890461, 0.016791347414255142, -0.03252055495977402, 0...
0.819116
0.799223
0.019893
Given two points \(\alpha, \beta \in \mathbb{R}^n\) with a distance \(d = |\alpha - \beta|\) and a continuous path \(\gamma : [0, 1] \to \mathbb{R}^n\) such that \(\gamma(0) = \alpha\), \(\gamma(1) = \beta\), and \(\gamma([0, 1]) \subset [\alpha, \beta]\), if \(\gamma\) is not necessarily \(C^1\), can we construct a se...
automath
[ -0.004218120127916336, 0.03342436999082565, -0.045697249472141266, -0.027373582124710083, 0.024475347250699997, -0.012053468264639378, -0.025413164868950844, 0.06139001250267029, 0.02950034849345684, -0.018037568777799606, 0.012460381723940372, 0.012914570979773998, -0.0271528959274292, -0...
0.826554
0.789738
0.036816
Given a subset \( B = \{0, 1\} \) in the topological vector space \( \mathbb{R} \), determine the convex hull of \( B \) and find its closure. What is the resulting set, and is this set closed in the standard topology of \( \mathbb{R} \)?
automath
[ 0.022838614881038666, 0.04726887494325638, -0.03807859122753143, -0.024855725467205048, 0.03483596444129944, -0.004685082472860813, -0.019744422286748886, 0.057355593889951706, 0.05071140080690384, -0.022930171340703964, 0.016308311372995377, 0.033593349158763885, -0.045280687510967255, -0...
0.827845
0.808923
0.018923
Let \( A \) and \( B \) be real symmetric matrices of size \( n \times n \). Which of the following statements is true? 1. \( AA^T = I \) 2. \( A = A^{-1} \) 3. \( AB = BA \) 4. \( (AB)^T = BA \) Assuming \( A \) and \( B \) are not necessarily invertible, which statements can be verified as correct for all symmetric...
automath
[ 0.060100238770246506, 0.049954090267419815, -0.04047413170337677, -0.03665986657142639, 0.043707769364118576, -0.0284213088452816, 0.0019788320641964674, 0.09011588245630264, 0.04569661244750023, -0.02402080036699772, 0.006509439088404179, 0.022422749549150467, -0.040831293910741806, -0.02...
0.818155
0.797589
0.020566
Given a homogeneous polynomial $$ F = a_0 x_0 f_3(x_1, x_2, x_3) + x_1^2 f_2(x_0, x_1, x_2, x_3, x_4) + x_0 x_1 g_3(x_0, x_1, x_2, x_3, x_4) $$ where \( f_i \) and \( g_j \) are polynomials with arbitrary non-zero coefficients, can you determine the singular locus of \( F \) in \( \mathbb{P}^4 \) in terms of the sy...
automath
[ 0.010291512124240398, 0.0421135239303112, -0.025537405163049698, -0.04647144302725792, 0.027868790552020073, -0.024433963000774384, -0.021202819421887398, 0.05290231481194496, 0.042732514441013336, 0.0011501518310979009, 0.014193856157362461, 0.041408758610486984, -0.016522496938705444, -0...
0.824295
0.807204
0.01709
Let \( N \) be the total number of members in a population, and \( n \) be the size of a random sample taken from this population. If the probability \( r \) that a randomly selected member answers "yes" is known, express the variance \( \Var(R) \) of the sample proportion \( R \) in terms of \( n, r, \) and \( N \). A...
automath
[ 0.002434421330690384, 0.03104402683675289, -0.05746087804436684, -0.020626859739422798, 0.025651397183537483, -0.03748214617371559, -0.01309272088110447, 0.05429450422525406, 0.012728077359497547, 0.015309520065784454, 0.010114067234098911, 0.027589017525315285, -0.04510253295302391, 0.004...
0.812782
0.794866
0.017917
Let \( f:D\to \mathbb{R} \) be a bounded function such that \( f \) is continuous at a point \( a \in D \). If \( f \) is known to be left continuous and right continuous at \( a \), what can we conclude about the behavior of \( f \) at all points in a neighborhood of \( a \)? Specifically, if \( f \) is left continuou...
automath
[ 0.023453079164028168, 0.04459367319941521, -0.04556475579738617, -0.03528674691915512, 0.004746018908917904, -0.01850857026875019, -0.0040665059350430965, 0.0574430488049984, 0.031549423933029175, 0.0024170756805688143, 0.007109725847840309, 0.044381365180015564, -0.03218776732683182, -0.0...
0.822702
0.800446
0.022256
Given two values \( v_1 \) and \( v_2 \) defined as \( v_1 = a + r_1 \) and \( v_2 = (-r_1) + r_2 \), where \( r_1 \) and \( r_2 \) are chosen uniformly and randomly from the finite field \( \mathbb{F}_p \), can a semi-honest adversary uniquely determine the value of \( a \) using the equation \( v_1 + v_2 = a + r_2 \)...
automath
[ 0.010598976165056229, 0.039096131920814514, -0.023994076997041702, -0.02972058393061161, 0.02695821039378643, -0.012323487550020218, -0.0031193967442959547, 0.061013560742139816, 0.045830368995666504, -0.029660334810614586, 0.011807087808847427, 0.04130299761891365, -0.028396042063832283, ...
0.835946
0.819729
0.016217
Let \( g(z) = \frac{a_1 z + b_1}{c_1 z + d_1} \) be a rational function where \( a_1, b_1, c_1, d_1 \in \mathbb{Z} \), \( (a_1 - d_1)^2 + 4b_1c_1 \neq 0 \), and at least one of \( c_1 \) or \( d_1 \) is non-zero. If \( g^n(z) = z \) for some positive integer \( n \) and \( g^j(z) \neq z \) for all \( 0 < j < n \), what...
automath
[ 0.026507416740059853, 0.03102285973727703, -0.04880085587501526, -0.03218969330191612, 0.0396423302590847, -0.010016374289989471, -0.012152901850640774, 0.03559053689241409, 0.026508279144763947, -0.0036042050924152136, 0.01067559327930212, 0.018948271870613098, -0.02613716945052147, -0.02...
0.839452
0.817099
0.022353
Consider the equation \( p + q + r = n \), where \( p, q, r \in \mathbb{N} \) and \( 8 \leq n \leq 12 \). Using combinatorial methods, determine the total number of positive integral solutions to this equation for all values of \( n \) in the specified range. What is the total count of solutions?
automath
[ 0.03023652173578739, 0.012477505020797253, -0.04295746609568596, -0.017627427354454994, 0.022884715348482132, -0.008087334223091602, -0.019723637029528618, 0.05018485337495804, 0.027123408392071724, -0.001243172911927104, -0.007444092538207769, 0.03053373470902443, -0.0349993072450161, -0....
0.834496
0.8169
0.017596
What is the smallest integer \( n \) such that for any subset \( \mathcal{A} \) of \( [2]^n \) with average density at least \( \delta \) in each slice of \( [2]^n \), there exists a set \( A \) of size \( m \) and disjoint sets \( D_1, D_2, \ldots, D_k \) all of the same size such that \( A \cup D_1 \cup \ldots \cup D...
automath
[ 0.03423701599240303, 0.03287011757493019, -0.03077532723546028, -0.023995166644454002, 0.030362538993358612, -0.011249125003814697, -0.045519281178712845, 0.053672388195991516, 0.04120413586497307, 0.00028883464983664453, 0.018700754269957542, 0.0193619504570961, -0.024935510009527206, -0....
0.842462
0.825981
0.016481
Given the piecewise-defined function \( f(x) \) as follows: \[ f(x) = \begin{cases} x & \text{for } 1 \leq x \leq 50 \\ x^2 & \text{for } 51 \leq x \leq 68 \\ ax + b & \text{for } 69 \leq x \leq 98 \\ c & \text{for } 99 \leq x \leq 100 \end{cases} \] where \( a \), \( b \), and \( c \) are constants to be determin...
automath
[ 0.01886136457324028, 0.014682021923363209, -0.043708231300115585, -0.013002486899495125, 0.02554214932024479, -0.01871725358068943, -0.022887784987688065, 0.0747545063495636, 0.03762305900454521, -0.009042482823133469, 0.0033368119038641453, 0.028350315988063812, -0.023974819108843803, -0....
0.826115
0.809567
0.016549
If \( A \), \( B \), and \( C \) are sets, determine whether the following statement holds true: \[ (B \cap A) \cap (A' \cup C') = (B \cap A) \cap A' \cup (B \cap A) \cap C' \] If the statement is true, what set theory law justifies this equivalence?
automath
[ 0.03980858996510506, 0.02735072188079357, -0.03261343762278557, -0.004969068802893162, 0.04122372716665268, -0.03586370125412941, -0.017069531604647636, 0.06713825464248657, 0.039871446788311005, -0.022002974525094032, 0.008740349672734737, 0.00712559511885047, -0.035450488328933716, -0.02...
0.815072
0.798176
0.016897
Given a commutative ring \( R \) and two finitely generated abelian groups \( A \) and \( B \), compute \( \mathrm{Tor}_1^R(A, B) \) by expressing \( A \) in terms of its invariant factors. What is the resulting structure of \( \mathrm{Tor}_1^R(A, B) \) in terms of \( \mathbb{Z} \) and \( \mathbb{Z}/k\mathbb{Z} \) comp...
automath
[ 0.05683822184801102, 0.052103955298662186, -0.02250087819993496, -0.005226759240031242, 0.021394046023488045, -0.03415287286043167, 0.0019070090493187308, 0.05330702289938927, 0.029548268765211105, -0.005699975416064262, -0.0030446364544332027, 0.02598780021071434, -0.03859464079141617, -0...
0.819239
0.800412
0.018828
Given a collection of affine schemes \( \{X_i\}_{i \in I} \) and quasi-coherent sheaves \( \{\mathcal{F}_i\}_{i \in I} \) with morphisms \( \{\alpha_\phi\}_{\phi \in \Phi} \) between them, if there exists a cardinal \( \kappa \) such that every object \( (\{\mathcal{F}_i\}_{i \in I}, \{\alpha_\phi\}_{\phi \in \Phi}) \)...
automath
[ 0.005483724642544985, 0.03635267913341522, -0.03635914623737335, -0.01301269419491291, 0.025592941790819168, -0.015193458646535873, -0.032135359942913055, 0.08504670113325119, 0.025592049583792686, -0.00817521009594202, 0.004699283745139837, 0.01888245902955532, -0.032092802226543427, 0.00...
0.811399
0.790072
0.021327
Let \( S = \mathbb{R} \) and define a pseudometric \( d(x, y) = |x - y| \) for \( x, y \in \mathbb{R} \). Determine the open ball \( B_{\frac{1}{2}}(0) \) in the topology induced by \( d \) and provide its representation as an interval in \( \mathbb{R} \). What are the endpoints of this interval?
automath
[ 0.0024666276294738054, 0.008345488458871841, -0.06686477363109589, -0.044614650309085846, 0.027768494561314583, 0.0024924036115407944, -0.026698855683207512, 0.07090345770120621, 0.053811099380254745, -0.01407370250672102, 0.0028671235777437687, 0.056307826191186905, -0.02437669038772583, ...
0.826423
0.800794
0.025629
Is it possible to define a total order on the set of complex numbers \(\mathbb{C}\) such that for any two complex numbers \(z_1, z_2 \in \mathbb{C}\), the relation \(z_1 \le z_2\) holds if and only if the real part of \(z_1\) is less than the real part of \(z_2\), and if they have equal real parts, then the imaginary p...
automath
[ 0.021437784656882286, 0.03301282972097397, -0.041754502803087234, -0.02928459458053112, 0.031056895852088928, -0.0071845464408397675, 0.006276742555201054, 0.04679323732852936, 0.035617418587207794, -0.015448780730366707, 0.01115371659398079, 0.017992651090025902, -0.0495293103158474, -0.0...
0.829552
0.805835
0.023717
Let \( f(x) \) be a continuous function on the interval \([1, 3]\) such that \( f(1) = -2 \) and \( f(3) = 0 \). If \( f'(c) \) exists for some \( c \in (1, 3) \), what must be true about the slope of the secant line connecting the points \((1, f(1))\) and \((3, f(3))\)? Find the value of \( c \) that satisfies the con...
automath
[ 0.019474007189273834, 0.026019014418125153, -0.06696896255016327, -0.03984852507710457, 0.04021851345896721, 0.005051895044744015, -0.04015129804611206, 0.07462816685438156, 0.01519169844686985, -0.007939266972243786, 0.014646613039076328, 0.04384143278002739, -0.019487600773572922, -0.018...
0.829463
0.811374
0.018089
Given a trapezoid with side lengths 3, 5, 7, and 11, the various possible trapezoids can yield different areas. If the sums of all possible areas can be expressed in the form \( r_1\sqrt{n_1}+r_2\sqrt{n_2}+r_3 \), where \( r_1, r_2, r_3 \) are rational numbers and \( n_1, n_2 \) are positive integers that are not divis...
automath
[ 0.03149215131998062, 0.028602199628949165, -0.02745690941810608, -0.0531303770840168, 0.030376790091395378, -0.005602758843451738, -0.04096014425158501, 0.04876749590039253, 0.0303740743547678, 0.00890687108039856, 0.01688482239842415, 0.0422627329826355, -0.05792579427361488, -0.024401571...
0.846724
0.82212
0.024605
Given the integral $$ I = \int_{0}^{a} \left( \int_{x}^{2a-x} \frac{y-x}{4a^2 + (y+x)^2} \, dy \right) dx, $$ make the substitutions $$ u = x+y, \quad v = x-y $$ and determine the new limits of integration for the region over which this integral is evaluated. Furthermore, find the value of the transformed integ...
automath
[ 0.027441376820206642, 0.036306753754615784, -0.02251073345541954, -0.021049249917268753, 0.027085058391094208, -0.0013802535831928253, -0.012662628665566444, 0.07638384401798248, 0.05177808925509453, -0.01306002028286457, 0.0061495802365243435, 0.04097256064414978, -0.028124559670686722, -...
0.814082
0.796007
0.018076
Construct a nonempty subset \( U \) of \( \mathbb{R}^2 \) that is closed under vector addition and additive inverses, but is not a subspace of \( \mathbb{R}^2 \). What is an explicit representation of \( U \) and how can you verify that it fulfills the given conditions?
automath
[ 0.011270811781287193, 0.02790113165974617, -0.022231116890907288, -0.0338306650519371, 0.036121416836977005, -0.016624731943011284, -0.008307397365570068, 0.06171168386936188, 0.04380875453352928, 0.002173530636355281, 0.03367490693926811, 0.029108237475156784, -0.017188770696520805, -0.02...
0.82389
0.806468
0.017423
Given the number of sticks Mirko has, suppose he has \( a = 3 \) horizontal sticks, \( b = 3 \) vertical sticks, \( c = 3 \) diagonal sticks at \( 45^\circ \), and \( d = 3 \) diagonal sticks at \( 135^\circ \). What is the minimal possible area of the polygon that Mirko can construct using all the sticks, following ...
automath
[ 0.030294284224510193, 0.011067255400121212, -0.030091218650341034, -0.031011871993541718, 0.020708782598376274, -0.004483241122215986, -0.01855992153286934, 0.05455480515956879, 0.019908485934138298, 0.0029706968925893307, -0.013842246495187283, 0.037945330142974854, -0.033537380397319794, ...
0.833443
0.81544
0.018002
Is there a constant \( c > 0 \) such that for every \( n \times k \) matrix \( F \) with orthonormal columns, the following inequality holds true: \[ \|F^-\| \leq \mathrm{dist}(F; St_+(n,k)) \leq c \|F^-\| \] for \( k = 2 \) and where \( \mathrm{dist}(F; St_+(n,k)) \) is the distance from \( F \) to the set of \( n \...
automath
[ 0.0023818672634661198, 0.01603400520980358, -0.050453122705221176, -0.02109571546316147, 0.03486483544111252, -0.004005638416856527, -0.024604538455605507, 0.0650198683142662, 0.035544805228710175, -0.0067166234366595745, 0.0013489938573911786, 0.025472020730376244, -0.03297862783074379, -...
0.825428
0.806643
0.018785
Can every positive odd integer \( n \) be represented as a sum of four squares \( n = a^2 + b^2 + c^2 + d^2 \) where the sum of the squares \( a+b+c+d = 1 \)? If so, how many such representations exist for \( n = 2k + 1 \) where \( k \) is a positive integer?
automath
[ 0.022143004462122917, 0.02013440988957882, -0.05738614499568939, -0.038443680852651596, 0.0437236912548542, -0.024898912757635117, -0.01814252883195877, 0.0433051660656929, 0.05556442588567734, -0.0031843080651015043, 0.003994652535766363, 0.029937446117401123, -0.036097221076488495, -0.06...
0.840164
0.820961
0.019203
Let \( R \) be a ring with \( 1 \), and consider the equivalence of the following statements: 1. Every \( R \)-module is projective. 2. Every \( R \)-module is injective. 3. Every short exact sequence of \( R \)-modules splits. If \( R \) is a semisimple Artinian ring, how many distinct simple \( R \)-modules are the...
automath
[ 0.03973079472780228, 0.02808106690645218, -0.026072731241583824, -0.027649855241179466, 0.026800353080034256, -0.03166559711098671, -0.014690865762531757, 0.04128037765622139, 0.04600293189287186, -0.02548004500567913, 0.005181408952921629, 0.00647676270455122, -0.044010013341903687, -0.03...
0.824503
0.806355
0.018148
Given the nonlinear partial differential equation \[ u_t = u_{xx} + u_{yy} + u(1 - u) \] defined on the unit disk \(D = \{(x, y) : x^2 + y^2 < 1\}\) with Neumann boundary conditions \[ \frac{\partial u}{\partial n} \bigg|_{\partial D} = 0 \] and the initial condition \[ u(x, y, 0) = x^2 + y^2 - 1, \] what are ...
automath
[ -0.01991012692451477, 0.021459611132740974, -0.05025133863091469, -0.030620668083429337, 0.05585980787873268, 0.008224047720432281, -0.012762393802404404, 0.08745063841342926, 0.04823897406458855, 0.0036262557841837406, 0.025875883176922798, 0.024447256699204445, -0.01877223514020443, -0.0...
0.802809
0.779375
0.023434