We play a game where there are 50 coins in a row, we take turns taking between 1 and 5 coins however many you like. whoever takes the last coin keeps them all. how can i win everytime and does it matter if i go first

The strategy for winning every time appears to be to ensure that the remaining number of coins is a multiple of 6. Then the first player can ensure a win by taking 2 coins to make the total number be 48.

You would need a laid out graph for this but could you provide a picture of just a graph? i can give stepssolve for y.subtract 4xdivide by -1 (opposites)graph slope intercept formcheck each point to see if it’s on the graph