I was wondering if anyone could explain the method of finding all the points of finite order over C(\mathbb{Q}), with C: y^2=x^3 + px, where p is a prime bigger or equal to 2.

this would explain a lot of the theory to me.

also - do worked examples or solutions to exercises from cassels, or silverman (+tate) exist? missing the ability to apply things i have heard in lectures :(

thank you.