A t(v,k,λ) design is a set of v points together with a collection of its k-subsets called blocks so that t points are contained in exactly λ blocks. PG(n,q), the n-dimensional projective geometry over GF(q) is a 2(q n+q n−1+⋯+q+1,q 2+q+1, q n−2+ q n−3+⋯+q+1) design when we take its points as the points of the design and its planes as the blocks of the design. A 2(v,k,λ) design is said to be resolvable if the blocks can be partitioned as ℱ={R 1,R 2,…,R s }, where s=λ(v−1)/(k−1) and each R i consists of v/k disjoint blocks. If a resolvable design has an automorphism σ which acts as a cycle of length v on the points and ℱσ=ℱ, then the design is said to be point-cyclically resolvable. The design consisting of points and planes of PG(5,2) is shown to be point-cyclically resolvable by enumerating all inequivalent resolutions which are invariant under a cyclic automorphism group G=〈σ〉 where σ is a cycle of length v. These resolutions are shown to be the only resolutions which admit point-transitive automorphism group.