Find 10 distinct positive integers such that each of them divides the sum of these 10 integers
Find 10 distinct positive integers such that each of them divides the sum of these 10 integers. Moreover, explain how you found the solution in the most detailed way possible.

Your offer is way too low.

I second this. You need to understand that writing out plenty of details takes time, and time of qualified professionals is expensive. For 3$ the best you can get is just the answer, with no explanation, if the question is sufficiently easy (and this seems not to be, by the way).

Ok IDK how to delete questions but I just found the answer myself so never mind this question. First to submit any answer gets the money.

You can just let it expire and get a refund. I'll submit a feedback saying that a "delete question" feature might come in handy, though.

Also, I have to apologise, the question is indeed fairly simple now that I think about it. Not that it matters since you got there on your own, but I think 56$ would probably have been fair for this one. Sometimes it's difficult to estimate how hard a problem is before actually solving it.
Answer
 The questioner was satisfied and accepted the answer, or
 The answer was disputed, but the judge evaluated it as 100% correct.
 answered
 130 views
 $2.90
Related Questions
 Prove that ${n\choose 2}2^{n2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
 InclusionExclusion and Generating Function with Coefficient (and Integer Equation)
 Combinatorics questions can someone please help?
 [Combinatorics] Selections, Distributions, and Arrangements with Multiple Restrictions
 Help with probability proofs and matrices proofs (5 problems)
 In how many different ways $n$ persons can seat around a round table?
 How many balanced lists of n left and n right parentheses are there?
 Probability of making a full house in a poker hand