instruction_seed stringlengths 41 884 | source stringclasses 3
values |
|---|---|
Find the sum of the squares of the first N natural numbers where N is a large positive integer (N >= 10^6). | codefeedback |
Find the sum of the first 1000 prime numbers that are greater than 100. | codefeedback |
Find the median of three distinct positive integers (between 1 and 1000), where one of the integers must be divisible by 5. | codefeedback |
Find the lowest positive integer that can not be represented as the sum of three distinct prime numbers. | codefeedback |
Find the sum of the series n^4/(4n+2).
14 | codefeedback |
Find the median of three distinct positive integers (between 1 and 1000), where one of the integers must be divisible by 5. Additionally, the median must be a prime number and the sum of the three integers must be a perfect square. | codefeedback |
Find the lowest positive integer that can not be represented as the sum of exactly three distinct prime numbers. In addition, the sum of the three primes must be the largest possible prime number less than or equal to the given positive integer. | codefeedback |
Create an array of 10 unique numbers between -100 and 100, with the constraint that the sum of all the numbers in the array must be less than 500. Additionally, the sum of the first 5 numbers in the array must be positive and the sum of the last 5 numbers must be negative. | codefeedback |
Retrieve the number of letters in the following phrase .
"May the force be with you!" | codefeedback |
Find the sum of the squares of the following numbers.
[2, 3, 4] | codefeedback |
Create a program that reads an integer N and calculates the sum of the series 1/1 + 1/2 + 1/3 + . . . . . + 1/N. | codefeedback |
You are tasked with implementing a rail fence cipher encryption algorithm. The rail fence cipher is a transposition cipher that rearranges the plaintext letters by writing them in a zigzag pattern down and up the rails of a fence. The number of "rails" used for the zigzag pattern is determined by the key provided. For ... | codefeedback |
Determine the number of positive integers less than $10^{20}$ that are divisible by at least five distinct primes less than $200$. | codefeedback |
<p>It can be confirmed that there are $31$ positive integers less than $5000$ that are divisible by at least five distinct primes less than $200$.</p>
<p>Find how many positive integers less than $10^{20}$ are divisible by at least five distinct primes less than $200$.</p> | codefeedback |
Formulate a coding sequence capable of generating the subsequent depicted result:
. . . . . . . . . . . . . . . . . . . . . . | codefeedback |
Find the sum of the first 1000 prime numbers that are greater than 100. | codefeedback |
How can I modify an array of integers such that the sum of the even numbers is greater than the sum of the odd numbers? | glaive |
You are tasked with finding the sum of all positive integers that cannot be written as the sum of two abundant numbers. An abundant number is a number for which the sum of its proper divisors is greater than the number itself.
Write a function that takes no input and returns the sum of all positive integers which can... | glaive |
Formulate a coding sequence capable of generating the subsequent depicted result:
. . . . . . . . . . . . . . . . . . . . . . | sharegpt |
Find out the number of occurrences of the number 'E' in the hexadecimal number 9BD3EFA. | sharegpt |
Find the sum of the first 1000 prime numbers that are greater than 100. | sharegpt |
I am getting an error message "standard_init_linux.go:211: exec user process caused “exec format error”" when running my code. Can anyone help me identify what I am doing wrong?
```Dockerfile
FROM golang:alpine AS builder
ENV GO111MODULE=on CGO_ENABLED=0 GOOS=linux GOARCH=amd64 GOARCH=wasm GOOS=js
WORKDIR /build
CO... | sharegpt |
How can I modify an array of integers such that the sum of the even numbers is greater than the sum of the odd numbers? | sharegpt |
README.md exists but content is empty.
- Downloads last month
- 8