I'd like a program that is sort of the inverse of augment. What I want to do is take a list, say L1, then partition it into equal length sublists and stores them into L1, …, Lk for some arbitrary k. If need to be I can add the number 23 several times to L1 until I can partition it. I would like for each list to have n elements.

Example:

Take L1 = {1,2,3,4,5,6,7,8,9,10}

I'd like to partition it into equal sublists of length n = 3

L1 has 10 elements which is not a multiple of 3 so I add 23 twice to it to get:

L1 = {1,2,3,4,5,6,7,8,9,10,23,23}

Then I partition it into equal sublists of length 3 and get:

L2 = {1,2,3}

L3 = {4,5,6}

L4 = {7,8,9}

L5 = {10,23,23}

However this is one specific example but I'd like my program to work for any n so that I can go N->T:prgrParttition and it runs.

Once I can do this I can turn a string into a single list, then partition that single list, then takes those lists as columns of a matrix, then transpose that matrix to get a matrix like one would when using Hill Cipher.