This question if from the Norman L Biggs book quot;An introduction into information communication and Cryptographyquot; question 2.12 Let us say...

This question if from the Norman L Biggs book "An introduction into information communication and Cryptography"

question 2.12

Let us say that a code is complete if it is PF and K = 1. Show that if there is a complete b-ary code for an alphabet of size m, then b − 1 must divide m − 1.