instruction_seed stringlengths 5 2.9k | response_seed stringlengths 3 9.55k | input stringclasses 1
value | _source stringclasses 1
value |
|---|---|---|---|
Calculate the highest common divisor of 378 and 14.\n | 14\n | ibivibiv/math_instruct | |
A delivery company needs to deliver packages to five different locations in the shortest amount of time possible. The distances (in miles) between the five locations are as follows:
- Location 1 to Location 2: 3 miles
- Location 1 to Location 3: 5 miles
- Location 1 to Location 4: 2 miles
- Location 1 to Location 5: 4... | To find the optimal route, we can use the nearest neighbor algorithm. Starting from Location 1, we will visit the nearest unvisited location until all locations have been visited.
1. From Location 1, the nearest location is Location 4 (2 miles).
2. From Location 4, the nearest unvisited location is Location 2 (5 mile... | ibivibiv/math_instruct | |
Simplify ((d*d**(2/7)*d)/d)**(-2/37)*d*d*d**(-6)*d*d**2 assuming d is positive.\n | d**(-277/259)\n | ibivibiv/math_instruct | |
How many minutes are there between 12:58 AM and 5:22 AM?\n | 264\n | ibivibiv/math_instruct | |
What is 2 divided by -37455633?\n | -2/37455633\n | ibivibiv/math_instruct | |
What is thirty-three fifths of a decade in years?\n | 66\n | ibivibiv/math_instruct | |
Convert 220.1725 grams to tonnes.\n | 0.0002201725\n | ibivibiv/math_instruct | |
Simplify 2 + sqrt(18) + sqrt(2) + sqrt(2) - (-2 + (sqrt(2) - (sqrt(2)*-1 + sqrt(2))))**2.\n | -4 + 9*sqrt(2)\n | ibivibiv/math_instruct | |
Suppose 5*s - 159 = 2*s. Let v = -19 + s. List the prime factors of v.\n | 2, 17\n | ibivibiv/math_instruct | |
Let q(p) be the first derivative of 4*p**2 - 1/12*p**4 - 6*p - 1 + 0*p**3. Let x(f) be the first derivative of q(f). Find the first derivative of x(z) wrt z.\n | -2*z\n | ibivibiv/math_instruct | |
What is the ten thousands digit of 20256?\n | 2\n | ibivibiv/math_instruct | |
What is the closest to 0 in -4/7, -1/3, -2?\n | -1/3\n | ibivibiv/math_instruct | |
What is ((-23)/(-46))/((-14)/(-21))?\n | 3/4\n | ibivibiv/math_instruct | |
How many grams are there in twenty-six fifths of a kilogram?\n | 5200\n | ibivibiv/math_instruct | |
-2c (base 13) to base 8\n | -46\n | ibivibiv/math_instruct | |
Let m(c) = -c**3 + 9*c**2 + 7*c - 3. Let i be m(9). Suppose -100 = -4*a + 5*y, 0*a - 4*a = -4*y - 96. Calculate the highest common divisor of a and i.\n | 20\n | ibivibiv/math_instruct | |
What is the units digit of 297377?\n | 7\n | ibivibiv/math_instruct | |
Collect the terms in 33 + 80 + 18*x + 31 - 144.\n | 18*x\n | ibivibiv/math_instruct | |
What is 671373972 to the power of 1/3, to the nearest integer?\n | 876\n | ibivibiv/math_instruct | |
What is 660 minutes after 7:32 AM?\n | 6:32 PM\n | ibivibiv/math_instruct | |
Let k = -12 + 6. Let u = k - -10. Is 4 a factor of u?\n | True\n | ibivibiv/math_instruct | |
Sort 70, 22, 5.5, -4 in decreasing order.\n | 70, 22, 5.5, -4\n | ibivibiv/math_instruct | |
What is the value of 4/3*-18*(-84)/(-126)?\n | -16\n | ibivibiv/math_instruct | |
Let x be (-4)/(-5) - 1/(-5). Let c be x*2*10365/40. Let v = c + -543. What is the common denominator of v and 17/6?\n | 12\n | ibivibiv/math_instruct | |
What is -9578475 plus -1.4681?\n | -9578476.4681\n | ibivibiv/math_instruct | |
Let l = -3/23 + 29/46. Let h(c) be the second derivative of 0 + 5*c + 1/6*c**4 - l*c**3 + 0*c**2. What is the second derivative of h(n) wrt n?\n | 4\n | ibivibiv/math_instruct | |
Rearrange -4*j**3 + 124*j - 73*j - 52*j - j**4 - 12*j**2 to the form h*j**3 + r*j + s*j**4 + x + m*j**2 and give r.\n | -1\n | ibivibiv/math_instruct | |
Find the common denominator of ((-7)/((-364)/220))/9 and -14/117.\n | 117\n | ibivibiv/math_instruct | |
What is the second derivative of 1890*k**2 + 2867*k?\n | 3780\n | ibivibiv/math_instruct | |
Multiply 0.2474 and 4.\n | 0.9896\n | ibivibiv/math_instruct | |
Is 1157873347 prime?\n | True\n | ibivibiv/math_instruct | |
List the prime factors of 365.\n | 5, 73\n | ibivibiv/math_instruct | |
Two letters picked without replacement from ddududodoydoduydoodd. What is prob of picking 1 y and 1 o?\n | 1/19\n | ibivibiv/math_instruct | |
Is 739222469 prime?\n | True\n | ibivibiv/math_instruct | |
Suppose 30 - 26 = 2*j, 4*n + 3*j = 814. Calculate the highest common factor of 1 and n.\n | 1\n | ibivibiv/math_instruct | |
What is next in -456652, -456641, -456624, -456601, -456572, -456537?\n | -456496\n | ibivibiv/math_instruct | |
Jerry Weller received 20,196 more votes than opponent John Pavich. If Jerry received 108,375 votes, what was the total number of votes? | If Jerry Weller received 108,375 votes and he received 20,196 more votes than John Pavich, then John Pavich received 108,375 - 20,196 = 88,179 votes.
To find the total number of votes, we add Jerry Weller's votes to John Pavich's votes:
108,375 (Jerry's votes) + 88,179 (Johns votes) = 196,554 votes in total. | ibivibiv/math_instruct | |
Let w(z) = 0*z + z + z + z. Suppose 48 = 3*q + 3*q. Let o(j) = 8 - j**2 + 0*j**2 - q. Calculate o(w(c)).\n | -9*c**2\n | ibivibiv/math_instruct | |
What is the hundreds digit of 2166804?\n | 8\n | ibivibiv/math_instruct | |
Suppose -2*j + j + 14 = -3*p, -5*p - 10 = 5*j. Let a be j - (3 - (5 + -2)). Solve 6 = -a*u + 4*u for u.\n | 3\n | ibivibiv/math_instruct | |
Is 839 composite?\n | False\n | ibivibiv/math_instruct | |
What comes next: 63374, 126920, 190460, 253994, 317522, 381044?\n | 444560\n | ibivibiv/math_instruct | |
Is -2399 at most -664128/277?\n | True\n | ibivibiv/math_instruct | |
What is the value of 41 + -2 - (16 - (0 - -3))?\n | 26\n | ibivibiv/math_instruct | |
Express (-27*x**2 + 28 - 28)*(-56*x + 3 + 32*x + 32*x + (-2*x + 0*x - x)*(1 - 4 + 5)) in the form z*x**2 + j*x + a*x**3 + u and give a.\n | -54\n | ibivibiv/math_instruct | |
How many weeks are there in 43.934387 days?\n | 6.276341\n | ibivibiv/math_instruct | |
Let l = 7753 - 6682.6. What is l rounded to the nearest one hundred?\n | 1100\n | ibivibiv/math_instruct | |
Calculate prob of picking 3 p when three letters picked without replacement from pppffpppfp.\n | 7/24\n | ibivibiv/math_instruct | |
Let l(v) = 36*v**2 - 31*v - 11. Let w(y) = 4*y**2 - 37*y - 4. Let c(f) = 3*f**2 - 16*f - 2. Let z(r) = 5*c(r) - 2*w(r). What is 2*l(k) - 11*z(k)?\n | -5*k**2 + 4*k\n | ibivibiv/math_instruct | |
Let i = -224 + 620. Let g be (-8)/(-3)*i/24. Is (476/(-6))/(g/(-12) - -3) composite?\n | True\n | ibivibiv/math_instruct | |
Expand -p - 1 + 16*p**3 - 10*p**3 + 3*p**3 + (-2*p + 2*p + 2*p)*(9*p**2 - 5*p**2 - 6*p**2) - 4 + 7 - 4 - 2*p**3.\n | 3*p**3 - p - 2\n | ibivibiv/math_instruct | |
Let g = 12.762 - 12.703912. Let t = g + -0.05271. Round t to 3 dps.\n | 0.005\n | ibivibiv/math_instruct | |
Let r be ((-4)/9)/(-1 - (-48)/54). Sort 1/2, r, 11 in ascending order.\n | 1/2, r, 11\n | ibivibiv/math_instruct | |
Simplify ((p*(p**1/p)/p)/((((p*p*p**(-2))/p)/p)/p))/((p*p/(p**9*p))/p**3) assuming p is positive.\n | p**14\n | ibivibiv/math_instruct | |
Write an educational piece suited for college students related to the following text snippet:
"### wire matching problem
Here’s an interesting and, shall I say, practical problem brought up at group meeting today: If you have say, n identical looking wires strung across a long distance between point A and point B, and... | The wire matching problem presented here involves finding an efficient method to label a set of n identical-looking wires stretched between two points, A and B, using only an ohmmeter which measures continuity through short circuiting or open circuiting. This means physically connecting pairs of wires together and che... | ibivibiv/math_instruct | |
Factor 3*u**3/2 - 34953*u**2/2 + 101826825*u/2 - 101791875/2.\n | 3*(u - 5825)**2*(u - 1)/2\n | ibivibiv/math_instruct | |
Let t(h) = -h**2 - 2*h + 38. Determine t(0).\n | 38\n | ibivibiv/math_instruct | |
What is -90 + 10443/118 + 19/13?\n | -1/26\n | ibivibiv/math_instruct | |
What is the nearest to -2.488 in 4, 0, -17/2?\n | 0\n | ibivibiv/math_instruct | |
Differentiate 326877*k**3 - 427*k + 378754424 with respect to k.\n | 980631*k**2 - 427\n | ibivibiv/math_instruct | |
What comes next: 453986, 449023, 440752, 429173, 414286, 396091, 374588?\n | 349777\n | ibivibiv/math_instruct | |
How many centimeters are there in 157.6854 meters?\n | 15768.54\n | ibivibiv/math_instruct | |
-b (base 15) to base 10\n | -11\n | ibivibiv/math_instruct | |
Let c = -164932 + 298932. Round c to the nearest 10000.\n | 130000\n | ibivibiv/math_instruct | |
Let r(j) = -12*j - 20. Is r(-19) a multiple of 8?\n | True\n | ibivibiv/math_instruct | |
How many minutes are there between 3:50 PM and 2:45 AM?\n | 655\n | ibivibiv/math_instruct | |
Simplify c**(1/15)*c**2*c*c*c**4/c*c**(-1)/c assuming c is positive.\n | c**(76/15)\n | ibivibiv/math_instruct | |
Rearrange -172*f - 186*f + f**2 + 328*f to the form w + n*f + l*f**2 and give n.\n | -30\n | ibivibiv/math_instruct | |
Sort -1059/4831, -1, 0.3, 4, -5 in increasing order.\n | -5, -1, -1059/4831, 0.3, 4\n | ibivibiv/math_instruct | |
What is the smallest prime gap between two consecutive primes that are greater than 100? | The smallest prime gap between two consecutive primes greater than 100 is 2. The two consecutive prime numbers are 101 and 103. | ibivibiv/math_instruct | |
Calculate 4*18/(-6)*(-184)/(39376/963).\n | 54\n | ibivibiv/math_instruct | |
What is the third root of 896109 to the nearest integer?\n | 96\n | ibivibiv/math_instruct | |
What is 622c (base 15) in base 6?\n | 240010\n | ibivibiv/math_instruct | |
Find the third derivative of 1237215*h**3*k*t + 7*h**3*k + 1043*h**2*k*t + 937*h**2*t - 2*h*t wrt h.\n | 7423290*k*t + 42*k\n | ibivibiv/math_instruct | |
Add together -37829533986089 and 0.8.\n | -37829533986088.2\n | ibivibiv/math_instruct | |
What is the value of -1 + (13 - 8)*(-6)/(-40)?\n | -1/4\n | ibivibiv/math_instruct | |
Round -0.0000004545 to 7 decimal places.\n | -0.0000005\n | ibivibiv/math_instruct | |
Product of -3775 and -0.3.\n | 1132.5\n | ibivibiv/math_instruct | |
What is the second biggest value in 1/10, -4, -3/20?\n | -3/20\n | ibivibiv/math_instruct | |
What is (((-448)/(-147))/8)/(30/(-135))?\n | -12/7\n | ibivibiv/math_instruct | |
What is the second derivative of 33717151*v**2 + 47777266*v?\n | 67434302\n | ibivibiv/math_instruct | |
Let o = 159.09 - 158. Let j = o + -1.1. Which is the closest to -0.3? (a) -5 (b) 0 (c) j\n | c\n | ibivibiv/math_instruct | |
Let l = -114 - -133. What is the tens digit of l?\n | 1\n | ibivibiv/math_instruct | |
Let -1696*z**2 - 100983 + 216809 - 4*z**5 - 856*z**3 + 2944*z - 106098 - 116*z**4 = 0. What is z?\n | -19, -4, 2\n | ibivibiv/math_instruct | |
Is 2958592 a multiple of 16?\n | True\n | ibivibiv/math_instruct | |
Is 1524073 at most 1524333?\n | True\n | ibivibiv/math_instruct | |
Let z = 1046 - 1044. Solve -5*b = -4*b + 3*r + 10, 4*r + 20 = z*b for b.\n | 2\n | ibivibiv/math_instruct | |
Differentiate -16*k*x**3 - 5*k*x**2 - k + 167 with respect to x.\n | -48*k*x**2 - 10*k*x\n | ibivibiv/math_instruct | |
Which is smaller: 4145516 or 20727584/5?\n | 4145516\n | ibivibiv/math_instruct | |
Let x(r) be the first derivative of 5 - 5*r - 7/3*r**3 - 1/4*r**4 - 7/2*r**2. Determine x(-6).\n | 1\n | ibivibiv/math_instruct | |
Suppose -10*m = -19*m + 9. Let k(y) = -2*y**3 + 18*y**2 + 56*y + 52. Let c(l) = 2*l**3 - l + 1. Let b(d) = m*k(d) + 2*c(d). Suppose b(a) = 0. What is a?\n | -3\n | ibivibiv/math_instruct | |
Simplify (h*h/(h**8/h)*h**(-1/11))/(h*h/h**(-3/7)*h*h/((h*h**(3/4))/h))*(h**(-2)/h*h**(-4))**(-1/37) assuming h is positive.\n | h**(-97781/11396)\n | ibivibiv/math_instruct | |
Solve -16*l + 24 = -12*l for l.\n | 6\n | ibivibiv/math_instruct | |
Suppose 0 = 5*j - w - 2*w + 275, -237 = 4*j + w. Let r be 2 + (0 + 1)*j. Let d = 107 + r. What is the units digit of d?\n | 1\n | ibivibiv/math_instruct | |
Sort 55, -5, -2/3, -0.4, 27, 0.851 in descending order.\n | 55, 27, 0.851, -0.4, -2/3, -5\n | ibivibiv/math_instruct | |
Convert 10322230123 (base 4) to base 6.\n | 43343311\n | ibivibiv/math_instruct | |
Let b(k) = k**2 - 3*k + 2. Let o be b(1). Suppose 2*n - 4*n + 14 = o. Let r = n - -4. Calculate the lowest common multiple of r and 15.\n | 165\n | ibivibiv/math_instruct | |
Let f(n) = 5*n - 8. Let z be f(12). Let x = -30 + z. Solve 0 = 5*w + x - 2 for w.\n | -4\n | ibivibiv/math_instruct | |
Let i(o) = -o**2 + o + 2. Let q = -4 + 7. Let b(v) = 2*v - 4. Let y be b(q). Let n be i(y). Solve n*g + 2*g + 8 = 0 for g.\n | -4\n | ibivibiv/math_instruct | |
Let p(w) = w**3 + 8*w**2 + 6*w + 7. List the prime factors of p(-4).\n | 47\n | ibivibiv/math_instruct |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.