Loading [MathJax]/jax/output/HTML-CSS/jax.js
This blog has moved to www.mscroggs.co.uk.

Monday, 25 August 2014

Sunday Afternoon Maths XXVI Answers & Extensions

This post contains the answers to this week's Sunday Afternoon Maths and some extension problems based around the originals.

Twenty-One

Virgil should go second. Whatever Scott adds, Virgil should then add to make four. For example, if Scott says 3, Virgil should say 1.
Using this strategy, Virgil will say 4, 8, 12, 16 then 20, forcing Scott to go above 21.
Extension
(i) If instead of 21, 22 cannot be said/beaten, how should Virgil win? How about 23? Or 24? How about n?
(ii) If instead of adding 1 to 3, 1 to 4 can be added, how should Virgil win? How about 1 to 5? Or 2 to 5? How about m to l?
(iii) Alan wants to join the game. Can Virgil win if there are three people? Can he win if there are k people?

Odd and Even Outputs

n
oddeven
moddoddodd
eoddodd
g(n,m)=1

n
oddeven
moddoddodd
eoddeven
g(n,m)=n×m+n+m

n
oddeven
moddoddodd
eevenodd
g(n,m)=n×m+n+1

n
oddeven
moddoddodd
eeveneven
g(n,m)=m
n
oddeven
moddoddeven
eoddodd
g(n,m)=n×m+m+1

n
oddeven
moddoddeven
eoddeven
g(n,m)=n

n
oddeven
moddoddeven
eevenodd
g(n,m)=n+m+1

n
oddeven
moddoddeven
eeveneven
g(n,m)=n×m
n
oddeven
moddevenodd
eoddodd
g(n,m)=n×m+1

n
oddeven
moddevenodd
eoddeven
g(n,m)=n+m

n
oddeven
moddevenodd
eevenodd
g(n,m)=n+1

n
oddeven
moddevenodd
eeveneven
g(n,m)=n×m+n
n
oddeven
moddeveneven
eoddodd
g(n,m)=m+1

n
oddeven
moddeveneven
eoddeven
g(n,m)=n×m+n

n
oddeven
moddeveneven
eevenodd
g(n,m)=n×m+n+m+1

n
oddeven
moddeveneven
eeveneven
g(n,m)=2
Extension
Can you find functions h:N×N×NN (call the inputs n, m and l) to give the following outputs:
l odd
n
oddeven
moddeveneven
eeveneven
l even
n
oddeven
moddeveneven
eeveneven

l odd
n
oddeven
moddeveneven
eeveneven
l even
n
oddeven
moddeveneven
eevenodd

etc

No comments:

Post a Comment