NB. written by Nakano yoshihiro NB. Jan 2010 NB. partition numbers NB. Math question for 1st Common Entrance Examination for Universities partx =: 3 : 0 : X=.x P =. (((<:y) #2) #: i. 2^<:y),"(1) 1 i =. 0 j =. 0 while. i < 2^<:y do. Q =. 0, (i{P) # >: i. y R =. 2 -~/\ Q if. -. */ 2 >: /\ R do. goto_next. end. if. X = (# R) do. j=.j+1 wr R goto_next. end. label_next. i =. >: i end. 'Number of Partitions = ', ": j ) NB. parta =: 3 : 0 : X=.x P =. (((<:y) #2) #: i. 2^<:y),"(1) 1 i =. 0 j =. 0 while. i < 2^<:y do. Q =. 0, (i{P) # >: i. y R =. 2 -~/\ Q if. -. */ 2 >: /\ R do. goto_next. end. if. X = (# R) do. if. ({.R) < (+/ (}.R)) do. j=.j+1 wr R goto_next. end. end. label_next. i =. >: i end. 'Number of Partitions = ', ": j )