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 |
|---|---|---|---|---|---|
Consider a line \( L_1 \) defined by the point \( A_1 = (x_1, y_1) \) and slope \( \theta_1 \). Let \( P = (x, y) \) be a point in the plane.
1. Given the coordinates of point \( P \), determine whether it lies to the left or right of line \( L_1 \).
2. Let the distance from point \( P \) to line \( L_1 \) be \( d =... | automath | [
0.00933167152106762,
0.031615689396858215,
-0.04976193979382515,
-0.03942324221134186,
0.02837969735264778,
-0.013841778039932251,
-0.016208123415708542,
0.04572157934308052,
0.052838101983070374,
-0.007663913536816835,
-0.005794802214950323,
0.02981557883322239,
-0.017196230590343475,
-0.... | 0.823589 | 0.806706 | 0.016883 |
Given an equilateral triangle \( PQR \) with side length \( QR = 1 \), let points \( S \) and \( T \) be located on the sides \( PQ \) and \( PR \), respectively, such that \( ST = TR \) and \( ST \) is perpendicular to \( PQ \). What is the length of \( ST \)?
A. \( \frac{1}{2} \)
B. \( 2 - \sqrt{3} \)
C. \( 2\sqr... | automath | [
0.018915729597210884,
0.007304877508431673,
-0.04887542873620987,
-0.052004504948854446,
0.028822053223848343,
-0.004835271742194891,
-0.0215461403131485,
0.07063010334968567,
0.030710183084011078,
0.00946930330246687,
0.006812702398747206,
0.04942772164940834,
-0.027936339378356934,
-0.01... | 0.836492 | 0.81656 | 0.019932 |
Let \( S = \{1, 2, 3\} \) with the standard order \( \preceq_1 \) and let \( T = \{a, b, c\} \) be an ordered set where \( a \prec_2 b \prec_2 c \). How many distinct order isomorphisms \( \phi: S \to T \) exist? | automath | [
0.030842341482639313,
0.014193842187523842,
-0.051614709198474884,
-0.020112721249461174,
0.025654027238488197,
-0.022638287395238876,
-0.03546326607465744,
0.05466713011264801,
0.02874060533940792,
-0.006336009129881859,
0.010741738602519035,
0.016821280121803284,
-0.03616243600845337,
-0... | 0.820591 | 0.802951 | 0.01764 |
Given a set of vertices and segments in a 2D plane, specifically the following vertices:
1: (0, 3)
2: (1.1, 5.2)
3: (2, 4)
and the following segments represented as ordered pairs of vertex indices:
- [1, 2]
- [2, 3]
- [3, 1]
Determine the faces (enclosed polygons) formed by these segments and list the vertices for ... | automath | [
0.06189495697617531,
0.042598649859428406,
-0.03841404989361763,
-0.037900637835264206,
0.011246069334447384,
-0.017963577061891556,
-0.02643502689898014,
0.05148068442940712,
0.024838102981448174,
0.012566854245960712,
0.02343035861849785,
0.04189663007855415,
-0.03634092956781387,
-0.000... | 0.811899 | 0.793891 | 0.018008 |
Let \( k \) be a field and let \( X, Y, Z \) be schemes locally of finite type over \( k \). If \( \alpha \in \mathop{\mathrm{CH}}_*(X) \), \( \beta \in \mathop{\mathrm{CH}}_*(Y) \), and \( \gamma \in \mathop{\mathrm{CH}}_*(Z) \), what is the condition needed for the associativity of the exterior product such that \((\... | automath | [
0.033678892999887466,
0.02512948028743267,
-0.04728522524237633,
-0.01471493486315012,
0.03206001594662666,
-0.009566606022417545,
-0.0087307533249259,
0.042376697063446045,
0.025590093806385994,
-0.005554166156798601,
-0.015566530637443066,
0.04495001211762428,
-0.037517279386520386,
-0.0... | 0.812526 | 0.793066 | 0.01946 |
Let \( (\Omega, \mathcal{F}, P) \) be a probability space, and let \( A, B \in \mathcal{F} \) such that \( 0 < P(B) < 1 \). Define \( \mathcal{G} = \{ B, \Omega \setminus B, \Omega, \emptyset \} \). Compute \( E[1_A \mid \mathcal{G}] \) explicitly in terms of \( P(A \cap B) \) and \( P(A \cap (\Omega \setminus B)) \), ... | automath | [
0.021366002038121223,
0.015108372084796429,
-0.034614767879247665,
-0.026951346546411514,
0.039005205035209656,
-0.021816328167915344,
-0.02563793584704399,
0.07525628805160522,
0.04518549516797066,
0.0008474304340779781,
0.005802380386739969,
0.03467978164553642,
-0.018252287060022354,
-0... | 0.825143 | 0.79637 | 0.028773 |
Assume $R$ is a complete discrete valuation ring with fraction field $K$, and let $f : X' \to X$ and $g : W \to X_{/T}$ be two morphisms such that $f$ is proper if and only if $g$ is a formal modification. If $p: \mathop{\mathrm{Spec}}(R) \to X$ is a morphism such that $p(\mathop{\mathrm{Spec}}(K))$ is not contained in... | automath | [
0.0127724539488554,
0.03978457301855087,
-0.023294299840927124,
-0.030220109969377518,
0.019413698464632034,
-0.03532281145453453,
0.016329240053892136,
0.0705958753824234,
0.03607017174363136,
-0.015580691397190094,
0.013247075490653515,
0.028260359540581703,
-0.011561531573534012,
0.0154... | 0.81304 | 0.793507 | 0.019533 |
Find three distinct pairs of integers \((x, y)\) such that the expression \(1 + 2^{x^2} + 2^{y^2}\) is a perfect square. | automath | [
0.03156000375747681,
0.04797917604446411,
-0.04304294288158417,
-0.05527404695749283,
0.058815956115722656,
-0.021916450932621956,
-0.02020910009741783,
0.05915094166994095,
0.05138048529624939,
-0.0260928887873888,
0.023615119978785515,
0.014826915226876736,
-0.024811603128910065,
-0.0366... | 0.84835 | 0.826641 | 0.021709 |
Consider the ceiling tower equation defined as follows: for a given positive integer \( n \), let \( a_1 = n \) and \( a_k = \lceil a_{k-1} \rceil \) for \( k = 2, 3, \ldots, 6 \). How many valid pairs \( (r, n) \) exist such that \( a_6 = r \) is also a positive integer? | automath | [
0.020150285214185715,
0.027844920754432678,
-0.04523276537656784,
-0.005792948883026838,
0.04807423800230026,
-0.01715017668902874,
-0.02598087675869465,
0.05494004115462303,
0.01664559729397297,
-0.01956271007657051,
-0.004270151723176241,
0.03163905069231987,
-0.04117073491215706,
-0.028... | 0.84208 | 0.824072 | 0.018008 |
Let \( F_n = 5^{2^n} + 1 \) and \( T_n = 13^{2^n} + 1 \). Is it true that for all \( n \in \mathbf{Z}_{\geq 0} \), the greatest common divisor satisfies
\[
\gcd(F_n, T_n) = 2?
\]
If false, provide a counterexample by calculating \( n \) such that \( \gcd(F_n, T_n) \) is not equal to 2, and identify the actual value ... | automath | [
0.030549125745892525,
0.04386470839381218,
-0.04791535437107086,
-0.05393162742257118,
0.049133602529764175,
-0.01676197722554207,
-0.008940178900957108,
0.07071109861135483,
0.00499051995575428,
-0.006562617141753435,
0.00788730476051569,
0.01528059784322977,
-0.040379203855991364,
-0.018... | 0.837937 | 0.811541 | 0.026396 |
Let \( A \) be an \( m \times n \) matrix such that the matrix equation \( AX = Y \) is consistent for all \( Y \in \mathbb{R}^m \).
(a) What can you conclude about the rank of the matrix \( A \)?
(b) Under the given condition, is it possible for \( m \) to be greater than \( n \)? Justify your answer with a mathem... | automath | [
0.04294595867395401,
0.023626424372196198,
-0.0360574908554554,
-0.04126317799091339,
0.04319274052977562,
-0.036662496626377106,
-0.005234475247561932,
0.0627308338880539,
0.03603159636259079,
-0.021956684067845345,
-0.008752862922847271,
0.023485207930207253,
-0.05269239842891693,
-0.004... | 0.831376 | 0.80777 | 0.023605 |
Consider a complex vector bundle \( E \) of rank \( n \) over a base space \( B \). Let \( c_k(E) \) denote the \( k \)-th Chern class of this bundle. If the Poincaré dual of \( c_k(E) \) represents a cycle \( C \subset B \) where \( n-k+1 \) generic sections of \( E \) become linearly dependent, what is the topologica... | automath | [
0.024852454662322998,
0.03417528048157692,
-0.02462242916226387,
-0.043530337512493134,
0.014688290655612946,
-0.013336003758013248,
-0.001987656345590949,
0.05950943008065224,
0.021807709708809853,
-0.007584842387586832,
0.0018567992374300957,
0.024994488805532455,
-0.029804056510329247,
... | 0.808805 | 0.784152 | 0.024653 |
Let \( X \) and \( Y \) be separable Hilbert spaces, and let \( T: X \to Y \) be a linear continuous operator. Define \( T \) to be a compact operator if for every bounded sequence \( \{x_n\} \) in \( X \), the sequence \( \{Tx_n\} \) has a convergent subsequence in \( Y \). If \( T \) satisfies the condition that for ... | automath | [
0.004675471223890781,
0.0489991195499897,
-0.04844320937991142,
-0.029292957857251167,
0.05162728577852249,
-0.0067746806889772415,
-0.014642465859651566,
0.08132581412792206,
0.04548386484384537,
0.007927590981125832,
0.006875363178551197,
0.02045515552163124,
-0.03613360971212387,
-0.012... | 0.802225 | 0.783323 | 0.018903 |
Let \( T: X \to Y \) be a bounded linear operator on normed linear spaces \( X \) and \( Y \), where \( \|T\|_* = \inf \{ M > 0 : |T(x)| \le M \|x\| \text{ for all } x \in X\} \) and \( \sup \{ T(x) : \|x\| \le 1 \} \) denotes the supremum of \( T(x) \) over all \( x \in X \) with \( \|x\| \le 1 \).
If it is known th... | automath | [
0.008204029873013496,
0.040850963443517685,
-0.053465548902750015,
-0.03503904491662979,
0.04256143048405647,
0.003007818479090929,
-0.031238043680787086,
0.07067039608955383,
0.033296167850494385,
0.0010097218910232186,
0.004868022166192532,
0.04451671987771988,
-0.04195426031947136,
-0.0... | 0.82244 | 0.80459 | 0.01785 |
Let \( \mathbb{X} \) be a Banach space and \( \mathbb{Y} \) be a normed space that is not complete. Is it possible for a bounded linear map \( A: \mathbb{X} \to \mathbb{Y} \) to be a bijection? If so, provide an example. If not, explain why. | automath | [
0.017842331901192665,
0.026276428252458572,
-0.019608652219176292,
-0.030943242833018303,
0.02805214188992977,
-0.016339298337697983,
0.0017373819136992097,
0.07085669040679932,
0.03520670160651207,
-0.012521503493189812,
0.012108097784221172,
0.01701955311000347,
-0.03356681764125824,
-0.... | 0.816755 | 0.793771 | 0.022984 |
In triangle \( ABC \), let \( BC = 7 \) cm, \( \angle B = 45^\circ \), and \( \angle A = 105^\circ \). What are the lengths of sides \( AB \) and \( AC \) when constructing a triangle \( A'B'C' \) such that each side is \( \frac{4}{3} \) times the corresponding side of triangle \( ABC \)? Justify your answer using the ... | automath | [
0.0342833548784256,
0.028914041817188263,
-0.0312800258398056,
-0.04739706963300705,
0.029541725292801857,
-0.013739549554884434,
-0.015494455583393574,
0.045894283801317215,
0.029558170586824417,
-0.014219289645552635,
0.0010609274031594396,
0.04349452257156372,
-0.039582908153533936,
-0.... | 0.825372 | 0.808437 | 0.016935 |
Let \( X = [-1, 2] \) and \( Y = [0, 1] \) be subsets of \( \mathbb{R} \) with the standard topology. Define a set \( A = (0, 1) \). If \( A \) is dense in \( Y \), what can we conclude about the density of \( A \) in \( X \)? Specifically, is \( A \) dense in \( X \)? Provide a counterexample to justify your answer. | automath | [
0.03561524301767349,
0.03609709069132805,
-0.042342886328697205,
-0.028989244252443314,
0.032726701349020004,
-0.01151322666555643,
-0.02632490172982216,
0.04972805827856064,
0.03512900695204735,
-0.023146044462919235,
-0.0035297181457281113,
0.02128525823354721,
-0.038405004888772964,
-0.... | 0.82013 | 0.796954 | 0.023176 |
Consider a 2-dimensional submanifold \( L \) of \( \mathbb{R}^3 \) defined by the surface \( z = f(x, y) \) where \( f \) is a smooth function. If you want to construct a coordinate chart around a point \( p \in L \), how many independent coordinates would you need to uniquely describe points on the manifold \( L \) ne... | automath | [
0.007414449006319046,
0.04489155113697052,
-0.058876462280750275,
-0.04176739230751991,
0.03560400381684303,
0.00707674166187644,
-0.01612602174282074,
0.04841212183237076,
0.016243262216448784,
0.018673477694392204,
-0.010312417522072792,
0.04319754242897034,
-0.025400420650839806,
-0.020... | 0.813964 | 0.794913 | 0.019051 |
Let \( a_1, a_2, \ldots, a_{52} \) be positive integers such that \( a_1 < a_2 < \cdots < a_{52} \) and \( a_{52} = 100 \). The arithmetic mean of \( a_1, a_2, \ldots, a_{52} \) is one less than the arithmetic mean of \( a_2, a_3, \ldots, a_{52} \). What is the largest possible value of \( a_1 \) under these conditions... | automath | [
0.04189808666706085,
0.02433318831026554,
-0.03427984565496445,
-0.04044158384203911,
0.033488206565380096,
-0.01259413082152605,
-0.036354854702949524,
0.05462591350078583,
0.050801195204257965,
-0.019313013181090355,
-0.000547222385648638,
0.014579725451767445,
-0.050395458936691284,
-0.... | 0.844696 | 0.827274 | 0.017422 |
Let \( (S, \preceq) \) be a totally ordered set equipped with a topology \( \tau \). Under what conditions does the pair \( (S, \tau) \) ensure that \( (S, \preceq, \tau) \) is a generalized ordered space? Provide an example of a totally ordered set with a Hausdorff topology that meets these criteria. | automath | [
0.02254915051162243,
0.02714269980788231,
-0.05383702740073204,
-0.05070718377828598,
0.03644009679555893,
-0.011310805566608906,
-0.02586638182401657,
0.07286380976438522,
0.04156095162034035,
-0.0014372068690136075,
0.022144822403788567,
0.020835507661104202,
-0.035983968526124954,
-0.00... | 0.804661 | 0.788223 | 0.016438 |
Given the incompressible 2D Navier-Stokes equations and the relationship between vorticity \(\omega\) and the fluid potential \(\phi\) expressed as \(\nabla^2 \phi = \omega\), consider a rectangular domain \(\Omega\) with periodic boundary conditions.
If we want to find the potential function \(\phi\) such that \(\in... | automath | [
0.013669769279658794,
0.04623834788799286,
-0.03432486951351166,
-0.03489759564399719,
0.015457727015018463,
-0.021830648183822632,
-0.017301304265856743,
0.06565512716770172,
0.025922181084752083,
0.02744142711162567,
0.005009226035326719,
0.027807803824543953,
-0.01938590407371521,
-0.03... | 0.805987 | 0.787824 | 0.018162 |
Consider a bounded open set \(\Omega\) with Lipschitz boundary in \(\mathbb{R}^n\) and let \(W : \mathbb{R} \to [0, \infty)\) be a continuous function such that \(W(z) = 0\) if and only if \(z\) is either \(0\) or \(1\). Define the functional
\[
F_\varepsilon(u) = \begin{cases}
\frac{1}{\varepsilon p'}\int_\Omega W(u... | automath | [
0.0019883483182638884,
0.04673902690410614,
-0.02647610753774643,
-0.01943288743495941,
0.032439880073070526,
-0.00265297363512218,
-0.02367783896625042,
0.06116828694939613,
0.03099985606968403,
0.004800763446837664,
0.008252313360571861,
0.032457735389471054,
-0.04007545858621597,
-0.009... | 0.815074 | 0.7975 | 0.017574 |
How can I construct a well-defined monotonic function \( g: \operatorname{Sub}_{\mathbf{Set}}(X) \to \mathcal{P}(X) \) such that it is the inverse of the monotonic function \( f: \mathcal{P}(X) \to \operatorname{Sub}_{\mathbf{Set}}(X) \), where for every monic \( m: Y \to X \), \( g([m]) = m(Y) \)? Additionally, can yo... | automath | [
0.03559555485844612,
0.034293077886104584,
-0.03243815153837204,
-0.005876501090824604,
0.01885560341179371,
-0.041898515075445175,
-0.014014131389558315,
0.061101485043764114,
0.04188504070043564,
0.0012329410528764129,
0.00252864439971745,
0.009773698635399342,
-0.03019835613667965,
-0.0... | 0.820338 | 0.79728 | 0.023058 |
Let \(X\) and \(Z\) be topological spaces homeomorphic to circles, and let \(Y = \mathbb{R}\). Can there exist a continuous bijective map \(f: X \to Z\) that factors through \(Y\) via a continuous map \(g: X \to Y\)? If so, under what conditions does this hold? If not, provide an example that illustrates this result. | automath | [
0.026721393689513206,
0.044042836874723434,
-0.018180547282099724,
-0.021549630910158157,
0.03125360980629921,
-0.02125762589275837,
-0.006256411783397198,
0.05563328415155411,
0.011905345134437084,
-0.022575892508029938,
0.011197930201888084,
0.022170264273881912,
-0.033155038952827454,
-... | 0.815284 | 0.796559 | 0.018725 |
Given two intersecting circles centered at points A and B, where the distance between the centers \( AB = x \) cm, \( \angle APB = 90^\circ \), and \( \angle PAQ = \frac{\pi}{3} \) radians, find the lengths of the radii \( r_1 \) and \( r_2 \) of the circles in terms of \( x \) using the geometric properties of the tri... | automath | [
0.03213660046458244,
0.02603399008512497,
-0.04003094881772995,
-0.03455697000026703,
0.01703505590558052,
-0.01955837942659855,
-0.026532240211963654,
0.030210129916667938,
0.040467649698257446,
-0.0025375010445713997,
0.014635615982115269,
0.024360591545701027,
-0.03853687271475792,
-0.0... | 0.814003 | 0.788411 | 0.025593 |
For positive integers \( a \) and \( b \), let \( c \) be a constant such that the equation \( x^a(1-x)^b = c \) has two roots \( x_1 \) and \( x_2 \) in the interval \( (0, 1) \).
Assuming \( a = 2 \) and \( b = 3 \), can you find the real roots \( x_1 \) and \( x_2 \) expressed in terms of hypergeometric functions?... | automath | [
0.043799400329589844,
0.04162098839879036,
-0.03597916290163994,
-0.03264284506440163,
0.020497040823101997,
-0.021960986778140068,
0.006806119345128536,
0.07091984897851944,
0.03236987069249153,
-0.023562343791127205,
0.004654203541576862,
0.023874618113040924,
-0.02870423160493374,
-0.04... | 0.840183 | 0.81618 | 0.024003 |
Given a point \( P(x_P, y_P) \) on the circumference of a quarter-circle that is tangent to the x-axis and another line at an angle \( \theta \) from the x-axis, with the center of the circle \( C(x_C, y_C) \) lying on the line \( y = x \) (the diagonal), how can we determine the coordinates of the center \( C \) in te... | automath | [
0.0058507174253463745,
0.041748207062482834,
-0.039061956107616425,
-0.03259725496172905,
0.01648271083831787,
-0.007994480431079865,
-0.016466250643134117,
0.04560882970690727,
0.045153338462114334,
0.005719043780118227,
0.0037783922161906958,
0.017010146751999855,
-0.0300447940826416,
-0... | 0.814929 | 0.796595 | 0.018333 |
Let $\{a_n\}$ be a sequence of real numbers. Under what conditions can we conclude that if the sequence $\{\sin^2(nh) a_n\}$ converges to zero for every $h \in A$, where $A$ is a subset of $\mathbb{R}$, then the sequence $\{a_n\}$ converges to zero? Specifically, does it suffice for $A$ to be a countable or finite set? | automath | [
0.004589396063238382,
0.03420966491103172,
-0.026343204081058502,
-0.03659546747803688,
0.023683158680796623,
-0.0018605568911880255,
-0.008833622559905052,
0.0600145123898983,
0.035159967839717865,
-0.019217533990740776,
0.012126405723392963,
0.010117893107235432,
-0.03668643534183502,
0.... | 0.828744 | 0.809772 | 0.018971 |
Given a sequence of non-negative real numbers \( a_n \) such that \( a_{n+m} \leq a_n + a_m \) for all natural numbers \( n \) and \( m \), can you find the smallest natural number \( m \) such that for all \( n \geq m \), the inequality \( a_n \leq ma_1 + \left(\frac{n}{m} - 1\right) a_m \) holds? | automath | [
0.02012273669242859,
0.023469485342502594,
-0.023112474009394646,
-0.04751292243599892,
0.02740820124745369,
0.008654691278934479,
-0.03065427392721176,
0.08214398473501205,
0.03399939835071564,
-0.0290047787129879,
0.003887456376105547,
0.023359308019280434,
-0.047004807740449905,
-0.0112... | 0.848283 | 0.83152 | 0.016763 |
Let \( G \) be a finite \( p \)-group of order \( p^n \), where \( p \) is a prime and \( n \) is a positive integer. If \( z = |Z(G)| \) denotes the order of the center of \( G \), what can you conclude about the divisibility of \( z \) by \( p \)? Additionally, what does this imply about the existence of non-trivial ... | automath | [
0.04211903363466263,
0.03204284608364105,
-0.03438608720898628,
-0.04000081121921539,
0.022252533584833145,
-0.024630112573504448,
-0.00767245190218091,
0.02245752513408661,
0.02367640659213066,
-0.006885466165840626,
0.009289337322115898,
0.015490738674998283,
-0.05235898867249489,
-0.010... | 0.828906 | 0.808177 | 0.020729 |
Assign values \( a, b, c, d \) as \( \pm \tan \theta \) and \( \pm \frac{1}{\tan \theta} \) such that
\[
\frac{(a-b)(c-d)}{(a-d)(b-c)} = \tan^2(2\theta)
\]
Determine if there exists a combination of these values that satisfies the equation, and if so, provide such a combination. If not, explain why it is not possibl... | automath | [
0.039979491382837296,
0.04765041545033455,
-0.05415971577167511,
-0.034616075456142426,
0.050374552607536316,
-0.022569645196199417,
-0.008473358117043972,
0.06917408853769302,
0.04828576743602753,
-0.014648206532001495,
0.0032866077963262796,
0.018707748502492905,
-0.03581787273287773,
-0... | 0.840999 | 0.818589 | 0.02241 |
Given the function \( F(x) = (f_1(x), \ldots, f_m(x)) \) where \( f_i : \mathbb{R}^n \to \mathbb{R} \) are real-valued functions with continuous first and second derivatives, determine whether the following conditions ensure that the nonlinear least-squares optimization problem
\[
\min_{x \in \mathbb{R}^n} \ \tfrac{1... | automath | [
-0.015439102426171303,
0.04376478120684624,
-0.05471140518784523,
-0.03781477361917496,
0.047465980052948,
0.0013784585753455758,
-0.027931513264775276,
0.0743490532040596,
0.013930021785199642,
-0.003948358353227377,
-0.00755551690235734,
0.010881920345127583,
-0.03984345495700836,
-0.027... | 0.809377 | 0.781455 | 0.027922 |
Given a strictly diagonally dominant matrix \( A \) that is diagonalizable, is it possible to construct a diagonalizing matrix \( X \) such that the condition number \( \kappa(X) = \|X\|_2 \times \|X^{-1}\|_2 \) is bounded below by a constant \( C \) that depends only on the dominance constant \( c \)? If so, what is t... | automath | [
0.0030374692287296057,
0.02606559731066227,
-0.05004064366221428,
-0.01393434964120388,
0.015710994601249695,
-0.008389449678361416,
-0.009804071858525276,
0.07977347075939178,
0.01509812567383051,
-0.01850220188498497,
-0.0017325604567304254,
0.013885327614843845,
-0.036421164870262146,
-... | 0.81705 | 0.796701 | 0.020349 |
Given a homogeneous polynomial \( P(x_1, x_2, \ldots, x_n) \) of degree \( n \) with positive integer coefficients, what can you conclude about the statement "there exists positive integers \( x_1, x_2, \ldots, x_n \) such that \( cx_1 \cdots x_n \leq P(x_1, x_2, \ldots, x_n) \) for a positive integer \( c \)?" Please ... | automath | [
0.02811034955084324,
0.01860741153359413,
-0.04967225342988968,
-0.03989209979772568,
0.017723217606544495,
-0.029340604320168495,
-0.019156917929649353,
0.05578569322824478,
0.037694863975048065,
-0.01664089784026146,
-0.007743106223642826,
0.035459600389003754,
-0.04701120778918266,
-0.0... | 0.844467 | 0.812378 | 0.032089 |
Given a square grid of side length \( L \) where each site is occupied with probability \( p \), let \( P(L, p) \) denote the percolation probability of the largest cluster. Under the assumption of finite size scaling, if \( p_c \) is the critical occupation probability at which a phase transition occurs, describe the ... | automath | [
0.00342833180911839,
0.03946945071220398,
-0.027030358090996742,
-0.04239337891340256,
0.008625555783510208,
-0.008977875113487244,
-0.04018848389387131,
0.0625564455986023,
0.012810373678803444,
0.008527313359081745,
0.019861657172441483,
0.02344360016286373,
-0.025436555966734886,
-0.013... | 0.813931 | 0.788733 | 0.025198 |
Let \( S \) and \( L \) be independent and identically distributed random variables representing the time of birth and the lifetime of an individual, respectively, where both \( S \) and \( L \) follow an exponential distribution with parameter \( \lambda \). Define \( h \) as a time point such that there is a probabil... | automath | [
0.003956284839659929,
0.02356291189789772,
-0.04633435234427452,
-0.03325817734003067,
0.03162866830825806,
-0.014779477380216122,
-0.03143877163529396,
0.08108193427324295,
0.03653771057724953,
0.006133170798420906,
0.018398866057395935,
0.03965117037296295,
-0.03278011083602905,
0.010894... | 0.820463 | 0.8039 | 0.016562 |
Let \( X \) and \( Y \) be normed linear spaces, and let \( \mathcal{B}(X,Y) \) be the space of bounded linear operators from \( X \) to \( Y \). Given a sequence of operators \( (T_n) \) in \( \mathcal{B}(X,Y) \) that converges strongly to an operator \( T \), how does this strong convergence relate to the weak-* conv... | automath | [
0.004475287161767483,
0.03858930617570877,
-0.03410935401916504,
-0.0440247505903244,
0.03592611104249954,
0.00011565304157556966,
0.0067095402628183365,
0.08493156731128693,
0.04078313708305359,
0.0066368188709020615,
-0.007173637859523296,
0.031468529254198074,
-0.043634261935949326,
0.0... | 0.797432 | 0.779221 | 0.018212 |
Consider the series \( \sum_{n=1}^{\infty} \frac{1}{n^2} \) and let \( a_n = \frac{1}{n^2} \). Determine whether the series \( \sum_{m=0}^{\infty} p_m 2^{-m} \) converges or diverges, where \( p_m \) is defined as the largest index \( n \) such that \( a_n \geq 2^{-m} \). Calculate the value of \( p_m \) for various va... | automath | [
-0.004613366909325123,
0.06000784784555435,
-0.023833967745304108,
-0.03149423003196716,
0.03259200230240822,
-0.020144429057836533,
-0.016913531348109245,
0.07636693120002747,
0.03181415796279907,
-0.0020493692718446255,
-0.014465902000665665,
-0.001236231648363173,
-0.02497410960495472,
... | 0.819716 | 0.802522 | 0.017194 |
Given two positive integers \( A \) and \( B \), determine the minimum possible value of \( X \), where \( X \) is defined as the maximum absolute difference between any prime number sequences \( P \) and \( Q \) whose sums are \( A \) and \( B \), respectively. If it is impossible to form such sequences, return -1.
... | automath | [
0.03544357791543007,
0.012020369991660118,
-0.027267849072813988,
-0.024362213909626007,
0.027064908295869827,
-0.015158258378505707,
-0.0018181195482611656,
0.0731864869594574,
0.04507061839103699,
-0.010039092041552067,
0.013073170557618141,
0.026968378573656082,
-0.020995676517486572,
-... | 0.842988 | 0.824867 | 0.018121 |
Consider a 3-dimensional vector space with basis vectors \( \mathbf{e}_1, \mathbf{e}_2, \mathbf{e}_3 \). If a vector \( \mathbf{a} \) can be expressed as \( \mathbf{a} = a_1 \mathbf{e}_1 + a_2 \mathbf{e}_2 + a_3 \mathbf{e}_3 \), where \( a_1, a_2, a_3 \) are the components of \( \mathbf{a} \), and the double dot produc... | automath | [
0.04005752131342888,
0.034379102289676666,
-0.056574828922748566,
-0.030336527153849602,
0.03587144613265991,
0.0016899543115869164,
-0.016494469717144966,
0.08029055595397949,
0.035632118582725525,
-0.005224095657467842,
0.0013950472930446267,
0.028098033741116524,
-0.04746943339705467,
-... | 0.82549 | 0.8083 | 0.01719 |
Given a p-group \( G \) of order \( p^n \) that can be expressed as the product \( G = AB \), where \( A \) is a normal subgroup and \( B \) is an arbitrary subgroup, what can we conclude about the orders of \( A \) and \( B \)? Specifically, if \( |A| = p^k \), what relationship must hold for \( |B| \) in terms of \( ... | automath | [
0.028194380924105644,
0.03667709231376648,
-0.04044429957866669,
-0.020482510328292847,
0.021793073043227196,
-0.012327452190220356,
-0.01746988110244274,
0.027071921154856682,
0.03792816400527954,
0.013626551255583763,
-0.002914207288995385,
0.022488299757242203,
-0.032972365617752075,
-0... | 0.812262 | 0.792959 | 0.019303 |
Given the equation \( \cos \theta + \sin \theta = 1 \) for \( 0 \leq \theta < 2\pi \), determine all possible values of \( \theta \) within the specified range and verify which ones satisfy the original equation. | automath | [
0.024503616616129875,
0.028603754937648773,
-0.036689672619104385,
-0.046394314616918564,
0.049107737839221954,
-0.041931334882974625,
-0.011971937492489815,
0.06586209684610367,
0.030311450362205505,
-0.0057745729573071,
0.02916913479566574,
0.026340635493397713,
-0.022677987813949585,
-0... | 0.825576 | 0.807344 | 0.018231 |
Given the following equilibrium equations for the system of nonlinear ODEs:
1. \( \lambda(\lambda^3 + \lambda^2 + \lambda - \hat{\alpha}(1 - \beta_{1})) = 0 \)
2. \( \lambda(\lambda^3 + \lambda^2 + (1 - \gamma (x_{2}^{0})^2)\lambda - \gamma (x_{2}^{0})^2) = 0 \)
Determine the conditions under which all roots of the f... | automath | [
0.03796165809035301,
0.02385261282324791,
-0.03974902629852295,
-0.037617139518260956,
0.03264185041189194,
-0.03781184181571007,
-0.005313502158969641,
0.07440239936113358,
0.044807836413383484,
-0.025933224707841873,
0.004591559059917927,
0.013462238013744354,
-0.0566440112888813,
-0.053... | 0.814638 | 0.798188 | 0.016451 |
Let \( n \) be a positive integer, and \( d \) be a divisor of \( n \). If the homomorphism \( f: U(n) \rightarrow U(d) \) given by reducing modulo \( d \) is surjective, determine the cardinality of the set
\[
S = \{ u \in U(n) \mid u \equiv 1 \pmod{d} \}
\]
in terms of the Euler's totient function \( \phi \). What... | automath | [
0.02517945133149624,
0.03195386752486229,
-0.03296881914138794,
-0.017492080107331276,
0.04376829415559769,
-0.007570803631097078,
-0.0253452155739069,
0.05117247626185417,
0.04636835306882858,
0.000439638301031664,
-0.0046209124848246574,
0.02495136670768261,
-0.022000707685947418,
-0.032... | 0.839016 | 0.817507 | 0.021509 |
Given two column vectors \(\mathbf{a}\) and \(\mathbf{b}\) in \(\mathbb{R}^n\), if we denote the dot product by \(\mathbf{a} \cdot \mathbf{b}\) and the matrix product of \(\mathbf{a}^T\) and \(\mathbf{b}\) by \(\mathbf{a}^T \mathbf{b}\), determine whether the equations \(\mathbf{a} \cdot \mathbf{b} = \mathbf{a}^T \math... | automath | [
0.03429759666323662,
0.036690983921289444,
-0.054825108498334885,
-0.03632218763232231,
0.050274018198251724,
-0.018436631187796593,
-0.013473764061927795,
0.10136007517576218,
0.04198269918560982,
-0.017891883850097656,
-0.002579927910119295,
0.01868577115237713,
-0.030520856380462646,
-0... | 0.81376 | 0.79407 | 0.01969 |
Let \( A \) be an \( n \times n \) matrix with a QR decomposition \( A = QR \), where \( Q \) is orthogonal and \( R \) is upper triangular with positive diagonal entries. Define \( \sigma_1, \sigma_2, \ldots, \sigma_n \) as the singular values of \( A \). Is it true that the diagonal entries of \( R \) (denoted \( r_{... | automath | [
0.005372151732444763,
0.032799132168293,
-0.03468600660562515,
-0.03508663922548294,
0.026022685691714287,
-0.010660176165401936,
-0.0027415482327342033,
0.06854645907878876,
0.01903667114675045,
-0.0034238258376717567,
0.007635801564902067,
0.0099682891741395,
-0.0396871455013752,
-0.0139... | 0.828782 | 0.804927 | 0.023856 |
Given Schauder's Fixed Point Theorem, which states that a continuous function mapping a non-empty convex compact subset \( K \) of a normed space \( E \) into itself has at least one fixed point, if \( n \) points \( x_1, x_2, \ldots, x_n \) are chosen within \( K \), can you determine the number of distinct fixed poin... | automath | [
0.024426240473985672,
0.031265586614608765,
-0.04537435993552208,
-0.025058215484023094,
0.02929474040865898,
-0.015663083642721176,
-0.001846567029133439,
0.05881936475634575,
0.043708909302949905,
0.0042246365919709206,
0.016262516379356384,
0.010004374198615551,
-0.03584868460893631,
-0... | 0.820111 | 0.794 | 0.026111 |
What are the necessary and sufficient conditions for a test function $\phi$ with compact support in an open ball $B \subset \mathbb{R}^n$ (for $n \geq 2$) to ensure the existence of a test function $\psi$ with compact support in $B$ such that $\Delta \psi = \phi$? | automath | [
0.011804547160863876,
0.02177768014371395,
-0.050976116210222244,
-0.05577873811125755,
0.032859645783901215,
-0.017014335840940475,
-0.01705867424607277,
0.05009303241968155,
0.034898120909929276,
-0.008903381414711475,
-0.0011252447729930282,
0.019368475303053856,
-0.021456044167280197,
... | 0.822941 | 0.805433 | 0.017508 |
Given the equations \( \lambda\cos(2\theta) = \cos(\theta + \alpha) \) and \( \lambda\sin(2\theta) = 2\sin(\theta + \alpha) \), eliminate \(\theta\) and \(\alpha\) to express them only in terms of \(\lambda\). Find the relationship between \(\lambda\) and the resulting expression. Specifically, determine the minimum va... | automath | [
0.02532517910003662,
0.03689853847026825,
-0.05740581825375557,
-0.0444105863571167,
0.04998437687754631,
-0.01305750384926796,
-0.014530886895954609,
0.06363485008478165,
0.025125965476036072,
-0.00490455562248826,
0.006321995053440332,
0.011820548214018345,
-0.019080273807048798,
-0.0256... | 0.823333 | 0.804531 | 0.018803 |
Given a function \( f \) with a continuous second derivative, which of the following statements is sufficient to confirm that \( f \) has an inflection point at \( x = c \)?
1. \( f''(c) = 0 \) and \( f''(x) \) changes signs around \( x = c \).
2. \( f \) is a cubic function of the form \( f(x) = ax^3 + bx^2 + cx + d ... | automath | [
0.038829296827316284,
0.050342727452516556,
-0.03557654097676277,
-0.03371565416455269,
0.039162736386060715,
-0.03596014156937599,
-0.01681995764374733,
0.08045821636915207,
0.020629791542887688,
-0.0015326621942222118,
0.006184350233525038,
0.006143599282950163,
-0.02525399997830391,
-0.... | 0.818618 | 0.800034 | 0.018584 |
Let \( F \) be a field. Determine whether the following statements are true or false:
1. The field \( \mathbb{Q}(\sqrt{2}) \) is Pythagorean.
2. The field \( \mathbb{R} \) is Pythagorean.
3. If \( F \) is a finite field, then \( F \) is Pythagorean.
Provide your reasoning and identify any conditions that must be sati... | automath | [
0.018693841993808746,
0.03985122963786125,
-0.026249241083860397,
-0.04967520013451576,
0.03645452484488487,
-0.048300642520189285,
-0.0017177490517497063,
0.06638044863939285,
0.037389446049928665,
-0.0037024179473519325,
0.01069335825741291,
0.023336028680205345,
-0.044201742857694626,
-... | 0.825622 | 0.805123 | 0.020498 |
Consider a system of linear equations represented by \( AX = B \) where \( A \) is an \( n \times n \) integer matrix, and \( B \) is an integer vector. Let \( \text{det}(A) \) denote the determinant of \( A \). Which of the following statements must be true?
1. If \( \text{det}(A) = 1 \), then the solution \( X \) ha... | automath | [
0.03313116729259491,
0.026769986376166344,
-0.05301683768630028,
-0.03869949281215668,
0.04965462163090706,
-0.0345659963786602,
-0.009107104502618313,
0.08157872408628464,
0.034784119576215744,
-0.015983542427420616,
-0.007680264767259359,
0.01841321587562561,
-0.027486007660627365,
-0.01... | 0.824482 | 0.803241 | 0.021241 |
Let \( k \) be a field and consider the Zariski closed set \( Z \subset k^n \) defined by the vanishing of \( m \) polynomials in \( k[x_1, \ldots, x_n] \). If \( \varphi: Z \to k \) is a regular function, derive the maximum possible degree of the polynomials that can express \( \varphi \) if \( Z \) has dimension \( d... | automath | [
0.04381323605775833,
0.03653029724955559,
-0.03506540134549141,
-0.04691017419099808,
0.038912173360586166,
-0.022375525906682014,
-0.003857462666928768,
0.01883191242814064,
0.04312462732195854,
-0.012767898850142956,
0.009229579009115696,
0.04926931485533714,
-0.020276682451367378,
0.006... | 0.828232 | 0.806544 | 0.021688 |
Let \( A = \{1, 2, 3\} \) and \( B = \{x | x \text{ is a natural number and } x \leq 3\} \). Determine whether the following statements are true or false:
1. \( A \subset B \)
2. \( A \cap B = A \)
3. \( A \cup B = \{1, 2, 3\} \)
Which statement is false? | automath | [
0.04562585428357124,
0.030916107818484306,
-0.028587020933628082,
-0.021793879568576813,
0.02573242038488388,
-0.011640743352472782,
-0.006413567811250687,
0.0695776417851448,
0.0358511283993721,
-0.00533006526529789,
0.007596571929752827,
0.025076542049646378,
-0.03255917876958847,
-0.021... | 0.819414 | 0.802544 | 0.01687 |
Let \( f(x) \) be defined as follows:
\[
f(x) =
\begin{cases}
4 - x^2 & \text{if } x < 2 \\
x^2 - 5x + 6 & \text{if } 2 \leq x < 3 \\
x & \text{if } x \geq 3
\end{cases}
\]
1. Determine the points where the function \( f \) is continuous and justify your answer.
2. Find the values of \( x \) where \( f \) is diff... | automath | [
0.017722347751259804,
0.04837891086935997,
-0.035601213574409485,
-0.03316602483391762,
0.040556974709033966,
-0.038144923746585846,
-0.01902325265109539,
0.0707615464925766,
0.02851036563515663,
0.007279429119080305,
0.0033008765894919634,
0.019141633063554764,
-0.027285907417535782,
0.00... | 0.807532 | 0.790382 | 0.01715 |
If \( a_n = \frac{1}{n} \) for \( n \geq 1 \), demonstrate that the series \( \sum_{k=1}^{n} a_k \) diverges and find a sequence \( b_n \) defined by the conditions laid out in Rudin's exercises such that \( \sum_{n_k \leq n < n_{k+1}} b_n \) also diverges while \( \lim_{n \to \infty} \frac{b_n}{a_n} = 0 \). What forms... | automath | [
0.0015974261332303286,
0.05856755003333092,
-0.027846544981002808,
-0.042920295149087906,
0.012057211250066757,
-0.015659283846616745,
-0.016767630353569984,
0.06969540566205978,
0.037635330110788345,
-0.007236434146761894,
-0.005785319488495588,
0.006678593344986439,
-0.04059179872274399,
... | 0.827091 | 0.804306 | 0.022785 |
Let \( F : \mathcal{A} \to \mathcal{B} \) be an additive functor between abelian categories, and let \( K^\bullet \) be a complex in \( \mathcal{A} \) such that \( H^i(K^\bullet) = 0 \) for all \( i < a \). If \( RF \) is defined at \( K^\bullet \), what can you conclude about the cohomology groups \( H^i(RF(K^\bullet)... | automath | [
0.022413821890950203,
0.03689814358949661,
-0.012119811959564686,
-0.03118789941072464,
0.03663970157504082,
-0.014651606790721416,
-0.0003835037350654602,
0.07839709520339966,
0.05140138044953346,
-0.0075040473602712154,
-0.010642219334840775,
0.016158415004611015,
-0.02582423761487007,
0... | 0.81265 | 0.791313 | 0.021336 |
Given a unit cube centered at the origin, if the cube is rotated about the x-axis by an angle \(\alpha\) and about the y-axis by an angle \(\beta\), derive the expression for the area of the orthogonal projection of the cube onto the xy-plane in terms of the angles \(\alpha\) and \(\beta\). Additionally, find the maxim... | automath | [
0.01988385058939457,
0.04545590654015541,
-0.0504579171538353,
-0.020055385306477547,
0.020913805812597275,
-0.004315481521189213,
-0.01866074651479721,
0.05301951989531517,
0.045377686619758606,
0.0016336159314960241,
0.008421073667705059,
0.010719392448663712,
-0.035568561404943466,
-0.0... | 0.813935 | 0.78842 | 0.025515 |
Let \( (x_n) \) be a sequence in \( \mathbb{R} \). If every infinite subsequence of \( (x_n) \) that omits infinitely many terms converges, does it necessarily follow that the sequence \( (x_n) \) itself converges? If not, provide a counterexample. | automath | [
-0.009472156874835491,
0.026760827749967575,
-0.038037821650505066,
-0.023379536345601082,
0.017291411757469177,
-0.003973769024014473,
-0.014026982709765434,
0.057468969374895096,
0.006351499818265438,
-0.0068820687010884285,
-0.00820677075535059,
0.006746260914951563,
-0.0370173305273056,
... | 0.825969 | 0.806785 | 0.019184 |
Consider a positive Borel measure \(\mu\) on \(\mathbb{R}^d\) such that \(\mu(B(a, r)) \leq Cr^n\) for some constant \(C\) and \(n \in (0, d]\) for any ball \(B(a, r)\) in \(\mathbb{R}^d\). What can be said about the convergence or divergence of the integral
\[
\int_{\mathbb{R}^d} \frac{1}{|x|^p} d\mu(x)
\]
for vari... | automath | [
0.01536452304571867,
0.043402623385190964,
-0.035124748945236206,
-0.009332917630672455,
0.02152663841843605,
0.006214525084942579,
-0.02661266177892685,
0.04278426617383957,
0.05633638799190521,
0.0025426207575947046,
0.006116206757724285,
0.015831924974918365,
-0.034947723150253296,
-0.0... | 0.814356 | 0.792266 | 0.02209 |
Let \( G \) be a nilpotent group of step \( s \) generated by elements \( a_1, a_2, \ldots, a_r \), where \( r \) and \( s \) are fixed positive integers. If \( N_1, N_2, \ldots, N_r \) are all sufficiently large depending on \( r \) and \( s \), how many distinct elements are in the noncommutative progression \( P(a_1... | automath | [
0.027011731639504433,
0.03345944732427597,
-0.04193541035056114,
-0.022807469591498375,
0.023726467043161392,
-0.025325467810034752,
-0.030113564804196358,
0.059867192059755325,
0.041244328022003174,
-0.016336573287844658,
0.0110823018476367,
0.021246017888188362,
-0.03341825306415558,
-0.... | 0.832781 | 0.813028 | 0.019752 |
For a connected linear algebraic group \( G \) over the field of complex numbers \( \mathbb{C} \), consider the automorphism \( \tau \in \text{Aut}(\mathbb{C}) \). What explicit conditions ensure that the complex varieties \( G \) and \( \tau G \) are isomorphic as varieties over \( \mathbb{C} \)? | automath | [
0.02597799524664879,
0.03344158083200455,
-0.0415317639708519,
-0.04511675611138344,
0.042805757373571396,
-0.03023090958595276,
-0.005918869283050299,
0.06521455943584442,
0.043645426630973816,
-0.00312775163911283,
0.006031503900885582,
0.01521203014999628,
-0.03232235088944435,
-0.01099... | 0.808056 | 0.784811 | 0.023244 |
Consider the set \( A = \{ a, b, c, d, e, f, g \} \) consisting of seven distinct elements. Determine if there exists a collection \( T \) of 3-element subsets of \( A \) such that each pair of elements from \( A \) appears in exactly one of the subsets of \( T \). If such a collection exists, find the total number of ... | automath | [
0.05200592800974846,
0.017951294779777527,
-0.046017274260520935,
-0.020336400717496872,
0.059459518641233444,
-0.03239063173532486,
-0.00578015623614192,
0.061441101133823395,
0.031953781843185425,
-0.007911073975265026,
0.011090300045907497,
0.016878049820661545,
-0.04730679467320442,
-0... | 0.838625 | 0.818577 | 0.020048 |
Let \( A \) be an \( n \times n \) upper triangular matrix defined by
\[
A_{ij} = \begin{cases}
\binom{j}{i} r^i q^j & \text{if } i \leq j \\
0 & \text{if } i > j
\end{cases}
\]
where \( r = \frac{p}{1-p} \) and \( q = 1-p \). Determine the entries \( M_{ij} \) of the inverse matrix \( M = A^{-1} \) for \( 1 \leq... | automath | [
0.04098999500274658,
0.0357215590775013,
-0.022910861298441887,
-0.01779813878238201,
0.03274821862578392,
-0.012924491427838802,
-0.005096761044114828,
0.07481880486011505,
0.03962423652410507,
0.025473106652498245,
0.022693462669849396,
0.032629624009132385,
-0.03239668533205986,
-0.0175... | 0.82689 | 0.799448 | 0.027442 |
Let the sequence \(\{x_n\}\) be defined by \(x_1 > 0\) and the recursive relation \(x_{n+1} = \frac{3(1+x_n)}{5+x_n}\). Determine the value of \(x_1\) for which the sequence is guaranteed to be monotone increasing, monotone decreasing, or neither. Specifically, what are the conditions on \(x_1\) such that:
1. The sequ... | automath | [
0.01805328018963337,
0.032414138317108154,
-0.03981102630496025,
-0.02924097701907158,
0.0323408879339695,
-0.01369206327944994,
-0.016492964699864388,
0.10290025174617767,
0.018603751435875893,
-0.012647231109440327,
0.0008289269753731787,
-0.005662128794938326,
-0.0444754995405674,
-0.00... | 0.821933 | 0.803831 | 0.018103 |
Given two independent dice rolls, let \( A_i \) represent the event that the first die shows \( i \) and \( S_j \) represent the event that the sum of the two dice equals \( j \). Determine the values of \( i \) and \( j \) for which the events \( A_i \) and \( S_j \) are independent. In particular, calculate the proba... | automath | [
0.013086564838886261,
0.013819749467074871,
-0.04545806720852852,
-0.02997204288840294,
0.025662986561655998,
-0.00697835860773921,
-0.008452153764665127,
0.06455343961715698,
0.04899456724524498,
0.0015103478217497468,
0.013792579062283039,
0.015684116631746292,
-0.02159893326461315,
0.00... | 0.827707 | 0.804062 | 0.023644 |
Let \( A_1, A_2, A_3, \ldots \) be a sequence of independent events in a probability space such that \( P(A_n) = p_n \) for all \( n \) where \( 0 < p_n < 1 \). Given that \( \sum_{n=1}^{\infty} p_n = 1 \), determine the value of \( P\left( \cap_{n=1}^{\infty} A_n \right) \) using Boole's Inequality. | automath | [
0.016472002491354942,
0.03697630763053894,
-0.028893716633319855,
-0.022478792816400528,
0.025115134194493294,
-0.003946240525692701,
-0.020346395671367645,
0.06758889555931091,
0.03858046233654022,
-0.003561020828783512,
-0.0077719721011817455,
0.027975985780358315,
-0.024682682007551193,
... | 0.829398 | 0.797911 | 0.031487 |
Given a graph \( G \) with \( n \) vertices, define \( x \) as the largest integer such that \( G \) contains a subgraph isomorphic to \( K_x \). If the maximum clique size in \( G \) is \( k \), what is the computational complexity of determining whether \( G \) contains a subgraph isomorphic to \( K_x \) for any inte... | automath | [
0.02252981625497341,
0.037066709250211716,
-0.023028122261166573,
-0.02220536768436432,
0.010535272769629955,
-0.03185707703232765,
-0.011651409789919853,
0.05596441030502319,
0.01631294935941696,
-0.014923352748155594,
0.04250859096646309,
0.025461750105023384,
-0.013195172883570194,
0.00... | 0.825591 | 0.807519 | 0.018071 |
Given a metric space \((X,d)\), consider the following statements:
1) \(X= \bigcup_{n\in \mathbb{N}} B(a,n)\), where \(B(a,r)\) denotes the open ball centered at \(a\) with radius \(r\).
2) If \(A \subset X\) is countable, then \(A^o=\emptyset\), where \(A^o\) represents the interior of \(A\).
3) \(\overline{A} \neq... | automath | [
0.029734067618846893,
0.03862247243523598,
-0.04220343008637428,
-0.02907944843173027,
0.03717656433582306,
-0.02079719491302967,
-0.01186308916658163,
0.06784628331661224,
0.04556706175208092,
-0.0007767957868054509,
0.0036375082563608885,
0.03220241516828537,
-0.037878911942243576,
-0.00... | 0.824798 | 0.787536 | 0.037262 |
Given two quadratic polynomials \( p(a; x) = a_0 + a_1 x + a_2 x^2 \) and \( q(b; x) = b_0 + b_1 x + b_2 x^2 \), where \( a_2 \neq 0 \) and \( b_2 \neq 0 \), determine the condition on \( a \) and \( b \) such that the system of equations \( p(a; x) = 0 \) and \( q(b; x) = 0 \) has a common solution in \( x \). Additio... | automath | [
0.03480099141597748,
0.03142687305808067,
-0.051708120852708817,
-0.04331585764884949,
0.03194741532206535,
-0.01709158904850483,
0.0064354282803833485,
0.0804254487156868,
0.0336102731525898,
-0.011188799515366554,
-0.0016897779423743486,
0.022755742073059082,
-0.01759391836822033,
-0.022... | 0.826287 | 0.800229 | 0.026058 |
Let \( f : [0,1] \to \mathbb{R} \) be a continuous and non-decreasing function. For a given \( \epsilon > 0 \), does there exist a non-decreasing polynomial \( p \) defined on \( [0, 1] \) such that for all \( x \in [0,1] \), the following condition holds true?
\[
|f(x) + (-p(x))| < \epsilon
\]
If so, provide a justi... | automath | [
-0.0009654159075580537,
0.034558624029159546,
-0.036250557750463486,
-0.032185107469558716,
0.04370409622788429,
-0.010924563743174076,
-0.015060258097946644,
0.08140235394239426,
0.021335851401090622,
-0.002980857389047742,
0.0003257523931097239,
0.01262772548943758,
-0.04129033163189888,
... | 0.825192 | 0.808712 | 0.01648 |
Given a mathematically amorphous problem, the book "Counting on Frameworks" develops a theory to describe rigidity. If the problem involves \( n \) points in general position in the plane, what is the maximum number of edges that can be formed from these points such that no three edges intersect at a single point? Expr... | automath | [
0.039528749883174896,
0.007858994416892529,
-0.03096001222729683,
-0.029064107686281204,
0.01702253893017769,
-0.013020958751440048,
-0.025735581293702126,
0.04711053520441055,
0.02300553396344185,
-0.009331244975328445,
-0.0033074908424168825,
0.027618281543254852,
-0.027575619518756866,
... | 0.834917 | 0.813527 | 0.02139 |
Let \( X \) be any set with the discrete metric \( d(x, y) \) defined as follows: \( d(x, y) = 0 \) if \( x = y \) and \( d(x, y) = 1 \) if \( x \neq y \). If \( |X| = n \), where \( n \) is a positive integer, how many distinct open balls \( B_r(x) \) of radius \( r = \frac{1}{2} \) can be centered at points in \( X \... | automath | [
0.01335277408361435,
0.026706460863351822,
-0.06314890086650848,
-0.011689601466059685,
0.02486264519393444,
0.013779676519334316,
-0.028323199599981308,
0.0361936017870903,
0.05475980415940285,
-0.00755591643974185,
0.0023960380349308252,
0.027798408642411232,
-0.03907780721783638,
-0.015... | 0.831536 | 0.807374 | 0.024162 |
Given a convex polygon with \( n \) vertices, where \( n \) is a prime number greater than 3, can you determine if there exists a unique point \( O \) inside the polygon such that the angles \( \angle DOE, \angle EOF, \ldots, \angle DOH \) are all equal? If so, what would be the measure of these angles in terms of \( n... | automath | [
0.024470657110214233,
0.005791984032839537,
-0.04410295933485031,
-0.047686949372291565,
0.00515212956815958,
-0.011452915146946907,
0.006929888855665922,
0.05676421895623207,
0.027053266763687134,
-0.0031635123305022717,
0.011822097934782505,
0.02997816912829876,
-0.03811400756239891,
-0.... | 0.839849 | 0.815355 | 0.024493 |
Given three boxes \(A\), \(B\), and \(C\) where boxes \(A\) and \(B\) start empty and box \(C\) contains \(27\) balls, you must transfer balls such that in the \(i\)-th move you transfer exactly \(i\) balls from one box to another, with the restriction that you cannot transfer balls between boxes \(A\) and \(B\). What ... | automath | [
0.004349361173808575,
0.0111799081787467,
-0.03848612681031227,
-0.022542551159858704,
0.03193208947777748,
0.008368350565433502,
-0.01787504181265831,
0.04707164689898491,
0.01577041484415531,
-0.03587432950735092,
0.015146145597100258,
0.01797144114971161,
-0.03451697900891304,
-0.007658... | 0.837978 | 0.818472 | 0.019506 |
Given the function \( f: \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^3 \), determine whether this function is a smooth bijection and assess whether it satisfies the property \( df_0(T_0 \mathbb{R}) = T_{f(0)} \mathbb{R} \). Specifically, is there a point \( p \in \mathbb{R} \) such that \( df_p(T_p \mathbb{R}) ... | automath | [
0.01923796907067299,
0.034006696194410324,
-0.043981440365314484,
-0.04510628059506416,
0.039472755044698715,
-0.009608123451471329,
-0.004827175755053759,
0.08704020828008652,
0.025018468499183655,
0.004563278052955866,
-0.007790586445480585,
0.008163020014762878,
-0.0235481858253479,
-0.... | 0.82497 | 0.802341 | 0.022629 |
Given two closed balls in \(\mathbb{R}^3\) with radii \(r_1\) and \(r_2\) centered at points \(A\) and \(B\), respectively, determine the possible number of intersection points between the two balls based on the distance \(d\) between the centers \(A\) and \(B\). Specifically, provide a clear description of the cases f... | automath | [
0.032533273100852966,
0.027820086106657982,
-0.05127215012907982,
-0.02666277438402176,
0.022841336205601692,
0.022763673216104507,
-0.02606699801981449,
0.03965779021382332,
0.05017105117440224,
-0.004785391502082348,
0.018270794302225113,
0.034969449043273926,
-0.021436763927340508,
-0.0... | 0.824367 | 0.801421 | 0.022946 |
Construct an explicit bijection \( f : \mathbb{N} \to \mathbb{N} \times \mathbb{N} \) such that for every natural number \( n \), the function \( f(n) \) returns a unique ordered pair \( (x, y) \in \mathbb{N} \times \mathbb{N} \). Express \( (x, y) \) in terms of \( n \). | automath | [
0.04217623919248581,
0.014367406256496906,
-0.039907872676849365,
-0.02149997279047966,
0.029607070609927177,
-0.015036478638648987,
-0.018501820042729378,
0.04214584827423096,
0.039274416863918304,
0.004846406634896994,
0.012183981016278267,
0.02044338919222355,
-0.0304435882717371,
-0.00... | 0.834664 | 0.809692 | 0.024972 |
Given the function \( f: \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^2 \), determine the image of \( f \) and specify the codomain that would accurately represent all possible outputs of this function. Additionally, if we redefine the codomain as \( [0, \infty) \), explain how this affects the properties of \( ... | automath | [
0.013596695847809315,
0.03855224698781967,
-0.02758113481104374,
-0.03221800550818443,
0.0312676876783371,
-0.038079120218753815,
-0.009255950339138508,
0.08205685019493103,
0.051441967487335205,
0.0003132833226118237,
0.01205671951174736,
0.0152267562225461,
-0.009097796864807606,
-0.0252... | 0.809253 | 0.789828 | 0.019425 |
Let \( A \in \mathbb{R}^{n \times n} \) be a positive definite symmetric matrix. Consider the optimization problem
\[
\max_{x \in \Delta_n} \lambda_{\min}(\operatorname{diag}(x) A),
\]
where \( \Delta_n = \{ x \in \mathbb{R}^n \mid x_i \geq 0, \sum_i x_i = 1 \} \). If there exists a solution to this optimization pro... | automath | [
0.019062524661421776,
0.017468484118580818,
-0.06537022441625595,
-0.034310344606637955,
0.039948318153619766,
0.0039505246095359325,
-0.028790434822440147,
0.06724156439304352,
0.0368306003510952,
-0.0012092236429452896,
-0.010454608127474785,
0.017651230096817017,
-0.033444274216890335,
... | 0.824623 | 0.798425 | 0.026199 |
For an odd integer \( n \), let \( a_{ij} \) be the entry in the \( i \)-th row and \( j \)-th column of an \( n \times n \) matrix. Assume that Alice and Bob take turns filling in the entries of the matrix, starting with Alice, and each player can only fill in one entry per turn. If the game ends once the entire matri... | automath | [
0.030737275257706642,
0.02246733568608761,
-0.04157670587301254,
-0.03300810605287552,
0.02650204859673977,
-0.01852411963045597,
-0.026809124276041985,
0.05196474492549896,
0.04428888484835625,
-0.008385646156966686,
0.005632341373711824,
0.009924788028001785,
-0.05181914567947388,
-0.030... | 0.835817 | 0.818925 | 0.016892 |
Consider the convex optimization problem defined by the objective function
$$\min_{x \in [0,1], \ y \in Y} x$$
subject to the constraint
$$x A + B y + C = 0,$$
where \(A\), \(B\), and \(C\) are real parameters and \(Y\) is a compact and convex set.
Given this setup, if we set \(Y = [0,1]\), \(B = 1\), and \(C ... | automath | [
0.0017401613295078278,
0.043306753039360046,
-0.04200460761785507,
-0.0068781329318881035,
0.04527141526341438,
-0.00003872824527206831,
-0.013194418512284756,
0.08311779052019119,
0.04762900248169899,
-0.011552644893527031,
-0.00012493734539020807,
0.0075830984860658646,
-0.0444419607520103... | 0.814333 | 0.790084 | 0.02425 |
For which values of \(\alpha\) does the function \(\|x\| = \max_{t \in [0, 1]} |x(t)|^\alpha\) satisfy the triangle inequality \(\|x + y\| \leq \|x\| + \|y\|\) for all \(x, y \in C[0, 1]\)? | automath | [
0.019503949210047722,
0.024937329813838005,
-0.057974740862846375,
-0.014641049318015575,
0.03283735364675522,
0.002800627378746867,
-0.033972933888435364,
0.06910549104213715,
0.049557674676179886,
-0.014011136256158352,
0.011619801633059978,
0.03730662539601326,
-0.03415166586637497,
-0.... | 0.828135 | 0.805244 | 0.022891 |
Let \( A \) be a \( 3 \times 3 \) Hermitian matrix with distinct eigenvalues \( \lambda_1, \lambda_2, \lambda_3 \) and corresponding normalized eigenvectors \( \mathbf{v}_1, \mathbf{v}_2, \mathbf{v}_3 \).
Consider the submatrix \( M_1 \) generated by deleting the first row and first column of \( A \). If the eigenval... | automath | [
0.024500275030732155,
0.04015545919537544,
-0.04242163151502609,
-0.042525965720415115,
0.05372798070311546,
-0.028478605672717094,
-0.008088831789791584,
0.06843885034322739,
0.044912490993738174,
-0.011496647261083126,
0.004651585593819618,
0.01609753631055355,
-0.043098777532577515,
-0.... | 0.824697 | 0.808206 | 0.016492 |
Determine whether the sequence of functions \( h_n(x) = \frac{x}{1+x^n} \) converges uniformly on the intervals \( [0, 1 - \epsilon] \) and \( [1 + \epsilon, \infty) \) for any fixed \( \epsilon > 0 \). If it does, provide the bounds for the convergence. If it does not, explain why it fails to do so. | automath | [
0.019721802324056625,
0.0337073914706707,
-0.02532809227705002,
-0.027434878051280975,
0.033794060349464417,
-0.020468559116125107,
-0.036970071494579315,
0.08574996888637543,
0.024990418925881386,
-0.004024937748908997,
0.0022925613448023796,
0.0015863649314269423,
-0.025531644001603127,
... | 0.815521 | 0.791833 | 0.023687 |
Let $$f_n(x) = \frac{x^n}{1+x^n}$$ for $$x \in [0, 1]$$. Determine the pointwise limit function of the sequence $$\{f_n\}$$ as $$n \to \infty$$ and verify whether the sequence converges uniformly on the interval $$[0, 1]$$. Additionally, compute $$\lim_{n\to\infty}\int_0^1 f_n(x)dx$$ and evaluate if it equals $$\int_0^... | automath | [
0.020969724282622337,
0.028427695855498314,
-0.026242518797516823,
-0.018832188099622726,
0.02755811996757984,
-0.013192528858780861,
-0.0314987376332283,
0.07683900743722916,
0.04119378328323364,
-0.010402116924524307,
0.0014409003779292107,
0.016311222687363625,
-0.026848435401916504,
-0... | 0.829212 | 0.802736 | 0.026476 |
For a fixed finite set \( X \subset \mathbb{R} \) and a function \( f: X \to \mathbb{R} \), let \( d \) be a fixed degree such that \( d \geq 1 \). If you define \( S \) as the set of all polynomial functions \( g \) of degree \( d \) that satisfy \( g(x) \geq f(x) \) for all \( x \in X \), can you determine the maximu... | automath | [
0.03640376403927803,
0.025662437081336975,
-0.04571184143424034,
-0.030108174309134483,
0.02813638001680374,
-0.021901555359363556,
-0.010862419381737709,
0.046778954565525055,
0.03782084956765175,
-0.000091822053946089,
0.008230379782617092,
0.03693023696541786,
-0.01746443100273609,
-0.0... | 0.833294 | 0.806941 | 0.026352 |
Consider a finite set \( S \) with \( n \) distinct elements. Define a binary relation \( R \) on \( S \) such that for any two elements \( a \) and \( b \) in \( S \), \( aRb \) if and only if \( a \) is less than or equal to \( b \) in some linear order. Now, suppose a relation is defined on \( S \) that satisfies re... | automath | [
0.03206692263484001,
0.0336834117770195,
-0.054697830229997635,
-0.012690048664808273,
0.012269637547433376,
-0.013716503046452999,
-0.027796711772680283,
0.05144345015287399,
0.041737139225006104,
0.006685398984700441,
0.01570942997932434,
0.025409987196326256,
-0.03162422403693199,
-0.00... | 0.826995 | 0.803265 | 0.02373 |
Let \( E = [a, b] \) be a bounded interval and consider the function \( f(x,y) = e^{-ixy} \). Determine a function \( g(y) \) that belongs to \( L^1(\mathbb{R}) \) such that \( |D_x f(x,y)| \leq g(y) \) holds for all \( x \) in \( \mathbb{R} \) and \( y \in E \). What is the integral \( \int_{-\infty}^{\infty} g(y) \, ... | automath | [
0.0018347336445003748,
0.024143056944012642,
-0.023175595328211784,
-0.04300428554415703,
0.027661576867103577,
0.011262323707342148,
-0.019560271874070168,
0.04692345857620239,
0.047456398606300354,
-0.0004432494752109051,
0.015226063318550587,
0.03569396585226059,
-0.0358436293900013,
-0... | 0.820175 | 0.80014 | 0.020035 |
Let \( R = \mathbb{F}_2 \times \mathbb{F}_2 \) be the finite semisimple ring, and consider the module \( I = \mathbb{F}_2 \times \{0\} \). Determine whether \( I \) is a free \( R \)-module. If it is not free, provide a verifiable reason based on the properties of \( R \) and the structure of \( I \). | automath | [
0.02643030509352684,
0.02974037453532219,
-0.02602030709385872,
-0.028070852160453796,
0.030460912734270096,
-0.02847203239798546,
-0.008314594626426697,
0.06848317384719849,
0.033173903822898865,
-0.01567782275378704,
-0.0006255857297219336,
0.011240994557738304,
-0.03657051548361778,
-0.... | 0.806572 | 0.789748 | 0.016823 |
Is it possible to construct a set \( S \) of points in the plane such that every straight line intersects \( S \) at least 2 points, and no line intersects \( S \) at exactly one point? If so, provide an example of such a set. If not, explain why such a set cannot exist. | automath | [
0.030360084027051926,
0.018714873120188713,
-0.02817629836499691,
-0.04363284632563591,
0.02387131378054619,
-0.02234707958996296,
-0.03404920920729637,
0.04990173131227493,
0.0396527461707592,
-0.015158526599407196,
0.0254224706441164,
0.02581547014415264,
-0.019995518028736115,
-0.029492... | 0.82808 | 0.807341 | 0.020739 |
Given a graph \( G \), consider the minimum sizes of the largest cliques in chordal, interval, trivially perfect, and threshold supergraphs of \( G \). Can you establish the chain of inequalities among these graph parameters, stating explicitly how vertex cover number, treewidth, pathwidth, and tree-depth relate to one... | automath | [
0.009190320037305355,
0.006926491856575012,
-0.01742703653872013,
-0.04263288900256157,
0.016990385949611664,
-0.020145082846283913,
-0.027878163382411003,
0.04401650279760361,
0.012180186808109283,
-0.01483947318047285,
0.03578689321875572,
0.017373893409967422,
-0.02613862231373787,
0.00... | 0.808768 | 0.788984 | 0.019784 |
Let \( f: [0, 1] \to \mathbb{R} \) be a function that is continuous except at a finite number of points. If the domain of \( f \) is Lebesgue measurable, is \( f \) necessarily Lebesgue measurable? Justify your answer.
Additionally, if \( A = \{ x \in [0, 1] \mid f(x) > c \} \) is measurable for every rational \( c \... | automath | [
0.020564310252666473,
0.046974118798971176,
-0.027776936069130898,
-0.03997655585408211,
0.035108618438243866,
-0.014352462254464626,
-0.0223324466496706,
0.05867771804332733,
0.0319172628223896,
0.009351019747555256,
0.008027630858123302,
0.01518651470541954,
-0.026250671595335007,
-0.010... | 0.811885 | 0.790001 | 0.021884 |
Consider the ideal \( I = \langle x, y^2, w^3 + x^2 \rangle \) in the polynomial ring \( R = \mathbb{Z}/5[x, y, z, w] \). Using the function \( \text{genericProjection}(2, I) \), determine the defining ideal of the projection of the variety \( V(I) \) onto \( \mathbb{A}^{2} \). What are the specific generators of this ... | automath | [
0.0340789295732975,
0.04254356026649475,
-0.03789474815130234,
-0.026624171063303947,
0.025218170136213303,
-0.04005514457821846,
-0.011918522417545319,
0.062098219990730286,
0.043477751314640045,
-0.017516370862722397,
0.011064054444432259,
0.021075991913676262,
-0.015967585146427155,
-0.... | 0.817374 | 0.793392 | 0.023982 |
Let \( n \) be a positive integer and \( \mathbb{F} \) a field. Consider the semisimple ring \( R = \mathbb{F}^n \) viewed as a direct product of \( n \) copies of \( \mathbb{F} \). How many distinct irreducible \( R \)-modules are there, and what is their structure as \( R \)-modules? | automath | [
0.028460318222641945,
0.020070431753993034,
-0.03828427940607071,
-0.01702849753201008,
0.03173644095659256,
-0.023834750056266785,
-0.02005375362932682,
0.04743494838476181,
0.04824323207139969,
-0.012674794532358646,
-0.01608111336827278,
0.027150779962539673,
-0.05027638003230095,
-0.04... | 0.816845 | 0.797451 | 0.019394 |
Let \( f_n(x) = \sin\left(\frac{x}{n^2}\right) \). Determine the pointwise limit of the series \( \sum_{n=1}^{\infty} f_n(x) \) as \( n \) approaches infinity \text{ and determine whether this series converges uniformly on \( \mathbb{R} \). If it does not converge uniformly, provide a specific value of \( x \) and a se... | automath | [
-0.008841312490403652,
0.05115615576505661,
-0.03782281652092934,
-0.03607815131545067,
0.029411600902676582,
0.006390613038092852,
-0.021837111562490463,
0.06534906476736069,
0.02128155343234539,
0.0059610893949866295,
0.012024344876408577,
0.016550954431295395,
-0.015381809324026108,
-0.... | 0.817072 | 0.787547 | 0.029525 |
Given the set \( S = \left\{ \begin{pmatrix} 2 \\ -5 \end{pmatrix} k \mid k \in \mathbb{R} \right\} \), provide two distinct descriptions of this set in terms of linear combinations of different vectors such that each description also generates the same geometric line as described by set \( S \). | automath | [
0.026943979784846306,
0.020400993525981903,
-0.059694673866033554,
-0.05824896693229675,
0.047826848924160004,
-0.023613216355443,
-0.024458371102809906,
0.08174680918455124,
0.044041357934474945,
0.0034263222478330135,
0.028912261128425598,
0.03206746652722359,
-0.020653966814279556,
0.00... | 0.823222 | 0.800167 | 0.023054 |
Let \( P_n \) denote the vector space of polynomials of degree less than or equal to \( n \). Define the subspace \( P_E \) to be the space of even polynomials in \( P_n \) and \( P_O \) to be the space of odd polynomials in \( P_n \).
If \( n = 4 \), what is the dimension of the subspace of all even polynomials \( P... | automath | [
0.017704743891954422,
0.024926530197262764,
-0.04026776924729347,
-0.06229041889309883,
0.028682217001914978,
-0.018989944830536842,
-0.006765756756067276,
0.04047642648220062,
0.02841855213046074,
0.017526650801301003,
-0.015006889589130878,
0.034609511494636536,
-0.030226802453398705,
-0... | 0.829884 | 0.803767 | 0.026117 |
Is it possible to tile a $1 \times 1$ square using non-repeating rectangles of dimensions $\frac{1}{n} \times \frac{1}{n+1}$ for $n = 1, 2, 3, \ldots$, and if so, how many distinct rectangles of this type can be used in such a tiling? | automath | [
0.015621338039636612,
0.03996708244085312,
-0.03148133307695389,
-0.027164245024323463,
0.027990251779556274,
-0.005279128439724445,
-0.006349311675876379,
0.06258481740951538,
0.013898048549890518,
-0.003364959266036749,
0.027384573593735695,
0.020936133340001106,
-0.040949638932943344,
-... | 0.840086 | 0.821898 | 0.018188 |
Let \( \Omega \) be a bounded domain in \( \mathbb{R}^d \) and let \( u \) be a harmonic function that is twice continuously differentiable in \( \Omega \) and continuous on \( \bar{\Omega} \).
1. If \( u = 0 \) on \( \partial \Omega \), does it necessarily follow that \( u = 0 \) in \( \Omega \)?
2. Given that \( ... | automath | [
0.004807603545486927,
0.05221753567457199,
-0.048209916800260544,
-0.02303340844810009,
0.031529203057289124,
-0.0033048074692487717,
-0.002591319615021348,
0.057550400495529175,
0.03428502008318901,
-0.006824429612606764,
0.0042935935780406,
0.022793035954236984,
-0.018425678834319115,
-0... | 0.812921 | 0.786962 | 0.025959 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.