As the Sesame Street Martians say, Yyyyyyyep. Yyyyep. Yep-yep-yep-yep-yep-yep. GCD is the next best thing to factoring. GCD of Gaussian integers looks slightly trickier than the ordinary version. My brain says "I don't want to learn a whole new skill!" and I have to tell it, "You put your shoes on, stop hiding in your comfort zone, go outside and have some math-fun young man." --Steve
From: Allan Wechsler <acwacw@gmail.com> Date: 10/22/20, 11:32 AM
Yes. Then take the GCD of all the remaining points (considered as Gaussian integers), and divide out by the GCD to obtain the solution.
On Thu, Oct 22, 2020 at 1:19 AM Steve Witham <sw@tiac.net> wrote:
Not only does reflection not matter to the problem, but translate the problem so that one original point is (0, 0) and let the same point in the solution be (0, 0).
From: Henry Baker <hbaker1@pipeline.com> Date: 10/21/20, 10:27 AM
I'm guessing factorization of Gaussian integers is involved...
At 12:51 AM 10/21/2020, Tom Karzes wrote:
Here's a puzzle some of you might like:
(fin)