Talk:Sum and product puzzle: Difference between revisions

m
Thundergnat moved page Talk:Sum and Product Puzzle to Talk:Sum and product puzzle: Follow normal task title capitalization policy
m (Thundergnat moved page Talk:Sum and Product Puzzle to Talk:Sum and product puzzle: Follow normal task title capitalization policy)
 
(One intermediate revision by one other user not shown)
Line 36:
--[[User:Walterpachl|Walterpachl]] ([[User talk:Walterpachl|talk]]) 19:59, 05 November 2016 (UTC)
: I think I found the answer myself:-) If ANY of the decompositions of the given pair's sum had a unique product I couldn't be sure that P does NOT know. So all pairs resulting in the given sum could be eliminated not just the one at hand. (They will be later on or have already been...) --[[User:Walterpachl|Walterpachl]] ([[User talk:Walterpachl|talk]]) 05:59, 10 November 2016 (UTC)
 
== Java program inconsistent with others ==
It allows the sum to be equal to maximum value. The threshold for a second solution should be X+Y<1866, not 1865.
10,327

edits