Puzzle Contest #5 - First to get all the correct answers wins 10 SBD, all attempts will receive an upvote

Puzzle5_Thumb.jpg

Spectrum Economics is holding its fifth solve the puzzles contest. I was going to hold off on this puzzle contest for a few weeks but because of the great response to the previous puzzle contest, I am bringing it forward. Later today I will be running a contest where you are required to match the YouTube video title to a screenshot I have taken from the video itself.

Anyway, back to the puzzle contest. This post contains 4 puzzles. The first person to solve all the puzzles wins 10 SBD. If we do not get a winner, the prize money of this contest will be added to the available winnings of the next contest.

How to Enter

To enter requires 1 upvote. Each entrant into the contest is allowed a maximum of 2 attempts. The attempt needs to be done in the comments section of the post. Some questions have several parts to them, all parts of each question need to be answered correctly for a chance to win.

I expect the answers to be presented in following format:

Answer 1a, 1b, 1c
Answer Lowest = , Highest =
Answer 3
Answer 4a, 4b

The closing date and time for the contest is 2PM USA Eastern Time 28/11/2017. Responses after this time will not be accepted. The answers will be provided in the comments section after the contest closes. The explanations for the answers will be provided in a separate post a few days after the contest closes.

The winner of the contest will be announced in the comments section and 10 SBD will be paid to the winner as soon as I receive the payout from the post. All attempts in the comments section will receive an upvote regardless of answers provided. That’s right, I am also rewarding participation. Good luck everybody. The value of the upvote will depend upon my voting power at the time.

Let the Contest Begin

Question 1: Replace all the question marks with the correct answers

Q1.jpg

Question 2: What is the lowest value to get from the green box to the red box (values in the green and red boxes included, follow the connectors between boxes and no moving diagonally)? What is the highest value to get from the green box to the red box (values in the green and red boxes included, follow the connectors between boxes and no moving diagonally), you are only allowed to travel through each box a maximum of once?

Q2.jpg

Question 3: Replace the question mark with the correct answer

Q3.jpg

Question 4: Replace all the question marks with the correct answers

Q4.jpg

Thank you for participating.

Steemit_Branding2.jpg

H2
H3
H4
3 columns
2 columns
1 column
39 Comments
Ecency