inputs stringlengths 330 816 | targets stringlengths 2 83 | _template_idx int64 0 9 | _task_source stringclasses 1 value | _task_name stringclasses 1 value | _template_type stringclasses 2 values |
|---|---|---|---|---|---|
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[863, 963, 880, 148, 130, 690, 149, 761, 829, 811, 924, 883, 857]
Answer: | [863, 149, 761, 829, 811, 883, 857] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[Q]: [639, 47, 382, 798, 421, 43, 773, 662, 76, 503]
[A]: [47, 421, 43, 773, 503]
[Q]: [120, 509]
[A]: [509]
[Q]: [40, 953, 805, 677, 457, 648, 993, 233, 251, 451, 678]
[A]: | [953, 677, 457, 233, 251]
| 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [533, 97, 877, 167, 397, 657, 577, 199, 571, 184, 23, 389, 93, 499, 419, 13, 261, 582]
Solution: | [97, 877, 167, 397, 577, 199, 571, 23, 389, 499, 419, 13] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example input: [47, 444, 859, 530, 197, 409]
Example output: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Q: [9, 23, 397, 829, 109, 269, 978, 858, 139, 363, 157, 396, 839, 193, 168, 937, 420, 767]
A: | [23, 397, 829, 109, 269, 139, 157, 839, 193, 937] | 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [281, 481, 643, 912, 48, 405, 658, 967, 536, 721, 410, 853, 233, 859, 293, 523, 308]
Solution: | [281, 643, 967, 853, 233, 859, 293, 523] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Input: Consider Input: [878, 277, 523, 164, 296, 731, 370, 139, 457, 777, 647]
Output: [277, 523, 139, 457, 647]
Input: Consider Input: [557, 46, 353, 587, 41, 167, 754, 239, 131]
Output: [557, 353, 587, 41, 167, 239, 131]
Input: Consider Input: [211, 637, 937, 433, 983, 86]
| Output: [211, 937, 433, 983]
| 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[74, 663, 173, 647, 787, 769, 748, 158, 933]
[173, 647, 787, 769]
[446, 479, 757, 723, 431, 193, 169, 217, 743, 898]
[479, 757, 431, 193, 743]
[829, 347, 666, 987, 842, 587, 751, 312, 298, 617, 421, 378, 519, 970]
| [829, 347, 587, 751, 617, 421]
| 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
TASK DEFINITION: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
PROBLEM: [241, 347, 566, 101, 709, 119, 47, 967, 499, 872, 2, 154, 971, 532]
SOLUTION: [241, 347, 101, 709, 47, 967, 499, 2, 971]
PROBLEM: [340, 281, 783, 342, 795, 593]
SOLUTION: [281, 593]
PROBLEM: [881, 717, 927, 718, 701, 61, 596, 143, 29, 859, 241, 11, 101, 941]
SOLUTION: | [881, 701, 61, 29, 859, 241, 11, 101, 941]
| 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Ex Input:
[897, 521, 982, 259, 569]
Ex Output:
[521, 569]
Ex Input:
[191, 179, 269, 349, 107, 619, 355, 607, 833, 937, 255, 166]
Ex Output:
[191, 179, 269, 349, 107, 619, 607, 937]
Ex Input:
[823, 890, 263, 221, 961, 433, 765, 421, 226, 439, 860, 220]
Ex Output:
| [823, 263, 433, 421, 439]
| 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Why? The integers '444' and '530' are not prime integers and they were removed from the list.
New input: [373, 399, 593, 128, 239, 277, 269, 379, 308, 567]
Solution: | [373, 593, 239, 277, 269, 379] | 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [113, 243, 971, 13, 434, 978, 130, 869, 37, 763, 61, 767, 258]
Solution: | [113, 971, 13, 37, 61] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Why? The integers '444' and '530' are not prime integers and they were removed from the list.
New input: [883, 827, 714, 216, 86, 431, 510, 89, 311, 401, 379, 525, 83, 163]
Solution: | [883, 827, 431, 89, 311, 401, 379, 83, 163] | 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example Input: [10, 709]
Example Output: [709]
Example Input: [387, 89, 211, 27, 487, 20, 472, 233, 524, 265, 29, 785, 504, 587, 726, 560, 643]
Example Output: [89, 211, 487, 233, 29, 587, 643]
Example Input: [373, 399, 593, 128, 239, 277, 269, 379, 308, 567]
Example Output: | [373, 593, 239, 277, 269, 379]
| 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
--------
Question: [625, 33, 113, 239, 617, 146]
Answer: [113, 239, 617]
Question: [846, 613, 546]
Answer: [613]
Question: [113, 243, 971, 13, 434, 978, 130, 869, 37, 763, 61, 767, 258]
Answer: | [113, 971, 13, 37, 61]
| 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Example solution: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [247, 7, 474, 191, 509, 835]
| Solution: [7, 191, 509] | 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Output: [47, 859, 197, 409]
The integers '444' and '530' are not prime integers and they were removed from the list.
New input case for you: [139, 527, 379, 731, 789, 127, 769, 713, 198, 444, 189]
Output: | [139, 379, 127, 769] | 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [580, 751]
Solution: | [751] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Q: [569, 672, 379, 13, 962, 290, 641, 523, 719, 648, 723, 659, 727, 683, 846, 986]
A: [569, 379, 13, 641, 523, 719, 659, 727, 683]
****
Q: [499, 252, 632, 368, 337, 92, 283, 641, 82, 813, 31]
A: [499, 337, 283, 641, 31]
****
Q: [9, 23, 397, 829, 109, 269, 978, 858, 139, 363, 157, 396, 839, 193, 168, 937, 420, 767]
A: | [23, 397, 829, 109, 269, 139, 157, 839, 193, 937]
****
| 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
--------
Question: [428, 494, 971, 521, 358, 260, 91, 429, 540, 846, 458, 279, 228]
Answer: [971, 521]
Question: [190, 307, 823, 895, 706]
Answer: [307, 823]
Question: [373, 729, 79, 625]
Answer: | [373, 79]
| 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [827, 642, 353, 992, 172, 372, 236, 293, 691, 963, 100]
Solution: | [827, 353, 293, 691] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[953, 179, 89, 658, 163, 633, 991, 814, 577, 580, 977, 757, 707, 307, 167, 411]
answer:
[953, 179, 89, 163, 991, 577, 977, 757, 307, 167]
question:
[349, 479, 95, 344]
answer:
[349, 479]
question:
[883, 827, 714, 216, 86, 431, 510, 89, 311, 401, 379, 525, 83, 163]
answer:
| [883, 827, 431, 89, 311, 401, 379, 83, 163]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[405, 866, 293, 647, 830, 278, 929, 214, 916]
Answer: | [293, 647, 929] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[907, 790, 3, 704, 336, 134, 862, 500, 732, 245, 332, 179]
answer:
[907, 3, 179]
question:
[929, 96, 461, 143, 117, 271, 285, 257]
answer:
[929, 461, 271, 257]
question:
[103, 649, 911, 31, 944, 731, 937, 596, 464, 394, 797, 445, 603, 401, 367, 975, 743, 929]
answer:
| [103, 911, 31, 937, 797, 401, 367, 743, 929]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Input: Consider Input: [569, 672, 379, 13, 962, 290, 641, 523, 719, 648, 723, 659, 727, 683, 846, 986]
Output: [569, 379, 13, 641, 523, 719, 659, 727, 683]
Input: Consider Input: [11, 53]
Output: [11, 53]
Input: Consider Input: [798, 876, 753, 107, 484, 73, 191, 19, 723, 541, 569, 853, 222]
| Output: [107, 73, 191, 19, 541, 569, 853]
| 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example input: [47, 444, 859, 530, 197, 409]
Example output: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Q: [798, 876, 753, 107, 484, 73, 191, 19, 723, 541, 569, 853, 222]
A: | [107, 73, 191, 19, 541, 569, 853] | 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[Q]: [709, 863, 944, 653]
[A]: [709, 863, 653]
[Q]: [65, 211, 397, 167, 397, 213]
[A]: [211, 397, 167, 397]
[Q]: [312, 373, 799, 451, 953, 659, 588, 75]
[A]: | [373, 953, 659]
| 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
Part 1. Definition
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Part 2. Example
[47, 444, 859, 530, 197, 409]
Answer: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Part 3. Exercise
[941, 440, 452, 241, 115, 465, 107]
Answer: | [941, 241, 107] | 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[EX Q]: [3, 761, 467, 65, 151, 124, 991]
[EX A]: [3, 761, 467, 151, 991]
[EX Q]: [307, 593, 978, 101, 150, 241, 271, 942, 476, 497, 233, 716, 678, 13, 579, 874, 907, 281, 518]
[EX A]: [307, 593, 101, 241, 271, 233, 13, 907, 281]
[EX Q]: [263, 509, 956, 134, 509, 653, 601, 636]
[EX A]: | [263, 509, 509, 653, 601]
| 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [941, 59, 653, 694, 5, 941, 377, 969, 653, 983, 151, 790, 196, 749, 38, 439, 191, 439, 83]
Solution: | [941, 59, 653, 5, 941, 653, 983, 151, 439, 191, 439, 83] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example input: [47, 444, 859, 530, 197, 409]
Example output: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Q: [983, 23, 220, 749, 605, 229, 576, 854, 927]
A: | [983, 23, 229] | 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
Teacher: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Teacher: Now, understand the problem? If you are still confused, see the following example:
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Reason: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this instance: [641, 326, 353, 984, 357, 318, 103, 171, 707, 18, 733, 997, 786, 763, 21, 510, 254, 765, 541, 7]
Student: | [641, 353, 103, 733, 997, 541, 7] | 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[Q]: [2, 288, 364, 227, 209, 156, 702]
[A]: [2, 227]
[Q]: [337, 76, 431, 311, 78, 785, 181, 373, 832, 18]
[A]: [337, 431, 311, 181, 373]
[Q]: [172, 586, 17, 109, 34, 506, 607, 181, 189, 225, 653, 827, 195]
[A]: | [17, 109, 607, 181, 653, 827]
| 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
TASK DEFINITION: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
PROBLEM: [357, 811, 209]
SOLUTION: [811]
PROBLEM: [131, 821, 95, 47, 227, 364, 470, 512, 798]
SOLUTION: [131, 821, 47, 227]
PROBLEM: [198, 947, 589, 967, 788, 151]
SOLUTION: | [947, 967, 151]
| 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[Q]: [340, 281, 783, 342, 795, 593]
[A]: [281, 593]
[Q]: [600, 153, 463]
[A]: [463]
[Q]: [463, 593, 108, 23, 52, 461, 733, 794, 108, 719, 613, 491, 863, 317, 733, 379, 607, 351, 947, 541]
[A]: | [463, 593, 23, 461, 733, 719, 613, 491, 863, 317, 733, 379, 607, 947, 541]
| 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[887, 147, 474, 684, 280, 661, 991, 545, 363]
[887, 661, 991]
[937, 154, 263, 647, 820, 979, 887, 343, 793]
[937, 263, 647, 887]
[655, 754, 718, 457, 31, 204, 11, 193, 431, 920, 112, 840]
| [457, 31, 11, 193, 431]
| 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[875, 81, 45, 380, 89, 761, 599, 376, 137, 257, 755]
answer:
[89, 761, 599, 137, 257]
question:
[64, 3, 967, 257, 557, 933, 239, 899, 528, 256, 487, 757, 719, 919, 331, 222]
answer:
[3, 967, 257, 557, 239, 487, 757, 719, 919, 331]
question:
[259, 31, 397, 433, 480, 199, 110]
answer:
| [31, 397, 433, 199]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [730, 167, 497, 786, 743, 233]
Solution: | [167, 743, 233] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[937, 941, 447, 487, 939, 425, 623, 107, 758, 63, 180]
answer:
[937, 941, 487, 107]
question:
[457, 439, 11, 691, 907, 487, 831, 700, 331, 409, 785, 914, 401]
answer:
[457, 439, 11, 691, 907, 487, 331, 409, 401]
question:
[478, 83, 137, 227, 797, 563]
answer:
| [83, 137, 227, 797, 563]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[71, 837, 241, 617, 386, 307, 212, 671, 904, 617, 557, 823, 227, 269, 839]
Answer: | [71, 241, 617, 307, 617, 557, 823, 227, 269, 839] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
Teacher: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Teacher: Now, understand the problem? If you are still confused, see the following example:
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Reason: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this instance: [911, 661, 80, 283, 26, 631, 617, 887, 673, 462, 101, 5, 976, 157, 569, 487, 439, 421]
Student: | [911, 661, 283, 631, 617, 887, 673, 101, 5, 157, 569, 487, 439, 421] | 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[245, 945, 936, 569, 823, 193, 997, 131, 353, 769, 873, 687, 269, 167]
[569, 823, 193, 997, 131, 353, 769, 269, 167]
[984, 41, 407, 10, 149, 601, 40, 428, 739, 82]
[41, 149, 601, 739]
[145, 71, 214, 987, 449]
| [71, 449]
| 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[EX Q]: [421, 904, 487]
[EX A]: [421, 487]
[EX Q]: [984, 41, 407, 10, 149, 601, 40, 428, 739, 82]
[EX A]: [41, 149, 601, 739]
[EX Q]: [247, 67, 103, 595, 77, 547, 881, 355, 773, 527, 314, 170, 211, 873, 109, 727, 577]
[EX A]: | [67, 103, 547, 881, 773, 211, 109, 727, 577]
| 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Q: [459, 947, 647, 300, 157, 268, 388, 463, 470, 533, 838, 22, 461]
A: [947, 647, 157, 463, 461]
****
Q: [647, 653, 812, 761, 304, 929, 83]
A: [647, 653, 761, 929, 83]
****
Q: [504, 233, 761, 97, 367, 307, 958, 812, 75]
A: | [233, 761, 97, 367, 307]
****
| 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [601, 740]
Solution: | [601] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[97, 977, 167, 229, 293, 232, 697, 632, 71, 673]
Answer: | [97, 977, 167, 229, 293, 71, 673] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Ex Input:
[664, 251, 443, 800, 90, 861, 2, 191, 359, 179, 941, 937, 397, 463, 113, 704]
Ex Output:
[251, 443, 2, 191, 359, 179, 941, 937, 397, 463, 113]
Ex Input:
[613, 678, 877, 795, 945, 335, 300, 987, 590, 596, 775]
Ex Output:
[613, 877]
Ex Input:
[879, 508, 482, 496, 313, 167, 21, 23, 936, 43, 454, 127, 319, 647, 138, 859, 457, 331]
Ex Output:
| [313, 167, 23, 43, 127, 647, 859, 457, 331]
| 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Input: Consider Input: [245, 536, 181, 170, 516, 349, 752, 700, 254, 356, 800, 577, 922, 811, 836, 774]
Output: [181, 349, 577, 811]
Input: Consider Input: [284, 952, 456, 622, 59, 911, 380, 829, 151, 723, 524, 739, 2]
Output: [59, 911, 829, 151, 739, 2]
Input: Consider Input: [954, 241, 617, 41, 753, 29, 59, 919, 653, 983, 294, 882, 852, 936, 859]
| Output: [241, 617, 41, 29, 59, 919, 653, 983, 859]
| 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Example solution: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [571, 911, 677, 610, 401, 449, 635, 823, 223, 548, 751, 409, 192, 546, 452, 845, 243]
| Solution: [571, 911, 677, 401, 449, 823, 223, 751, 409] | 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Ex Input:
[937, 691, 304, 313, 655, 499]
Ex Output:
[937, 691, 313, 499]
Ex Input:
[464, 700, 944, 271, 353, 41, 307, 659, 967, 331, 392, 937, 52, 469, 347, 66, 709, 972, 193]
Ex Output:
[271, 353, 41, 307, 659, 967, 331, 937, 347, 709, 193]
Ex Input:
[617, 251, 643, 205, 107, 800, 113, 717, 43, 466, 272, 217, 448, 769, 981, 113, 131]
Ex Output:
| [617, 251, 643, 107, 113, 43, 769, 113, 131]
| 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
Teacher: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Teacher: Now, understand the problem? If you are still confused, see the following example:
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Reason: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this instance: [863, 967, 193, 507, 109, 769, 89, 613, 769, 746, 690]
Student: | [863, 967, 193, 109, 769, 89, 613, 769] | 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [725, 499, 951, 463]
Solution: | [499, 463] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [431, 629, 502, 653, 596, 38, 509, 984, 539, 419, 980, 719, 442, 903, 562, 632, 317, 330, 777]
Solution: | [431, 653, 509, 419, 719, 317] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[5, 672, 373, 997, 487, 467, 173, 991, 241, 587, 840, 277, 941, 457, 353, 964, 467, 359, 377, 80]
answer:
[5, 373, 997, 487, 467, 173, 991, 241, 587, 277, 941, 457, 353, 467, 359]
question:
[109, 693, 732, 360, 693, 311, 733, 963, 167, 903]
answer:
[109, 311, 733, 167]
question:
[131, 881, 897, 56, 600, 841, 11]
answer:
| [131, 881, 11]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Q: [569, 672, 379, 13, 962, 290, 641, 523, 719, 648, 723, 659, 727, 683, 846, 986]
A: [569, 379, 13, 641, 523, 719, 659, 727, 683]
****
Q: [179, 353, 251, 983, 83, 385, 876, 383, 749, 144, 89, 683, 75, 528, 101, 282, 20, 409, 647, 301]
A: [179, 353, 251, 983, 83, 383, 89, 683, 101, 409, 647]
****
Q: [509, 468, 509, 163, 988, 340, 179, 113, 281, 480, 785, 269, 11, 597, 190, 508, 61, 713]
A: | [509, 509, 163, 179, 113, 281, 269, 11, 61]
****
| 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[808, 739, 546, 228, 977, 419, 862, 419, 189, 787, 827, 507, 853, 803, 23, 463, 840, 153]
[739, 977, 419, 419, 787, 827, 853, 23, 463]
[277, 888, 263, 883, 420, 818]
[277, 263, 883]
[449, 947, 396, 229, 953, 595, 695, 809, 871]
| [449, 947, 229, 953, 809]
| 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Input: Consider Input: [686, 533, 336, 254, 2, 418, 197, 167, 65, 448, 723]
Output: [2, 197, 167]
Input: Consider Input: [350, 569, 417, 498, 34, 831, 919, 67, 131, 5, 607, 47, 543, 465, 787, 713, 631]
Output: [569, 919, 67, 131, 5, 607, 47, 787, 631]
Input: Consider Input: [151, 634, 90, 92, 71, 710, 461, 241, 729, 980, 211, 3]
| Output: [151, 71, 461, 241, 211, 3]
| 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Ex Input:
[678, 34, 45, 450, 271, 227, 885, 65, 53, 438, 967, 730, 739, 519, 379]
Ex Output:
[271, 227, 53, 967, 739, 379]
Ex Input:
[557, 647, 79, 153, 305, 413, 167, 615, 575, 461, 575, 977]
Ex Output:
[557, 647, 79, 167, 461, 977]
Ex Input:
[619, 373, 977, 248, 911, 502, 421, 554, 239, 518, 919]
Ex Output:
| [619, 373, 977, 911, 421, 239, 919]
| 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [151, 634, 90, 92, 71, 710, 461, 241, 729, 980, 211, 3]
Solution: | [151, 71, 461, 241, 211, 3] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [619, 373, 977, 248, 911, 502, 421, 554, 239, 518, 919]
Solution: | [619, 373, 977, 911, 421, 239, 919] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
Teacher: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Teacher: Now, understand the problem? If you are still confused, see the following example:
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Reason: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this instance: [103, 521, 437]
Student: | [103, 521] | 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[195, 107, 617, 947, 237, 657, 467, 19, 857]
Answer: | [107, 617, 947, 467, 19, 857] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
TASK DEFINITION: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
PROBLEM: [947, 439, 241, 143, 179, 397, 239, 809, 702, 5, 739, 853, 62, 443, 181, 495, 557, 151]
SOLUTION: [947, 439, 241, 179, 397, 239, 809, 5, 739, 853, 443, 181, 557, 151]
PROBLEM: [245, 536, 181, 170, 516, 349, 752, 700, 254, 356, 800, 577, 922, 811, 836, 774]
SOLUTION: [181, 349, 577, 811]
PROBLEM: [749, 349, 659, 251, 743]
SOLUTION: | [349, 659, 251, 743]
| 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
--------
Question: [709, 808, 810, 505, 313, 720, 61, 683, 953, 535, 991, 546, 498, 965, 71, 449, 73, 865]
Answer: [709, 313, 61, 683, 953, 991, 71, 449, 73]
Question: [977, 73, 967, 139, 547, 463, 587, 619, 821, 136, 191, 933, 420, 211, 233]
Answer: [977, 73, 967, 139, 547, 463, 587, 619, 821, 191, 211, 233]
Question: [647, 653, 812, 761, 304, 929, 83]
Answer: | [647, 653, 761, 929, 83]
| 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[647, 653, 812, 761, 304, 929, 83]
Answer: | [647, 653, 761, 929, 83] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[Q]: [863, 427, 876, 917, 692, 804, 273, 597, 929, 79, 276, 509, 339]
[A]: [863, 929, 79, 509]
[Q]: [3, 761, 467, 65, 151, 124, 991]
[A]: [3, 761, 467, 151, 991]
[Q]: [937, 193]
[A]: | [937, 193]
| 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Why? The integers '444' and '530' are not prime integers and they were removed from the list.
New input: [71, 457, 275]
Solution: | [71, 457] | 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Output: [47, 859, 197, 409]
The integers '444' and '530' are not prime integers and they were removed from the list.
New input case for you: [300, 281, 872, 956, 860, 239, 420, 941]
Output: | [281, 239, 941] | 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Why? The integers '444' and '530' are not prime integers and they were removed from the list.
New input: [870, 137, 127, 71, 468, 234, 109, 919, 777, 668, 207, 666, 874, 175, 531, 928, 144, 37, 182]
Solution: | [137, 127, 71, 109, 919, 37] | 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Why? The integers '444' and '530' are not prime integers and they were removed from the list.
New input: [404, 337, 421, 907, 617, 739, 191, 161, 858, 927, 331]
Solution: | [337, 421, 907, 617, 739, 191, 331] | 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Output: [47, 859, 197, 409]
The integers '444' and '530' are not prime integers and they were removed from the list.
New input case for you: [541, 690, 373, 346, 407, 353, 753, 25, 960, 373, 421, 222, 515, 89, 55, 278, 83]
Output: | [541, 373, 353, 373, 421, 89, 83] | 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Q: [519, 638, 433, 401]
A: [433, 401]
****
Q: [937, 691, 304, 313, 655, 499]
A: [937, 691, 313, 499]
****
Q: [113, 984]
A: | [113]
****
| 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [914, 506, 853, 367, 500]
Solution: | [853, 367] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Example solution: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [625, 199, 111, 643, 876]
| Solution: [199, 643] | 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
Part 1. Definition
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Part 2. Example
[47, 444, 859, 530, 197, 409]
Answer: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Part 3. Exercise
[659, 94, 706, 247, 444, 212, 910, 367, 743, 349, 977, 780, 540, 271, 907, 487, 913, 729, 113, 830]
Answer: | [659, 367, 743, 349, 977, 271, 907, 487, 113] | 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
--------
Question: [103, 289, 846, 227, 268, 827, 893, 822, 688, 864, 454, 43, 887, 499, 383, 632, 89, 518, 126, 515]
Answer: [103, 227, 827, 43, 887, 499, 383, 89]
Question: [125, 924, 496, 281, 477, 19, 433, 232, 521, 489, 617, 432, 433, 567, 383, 610]
Answer: [281, 19, 433, 521, 617, 433, 383]
Question: [706, 694, 955, 937, 641, 556, 919, 739, 502, 104, 30]
Answer: | [937, 641, 919, 739]
| 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example input: [47, 444, 859, 530, 197, 409]
Example output: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Q: [953, 577, 913, 37, 626, 958, 605, 502, 688, 673, 197, 881, 612, 914, 230, 605, 243, 487]
A: | [953, 577, 37, 673, 197, 881, 487] | 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Q: [871, 360, 588, 719, 599, 719, 461]
A: [719, 599, 719, 461]
****
Q: [367, 241, 827, 887, 536, 827, 227]
A: [367, 241, 827, 887, 827, 227]
****
Q: [307, 59, 252, 101, 980, 743, 89, 827, 277, 179, 353, 963]
A: | [307, 59, 101, 743, 89, 827, 277, 179, 353]
****
| 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Input: Consider Input: [74, 663, 173, 647, 787, 769, 748, 158, 933]
Output: [173, 647, 787, 769]
Input: Consider Input: [104, 191, 709, 245, 433, 937, 324, 619, 62, 25, 719, 404, 867, 146, 709, 431, 481]
Output: [191, 709, 433, 937, 619, 719, 709, 431]
Input: Consider Input: [742, 373, 653, 911, 373, 202, 821, 877]
| Output: [373, 653, 911, 373, 821, 877]
| 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [36, 284, 785, 119]
Solution: | [] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[563, 283, 487, 787, 29, 73, 644]
answer:
[563, 283, 487, 787, 29, 73]
question:
[97, 918, 668, 448, 850, 883, 727, 499]
answer:
[97, 883, 727, 499]
question:
[193, 113, 376, 821, 422, 880, 61, 124, 693, 857, 56, 317, 178, 651]
answer:
| [193, 113, 821, 61, 857, 317]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example is below.
Q: [47, 444, 859, 530, 197, 409]
A: [47, 859, 197, 409]
Rationale: The integers '444' and '530' are not prime integers and they were removed from the list.
Q: [72, 521, 536, 870, 638, 227, 83, 996, 482, 3]
A: | [521, 227, 83, 3] | 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
--------
Question: [389, 709, 551, 516, 317]
Answer: [389, 709, 317]
Question: [277, 888, 263, 883, 420, 818]
Answer: [277, 263, 883]
Question: [834, 661, 787, 183, 397, 769, 947, 521, 830, 697]
Answer: | [661, 787, 397, 769, 947, 521]
| 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
--------
Question: [598, 667, 772, 975]
Answer: []
Question: [10, 709]
Answer: [709]
Question: [914, 506, 853, 367, 500]
Answer: | [853, 367]
| 7 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Ex Input:
[467, 223, 227, 457, 569, 143, 473]
Ex Output:
[467, 223, 227, 457, 569]
Ex Input:
[269, 347, 937, 36, 521, 363, 643, 461, 402]
Ex Output:
[269, 347, 937, 521, 643, 461]
Ex Input:
[906, 83, 397, 340, 382, 873, 37, 317, 311]
Ex Output:
| [83, 397, 37, 317, 311]
| 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Why? The integers '444' and '530' are not prime integers and they were removed from the list.
New input: [409, 35, 250, 581, 110, 397, 78, 641, 183, 919]
Solution: | [409, 397, 641, 919] | 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Ex Input:
[476, 265, 147, 972, 53, 107, 151, 577, 619, 433]
Ex Output:
[53, 107, 151, 577, 619, 433]
Ex Input:
[298, 919]
Ex Output:
[919]
Ex Input:
[924, 137, 33, 828, 281, 670, 407, 601, 775, 863, 571, 43, 169, 139, 97, 71]
Ex Output:
| [137, 281, 601, 863, 571, 43, 139, 97, 71]
| 1 | NIv2 | task366_synthetic_return_primes | fs_opt |
instruction:
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
question:
[457, 643, 227, 295, 191, 934, 36, 709, 590, 98, 701, 99, 23, 419, 984, 337, 736, 241, 271]
answer:
[457, 643, 227, 191, 709, 701, 23, 419, 337, 241, 271]
question:
[723, 791, 587, 73, 601, 733, 842, 277, 983]
answer:
[587, 73, 601, 733, 277, 983]
question:
[193, 269, 108, 137, 824, 86, 107, 55, 291, 2, 69, 548, 223, 145, 836, 457, 695, 792, 239]
answer:
| [193, 269, 137, 107, 2, 223, 457, 239]
| 9 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Input: Consider Input: [245, 945, 936, 569, 823, 193, 997, 131, 353, 769, 873, 687, 269, 167]
Output: [569, 823, 193, 997, 131, 353, 769, 269, 167]
Input: Consider Input: [509, 947, 32, 105, 458, 629, 920, 137, 967]
Output: [509, 947, 137, 967]
Input: Consider Input: [852, 28, 564, 621, 688, 937, 90, 149, 888, 241, 735, 911, 337, 859, 5, 300, 151, 272, 455, 610]
| Output: [937, 149, 241, 911, 337, 859, 5, 151]
| 2 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [971, 84, 379, 241, 510, 410, 953, 768]
Solution: | [971, 379, 241, 953] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[217, 895, 596, 499, 273, 479, 743, 31, 67, 392, 811, 432, 549, 723, 701, 229]
[499, 479, 743, 31, 67, 811, 701, 229]
[269, 347, 937, 36, 521, 363, 643, 461, 402]
[269, 347, 937, 521, 643, 461]
[611, 541, 326]
| [541]
| 0 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[EX Q]: [316, 281, 449, 870, 266]
[EX A]: [281, 449]
[EX Q]: [558, 559, 356, 277, 643, 859, 733, 859, 617]
[EX A]: [277, 643, 859, 733, 859, 617]
[EX Q]: [450, 826, 15, 788, 249, 206, 67, 822, 919, 951, 739]
[EX A]: | [67, 919, 739]
| 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
[Q]: [971, 981, 787, 380, 907, 673, 660, 227, 593, 666, 563, 556, 257]
[A]: [971, 787, 907, 673, 227, 593, 563, 257]
[Q]: [211, 22, 139, 887, 460, 827, 727, 392, 489, 401, 122, 945, 499, 569, 13, 348, 695, 867]
[A]: [211, 139, 887, 827, 727, 401, 499, 569, 13]
[Q]: [619, 631, 964, 763, 891, 109]
[A]: | [619, 631, 109]
| 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [935, 431]
Solution: | [431] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Let me give you an example: [47, 444, 859, 530, 197, 409]
The answer to this example can be: [47, 859, 197, 409]
Here is why: The integers '444' and '530' are not prime integers and they were removed from the list.
OK. solve this:
[673, 941, 291]
Answer: | [673, 941] | 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example: [47, 444, 859, 530, 197, 409]
Example solution: [47, 859, 197, 409]
Example explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [307, 67, 641, 907, 683, 879, 683, 755, 83, 187]
| Solution: [307, 67, 641, 907, 683, 683, 83] | 5 | NIv2 | task366_synthetic_return_primes | fs_opt |
TASK DEFINITION: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
PROBLEM: [47, 239, 313, 797, 687, 787, 311]
SOLUTION: [47, 239, 313, 797, 787, 311]
PROBLEM: [716, 151, 293, 905, 911, 263]
SOLUTION: [151, 293, 911, 263]
PROBLEM: [73, 131, 857, 869, 421, 776, 919, 593, 149, 107]
SOLUTION: | [73, 131, 857, 421, 919, 593, 149, 107]
| 8 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
One example: [47, 444, 859, 530, 197, 409]
Solution is here: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Now, solve this: [419, 30, 463, 409, 104, 283, 209, 393, 257, 753, 482, 774, 373, 997, 379, 88, 37, 208, 496, 443]
Solution: | [419, 463, 409, 283, 257, 373, 997, 379, 37, 443] | 6 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example Input: [340, 281, 783, 342, 795, 593]
Example Output: [281, 593]
Example Input: [293, 765, 661, 140, 19, 308]
Example Output: [293, 661, 19]
Example Input: [564, 823, 409, 349, 613, 723, 831, 206, 109, 121, 347, 67, 65]
Example Output: | [823, 409, 349, 613, 109, 347, 67]
| 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
Detailed Instructions: In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
See one example below:
Problem: [47, 444, 859, 530, 197, 409]
Solution: [47, 859, 197, 409]
Explanation: The integers '444' and '530' are not prime integers and they were removed from the list.
Problem: [623, 709, 89, 605, 559, 675, 41, 423, 179, 337, 614, 577]
Solution: | [709, 89, 41, 179, 337, 577] | 4 | NIv2 | task366_synthetic_return_primes | fs_opt |
In this task you will be given a list of integers. You should remove any integer that is not prime. A prime integer is an integer that is only divisible by '1' and itself. The output should be the list of prime numbers in the input list. If there are no primes in the input list an empty list ("[]") should be returned.
Example Input: [389, 709, 551, 516, 317]
Example Output: [389, 709, 317]
Example Input: [428, 494, 971, 521, 358, 260, 91, 429, 540, 846, 458, 279, 228]
Example Output: [971, 521]
Example Input: [340, 879, 405, 911, 484, 239, 547, 425, 857, 915, 408, 352, 675, 338, 167, 388, 233]
Example Output: | [911, 239, 547, 857, 167, 233]
| 3 | NIv2 | task366_synthetic_return_primes | fs_opt |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5