# Discrete Math Question

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

1 Attachment

Blue

157

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 614 views
- $35.00

### Related Questions

- Discete Math
- [Discrete Mathematics] For {1,3,6,10,15,…}. Find a recursive formula.
- Rotational symmertries of octahedron, R($O_3$)
- Characterizing the Infinitely Visited Intersections in a Ride-Forever Path on a Directed Graph
- Graph Theory Question
- Clock Problem
- Markov Process Problem
- Count the number of decks of cards, where no king is on top of the ace of the same suit.

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