instruction_seed stringlengths 5 2.9k | response_seed stringlengths 3 9.55k | input stringclasses 1
value | _source stringclasses 1
value |
|---|---|---|---|
Calculate the remainder when 6991279 is divided by 40.\n | 39\n | ibivibiv/math_instruct | |
What is the nearest to -25 in -11, -4, 11?\n | -11\n | ibivibiv/math_instruct | |
Suppose -10*d = d - 429. Is d prime?\n | False\n | ibivibiv/math_instruct | |
Suppose 0 = -q + 3*q. Suppose -k = -q*k - 3. What is the units digit of k?\n | 3\n | ibivibiv/math_instruct | |
What is 27150969 divided by -9050323?\n | -3\n | ibivibiv/math_instruct | |
Suppose 0 = 2*j + 2*y - 32, -5*j = 2*y - 6*y - 80. Let l = j + -9. Let v = -5 + l. Is v composite?\n | False\n | ibivibiv/math_instruct | |
Solve -8369 + 7459 = -70*b for b.\n | 13\n | ibivibiv/math_instruct | |
Let g = -27100 + 46743. List the prime factors of g.\n | 13, 1511\n | ibivibiv/math_instruct | |
Put 2, -2, 9160, 4 in decreasing order.\n | 9160, 4, 2, -2\n | ibivibiv/math_instruct | |
Let s(l) = -2*l**2 + 48 + 43 + 12*l - 92. Let m be s(5). Suppose -3*a + 2*a = -m. Is 3 a factor of a?\n | True\n | ibivibiv/math_instruct | |
Put 1, 0.0391, 2/9, -43.9, 0 in descending order.\n | 1, 2/9, 0.0391, 0, -43.9\n | ibivibiv/math_instruct | |
Let q(l) = l - 3 + 3. Let m be ((-1)/(-5) - -1)/((28/(-10))/(-7)). Let b be q(m). Solve -b = -2*c + j - 0, -4*c + 8 = -4*j for c.\n | 1\n | ibivibiv/math_instruct | |
Find the second derivative of 10661049*i**2 - 34*i - 38354.\n | 21322098\n | ibivibiv/math_instruct | |
Find the common denominator of 13/320 and -173/480.\n | 960\n | ibivibiv/math_instruct | |
(-118)/885*(0 + 120/546)*(-3)/(-4)\n | -2/91\n | ibivibiv/math_instruct | |
Let o = -3 - -5. Suppose o*g - 16 = -2*g. Let f = 132 + -121. What is the remainder when f is divided by g?\n | 3\n | ibivibiv/math_instruct | |
What is the nearest to -0.4 in -4, 3/4, 0.2, -214, 37?\n | 0.2\n | ibivibiv/math_instruct | |
Let b = 19394.1 + -16450. What is b rounded to the nearest one thousand?\n | 3000\n | ibivibiv/math_instruct | |
What is 36/(-225)*((-6)/57 - (-1180)/(-6840))?\n | 2/45\n | ibivibiv/math_instruct | |
Simplify ((6*(sqrt(66) - (sqrt(66)*1 + sqrt(66)))*-4*-5*4)/(-1*sqrt(12)/sqrt(2)*5 + sqrt(54)/(sqrt(18)/sqrt(2)*-2 - sqrt(9))))**2.\n | 89100\n | ibivibiv/math_instruct | |
Let d(r) be the first derivative of 3*r**5/25 + 171*r**4/20 + 1083*r**3/5 + 20577*r**2/10 - 82. Factor d(g).\n | 3*g*(g + 19)**3/5\n | ibivibiv/math_instruct | |
Let l(c) = c**3 + 7*c**2 + 8*c + 5. Determine l(-6).\n | -7\n | ibivibiv/math_instruct | |
Is 1/43777101 >= 0?\n | True\n | ibivibiv/math_instruct | |
Is 1367 composite?\n | False\n | ibivibiv/math_instruct | |
What is seventy-three fifths of a millimeter in micrometers?\n | 14600\n | ibivibiv/math_instruct | |
Sort -1068, 2, -2, -5.\n | -1068, -5, -2, 2\n | ibivibiv/math_instruct | |
What is 12 minutes before 2:54 AM?\n | 2:42 AM\n | ibivibiv/math_instruct | |
Calculate -24603 divided by -59.\n | 417\n | ibivibiv/math_instruct | |
Suppose -2*c - h + 121 = 0, 60 = 3*c - 5*h - 115. Let i be 6/(-2576)*(-144328)/c. Let z = -17/322 + i. Calculate the common denominator of z and -49/22.\n | 220\n | ibivibiv/math_instruct | |
Solve 3*u - 35 = 4*t, -2*u + 8*t = 13*t + 15 for u.\n | 5\n | ibivibiv/math_instruct | |
Let r be (-3)/(-18) - (-94)/12. Suppose -r = -a - 5*i + 4, 8 = 4*i. Solve -4*n + a*n = 6 for n.\n | -3\n | ibivibiv/math_instruct | |
Sort -10, 4, 11, 0, 33, -4.\n | -10, -4, 0, 4, 11, 33\n | ibivibiv/math_instruct | |
Calculate the highest common divisor of 36 and 150.\n | 6\n | ibivibiv/math_instruct | |
Let c(m) = m**3 + 13*m**2 - 9*m - 11. Give c(-14).\n | -81\n | ibivibiv/math_instruct | |
Collect the terms in 8 + 33*m**2 - 8 + 1807*m - 1807*m.\n | 33*m**2\n | ibivibiv/math_instruct | |
What is the value of (-1 + (-175)/7)*(-4)/8?\n | 13\n | ibivibiv/math_instruct | |
Simplify ((-6*6*sqrt(1573)*-2 - (-3 + -2 + sqrt(1573))*1)*3*1)**2.\n | 70290*sqrt(13) + 71365662\n | ibivibiv/math_instruct | |
Suppose -8*y = -0*y - 296. Put 4, y, -4 in decreasing order.\n | y, 4, -4\n | ibivibiv/math_instruct | |
Let r(k) = 13*k - 6. Let w(z) = 14*z - 8. Let n(y) = -3*r(y) + 2*w(y). Give n(3).\n | -31\n | ibivibiv/math_instruct | |
-17 - (3 + -5) - (8 + -2)\n | -21\n | ibivibiv/math_instruct | |
Let y(i) = -11*i**2 - 2*i - 1. Let m(v) = -20*v**2 - 2*v - 1. Give 3*m(q) - 5*y(q).\n | -5*q**2 + 4*q + 2\n | ibivibiv/math_instruct | |
Let u be (-3)/(-3*(-7)/(-126)). Solve -19*r = -u*r - 1 for r.\n | 1\n | ibivibiv/math_instruct | |
Calculate 273*4.\n | 1092\n | ibivibiv/math_instruct | |
What is -51290 rounded to the nearest 1000?\n | -51000\n | ibivibiv/math_instruct | |
Simplify (-2*(sqrt(13) + 2)*3*-5*6)**2.\n | 129600*sqrt(13) + 550800\n | ibivibiv/math_instruct | |
In base 10, what is 201 - -64?\n | 265\n | ibivibiv/math_instruct | |
Let o(f) = -f**2 + f - 1. Let w(y) = 2*y**2 - 2*y + 2. Let u(z) = -3*o(z) - 2*w(z). Let i(v) = 6*v**2 - 3*v + 3. What is i(d) + 5*u(d)?\n | d**2 + 2*d - 2\n | ibivibiv/math_instruct | |
What is -142007898 minus -86.933?\n | -142007811.067\n | ibivibiv/math_instruct | |
Is 1427 a factor of 1849264997?\n | True\n | ibivibiv/math_instruct | |
Let a = 46 + -26. Let w be (-13)/5 + 0 - (-12)/a. What is the tens digit of 1*(w + 135) - -3?\n | 3\n | ibivibiv/math_instruct | |
Suppose -15 = -m - 5*w, -5*m + m - 3*w = -77. Solve -31*p + 32*p + 3*n = -m, 4*p + n + 25 = 0 for p.\n | -5\n | ibivibiv/math_instruct | |
Evaluate (30775/(-226504))/((-10)/32).\n | 10/23\n | ibivibiv/math_instruct | |
-151.26 times -184\n | 27831.84\n | ibivibiv/math_instruct | |
What is 2851 to the power of 1/8, to the nearest integer?\n | 3\n | ibivibiv/math_instruct | |
Expand (2*m**2 - 3 + 3)*(4*m - 7*m + 4*m) - 69*m**3 - 397*m**3 - 161*m**3.\n | -625*m**3\n | ibivibiv/math_instruct | |
Is 66832613 prime?\n | True\n | ibivibiv/math_instruct | |
Three letters picked without replacement from {w: 2, a: 1, x: 1, h: 1, r: 1, t: 2}. Give prob of picking 1 w, 1 r, and 1 a.\n | 1/28\n | ibivibiv/math_instruct | |
-2 - (0 + 4 - 8)\n | 2\n | ibivibiv/math_instruct | |
What is nineteen quarters of a kilogram in grams?\n | 4750\n | ibivibiv/math_instruct | |
What is the smallest common multiple of (10/(-3))/(1/(-3)) and 2?\n | 10\n | ibivibiv/math_instruct | |
Is 70 a factor of 25060?\n | True\n | ibivibiv/math_instruct | |
Round 258174.24 to the nearest 10000.\n | 260000\n | ibivibiv/math_instruct | |
In base 14, what is -7 + -200a524?\n | -200a52b\n | ibivibiv/math_instruct | |
(-8)/(-3)*11/99*-3*-1\n | 8/9\n | ibivibiv/math_instruct | |
Expand (2 + 2*j**2 - 2)*(12*j**2 - 9*j**2 + 13*j**2) - 2*j**4 + 0*j**4 + 0*j**4.\n | 30*j**4\n | ibivibiv/math_instruct | |
Calculate (1/(-4))/(((-758)/2653)/((-312)/(-63))).\n | 13/3\n | ibivibiv/math_instruct | |
Let g = 0.445 - 0.145. What is the second biggest value in g, 0.4, -10, -18?\n | g\n | ibivibiv/math_instruct | |
What is the first derivative of 23*s**4 - 1517855*s**2*w**3 + 315127101*w**3 wrt s?\n | 92*s**3 - 3035710*s*w**3\n | ibivibiv/math_instruct | |
Suppose -12*l + 12 = -48. Which is the nearest to 0.1? (a) -4/9 (b) l (c) -4\n | a\n | ibivibiv/math_instruct | |
Let j = 81 - 48. Is 13 a factor of j?\n | False\n | ibivibiv/math_instruct | |
Suppose -8*t - 14 + 54 = 0. Calculate the remainder when 176 is divided by t.\n | 1\n | ibivibiv/math_instruct | |
Let t = -1 - 1. Let m = t + -1. Let l(j) = 5 + 4*j - j**3 - 2 + 4*j**2 + 2*j**3. Calculate l(m).\n | 0\n | ibivibiv/math_instruct | |
Calculate the lowest common multiple of 68 and 12706.\n | 432004\n | ibivibiv/math_instruct | |
What is the highest common divisor of 260 and 308815?\n | 65\n | ibivibiv/math_instruct | |
What is the next term in 7609, 15247, 22885, 30523, 38161?\n | 45799\n | ibivibiv/math_instruct | |
Is 12410713 a composite number?\n | True\n | ibivibiv/math_instruct | |
What is the common denominator of 101/80 and -67/176?\n | 880\n | ibivibiv/math_instruct | |
Solve -4*x + 5*n - 108 = -79, 3*n = 6*x + 57 for x.\n | -11\n | ibivibiv/math_instruct | |
Let b(z) = -z**2 - 41*z + 672. What is the tens digit of b(-49)?\n | 8\n | ibivibiv/math_instruct | |
Is 435197 composite?\n | True\n | ibivibiv/math_instruct | |
Expand (0*c**3 + c**3 + c**3)*(144*c - 269*c + 331*c)*(3*c - 2*c - 2*c).\n | -412*c**5\n | ibivibiv/math_instruct | |
Let a(c) = -21*c - 25*c - 18*c + 12 + 73*c. What is a(-5)?\n | -33\n | ibivibiv/math_instruct | |
Is 24056875 less than 24056873?\n | False\n | ibivibiv/math_instruct | |
In base 12, what is 5 + 1b7?\n | 200\n | ibivibiv/math_instruct | |
Let m(l) be the first derivative of 613*l**2/2 + 1365. Let a(k) = 2*k**2. Calculate m(a(q)).\n | 1226*q**2\n | ibivibiv/math_instruct | |
What is the value of (-16)/156*(-8)/(96/(-108))?\n | -12/13\n | ibivibiv/math_instruct | |
Let o be ((-68)/85)/((-2)/(-20)). Let d(n) = 2*n + 12. Calculate d(o).\n | -4\n | ibivibiv/math_instruct | |
Express -6*u + 2*u - 7*u + 3*u**2 in the form r + x*u**2 + m*u and give x.\n | 3\n | ibivibiv/math_instruct | |
Convert -20012 (base 3) to base 13.\n | -cb\n | ibivibiv/math_instruct | |
Let d be 0 - (-5)/5 - 442/(-10). Let x = 46 - d. Factor 2/5 - x*y + 2/5*y**2.\n | 2*(y - 1)**2/5\n | ibivibiv/math_instruct | |
Solve 4*x - 30 = k - 34, 4*k = -3*x + 16 for x.\n | 0\n | ibivibiv/math_instruct | |
Simplify (a**22/a)/(a*a*a**(2/23)*a)*a**(2/9)*a**(-16) assuming a is positive.\n | a**(442/207)\n | ibivibiv/math_instruct | |
Let d = -9 + 7. Let b(k) = 139*k**3 + 3*k**2 + k - 2. Let m be b(d). Let j be 12/(-30) - m/10. Calculate the greatest common divisor of j and 22.\n | 22\n | ibivibiv/math_instruct | |
How many minutes are there between 12:35 AM and 9:00 AM?\n | 505\n | ibivibiv/math_instruct | |
Which is bigger: -136887 or -1?\n | -1\n | ibivibiv/math_instruct | |
Calculate -3*2/(-108)*-12.\n | -2/3\n | ibivibiv/math_instruct | |
Let j = 39 + -19. Suppose 7 = 4*m + 31. Let b = j + m. Is b a multiple of 14?\n | True\n | ibivibiv/math_instruct | |
What are the prime factors of 913?\n | 11, 83\n | ibivibiv/math_instruct | |
What is the highest common factor of 8 and 184?\n | 8\n | ibivibiv/math_instruct | |
-477 divided by -6\n | 159/2\n | ibivibiv/math_instruct |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.