Discrete Math Question
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
1 Attachment
166
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 728 views
- $35.00
Related Questions
- Prove that in 2-edge-connected graph, each vertex lies on a cycle.
- Discrete Structures - Proving a statement false by proving the negation to be true
- Help Resolving Questions
- [Discrete Mathematics] Big-O Notation
- Order Notation
- [Discrete Mathematics] For {1,3,6,10,15,…}. Find a recursive formula.
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Recursive Set
The offered bounty is too low for the level of the question.
What is an appropriate bounty?
To decide what a fair bounty should be, think about how much time one may need to spend to write a careful solution and what a reasonable hourly rate would be for someone with that level of skill.
I don't know how to go about this question so I don't know how hard it is. How much do you think the bounty should be?
This is not my area of expertise, but I would say at least $30.
I know Graph Theory and I would attempt this but I agree with Daniel90 that $10 is too low. It should be around $40.
How about around 35? Does that seem fair?
Are you allowed to use the integrality condition?
Yes that is acceptable