For a number to be a multiple of 6, it must be a multiple of 2 and a multiple of 3.
Let Martha’s four-digit number be ‘abcd’ and Nadia’s number be ‘efgh’.
We will show that the sum of these two four-digit numbers is actually always a multiple of 3.
The sum of the two four-digit numbers is \(1000a + 100b + 10c + d + 1000e + 100f + 10g + h\).
This can be re-written as \(999a + 99b + 9c + 999e + 99f + 9g + a + b + c + d + e + f + g + h\), which is \(3(333a + 33b + 3c + 333e + 33f + 3g) + a + b + c + d + e + f + g + h\). This is a multiple of 3 added to \(a + b + c + d + e + f + g + h\).
But we know that \(a\), \(b\), \(c\), \(d\), \(e\), \(f\), \(g\) and \(h\) are the digits 1, 2, 3, 4, 5, 6, 7 and 8 in some order. So \(a + b + c + d + e + f + g + h = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 = 36\), which is also a multiple of 3.
This means that the sum of the two four-digit numbers is always a multiple of 3, whatever cards Martha and Nadia choose.
So, for Nadia to win the game, she needs to be able to ensure that the sum of the two four-digit numbers is a multiple of 2, and so is automatically a multiple of 6.
A winning strategy for Nadia is to always choose an even number if Martha just chose an even number and an odd number if Martha chose an odd number. This is always possible as we start with four even and four odd numbers in the digits from 1 to 8. This strategy will guarantee that the sum of the two four-digit numbers is even and so a multiple of 6.
N.B. There are many winning strategies for Nadia, some of which replace the need to prove the general property that two four-digit numbers, chosen in the way described, always add up to a multiple of 3, with a restricted argument concerning particular pairings of numbers that tell Nadia what to choose if Martha chooses one of the digits in the pair. For example \(\{1, 5\}\), \(\{2, 8\}\), \(\{3, 7\}\) and \(\{4, 6\}\).