Skip to main content
24 events
when toggle format what by license comment
Aug 4, 2022 at 6:08 comment added Brett Berger It seems like people talk about many different versions of the problem, but only certain enthusiasts take any one version to an extreme depth. I'll be the enthusiast who goes deep on the "sum and product, lower bound 3, no upper bound" version, then!
Aug 3, 2022 at 23:46 comment added Max Alekseyev Some variations were discussed at AOPS: artofproblemsolving.com/community/c146h150971
Aug 3, 2022 at 21:34 vote accept Brett Berger
Aug 3, 2022 at 21:34 answer added Brett Berger timeline score: 3
Jul 8, 2018 at 21:31 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Jun 8, 2018 at 6:28 answer added Brett Berger timeline score: 2
May 21, 2018 at 6:34 history edited Brett Berger CC BY-SA 4.0
added 5 characters in body
May 21, 2018 at 6:15 history edited Brett Berger CC BY-SA 4.0
added 170 characters in body
May 21, 2018 at 0:06 history edited Brett Berger CC BY-SA 4.0
added 19 characters in body
May 20, 2018 at 23:32 history edited Brett Berger CC BY-SA 4.0
added explicit example of large probably-solution pair
May 20, 2018 at 23:07 comment added Brett Berger I have looked at the van Ditmarsch papers, though not though all the references they list. They use a similar algorithm to the one I give here to list solutions, though there is no talk of the generalization to arbitrary upper bound. The only claim I have seen regarding classifying all pairs of solutions was the one made by Born-Hurkens-Woeginger conjecturing there were infinitely many (a conjecture which I feel I am near proving false)
May 20, 2018 at 22:49 comment added Gerry Myerson So, was there anything useful in those references?
May 20, 2018 at 20:12 history edited Brett Berger CC BY-SA 4.0
added 4 characters in body
May 20, 2018 at 19:58 history edited Brett Berger CC BY-SA 4.0
Included a question in the new section
May 20, 2018 at 19:51 history edited Brett Berger CC BY-SA 4.0
Included a question in the new section
May 20, 2018 at 19:26 history edited Brett Berger CC BY-SA 4.0
Added section on arithmetic progressions with low values of F
May 18, 2018 at 6:39 history edited Martin Sleziak CC BY-SA 4.0
added Wikipedia link
May 18, 2018 at 6:33 history edited Brett Berger CC BY-SA 4.0
Added asymptotic analysis of F(s).
May 15, 2018 at 2:44 history edited Brett Berger CC BY-SA 4.0
Updated research regarding pairs of the form $(2^k, 3^l)$
May 13, 2018 at 23:12 comment added Gerry Myerson One more reference: MR2435478 (2010d:03027) van Ditmarsch, H. P.; Ruan, J.; Verbrugge, R. Sum and product in dynamic epistemic logic. J. Logic Comput. 18 (2008), no. 4, 563–588. This one has a review. There are also some links at en.wikipedia.org/wiki/Sum_and_Product_Puzzle
May 13, 2018 at 23:06 comment added Gerry Myerson Curiously, only the first of the three Born-Hurkens-Woeginger papers has been reviewed in Math Reviews (the other two have been "indexed"), and no links are given to other papers, and nothing else shows up on searching for "Freudenthal problem". Searching for "sum and product puzzle" leads to one more paper, also indexed: MR2583039 van Ditmarsch, Hans; van Eijck, Jan; Verbrugge, Rineke Public works: Freudenthal's sum and product puzzle. Nieuw Arch. Wiskd. (5) 10 (2009), no. 2, 126–131.
May 13, 2018 at 17:04 history edited Brett Berger CC BY-SA 4.0
Changed a redundant variable name, added improved bound.
May 13, 2018 at 0:46 review First posts
May 13, 2018 at 1:00
May 13, 2018 at 0:44 history asked Brett Berger CC BY-SA 4.0