Given an integer d ≥ 2, what is the least r so that there is a set of binary quadratic forms {f 1 , . . . , f r } for which {f d j } is non-trivially linearly dependent? We show that if r ≤ 4, then d ≤ 5, and for d ≥ 4, construct such a set with r = ⌊d/2⌋ + 2. Many explicit examples are given, along with techniques for producing others.