A rack is a set with a binary operation such that left multiplications are automorphisms of the set and a quandle is a rack satisfying a certain condition. For a finite connected rack the cycle type of the permutation defined by left multiplication by an element is independent from the chosen element. This cycle type is called the profile of the rack. Hayashi conjectured, in the profile of a finite connected quandle, the length of a cycle must divide the length of the largest cycle. In this paper, we prove Hayashi's Conjecture in some particular cases.