B+ tree order

Question

Answer 1

lets have order as p=degree

b+tree 

Internal nodes have form <[bp][k][bp] [k][bp] [k][bp] >    order p max (p-1) keys , p are actually number of block pointers.

To find max how many keys can fit in  formula would be

blocksize*(p)+keysize(p-1)<= 512

8(p-1)+8p<=512

8p-8+8p<=512

16p<=520

p<=32.5

hence p can be max 32

your are correct it should be 32 don't know why they have given 33.