mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Puzzles (https://www.mersenneforum.org/forumdisplay.php?f=18)
-   -   January 2019 (https://www.mersenneforum.org/showthread.php?t=23947)

a1call 2018-12-31 00:02

[QUOTE=SmartMersenne;504432]1 is NOT a prime by definition. The smallest prime is 2.

So primes are NOT a product of distinct primes, because a product is defined by at least 2 terms.[/QUOTE]

I agree with you, but like I said there are those who consider a product with no factors a valid function just because the infallible Wikipedia has an article about it::smile:

[url]https://en.wikipedia.org/wiki/Empty_product[/url]

SmartMersenne 2018-12-31 00:10

[QUOTE=a1call;504434]I agree with you, but like I said there are those who consider a product with no factors a valid function just because the infallible Wikipedia has an article about it::smile:

[url]https://en.wikipedia.org/wiki/Empty_product[/url][/QUOTE]

[URL="https://www.google.com/search?ei=qlgpXIf_Fr7L0PEP0JGEmAo&q=if+it%27s+on+the+internet+it+must+be+true+meme&oq=+%22If+it+is+on+the+internet%2C+it+must+be+true%22&gs_l=psy-ab.1.1.0i22i30l5.1330891.1330891..1339030...0.0..0.97.97.1......0....1j2..gws-wiz.......0i71.VVRWKY99BK4"]"If it is on the internet, it must be true"[/URL] :smile:

Yes but we are talking about at least one term here.

a1call 2018-12-31 00:38

[QUOTE=SmartMersenne;504435][URL="https://www.google.com/search?ei=qlgpXIf_Fr7L0PEP0JGEmAo&q=if+it%27s+on+the+internet+it+must+be+true+meme&oq=+%22If+it+is+on+the+internet%2C+it+must+be+true%22&gs_l=psy-ab.1.1.0i22i30l5.1330891.1330891..1339030...0.0..0.97.97.1......0....1j2..gws-wiz.......0i71.VVRWKY99BK4"]"If it is on the internet, it must be true"[/URL] :smile:

Yes but we are talking about at least one term here.[/QUOTE]
It is not much of a stretch to go from a product with no factors being a valid function to one with one factor being valid as well.
Please see post number 6 above.
Regardless of if we accept the convention to be valid or not, the ambiguity of the challenge at not clarifying the concept of product-of-distinct-prime makes the challenge problematic.
We are left to guessing what the "Puzzle-Master" considers a valid convention.

Dr Sardonicus 2018-12-31 01:54

Between the example and the requirement that a play actually does something, there seems to be no difficulty understanding which divisors are allowed. It could have been stated more precisely, but the cavils of the willfully obtuse are probably not a major concern of the folks writing these problems.

There does however appear to be a grammatical oopsadaisy. I believe the last comma in the statement of the problem is misplaced. It should be moved one word to the right, from after "numbers" to after "each."

a1call 2018-12-31 02:08

[QUOTE=Dr Sardonicus;504442]Between the example and the requirement that a play actually does something, there seems to be no difficulty understanding which divisors are allowed. It could have been stated more precisely, but the cavils of the willfully obtuse are probably not a major concern of the folks writing these problems.

There does however appear to be a grammatical oopsadaisy. I believe the last comma in the statement of the problem is misplaced. It should be moved one word to the right, from after "numbers" to after "each."[/QUOTE]

Right, some of us are just glass is Half-Full type of people by nature. Aren't we now?

:blahblah:

SmartMersenne 2018-12-31 02:21

[QUOTE=a1call;504437]It is not much of a stretch to go from a product with no factors being a valid function to one with one factor being valid as well.
Please see post number 6 above.
Regardless of if we accept the convention to be valid or not, the ambiguity of the challenge at not clarifying the concept of product-of-distinct-prime makes the challenge problematic.
We are left to guessing what the "Puzzle-Master" considers a valid convention.[/QUOTE]

The solution won't change in either case. Players can use a single prime.

In the case of allowing a product with no terms: that would get the game into an infinite loop. And if people can't see it, their program will get into an infinite loop, so I would like to see how they will solve it. :smile:

Dr Sardonicus 2018-12-31 15:29

The set B in the example (but not the set A) can easily be expanded to four positive integers. Not that this is of any use in solving the problem, of course...

SmartMersenne 2018-12-31 22:08

[QUOTE=Dr Sardonicus;504471]The set B in the example (but not the set A) can easily be expanded to four positive integers. Not that this is of any use in solving the problem, of course...[/QUOTE]

Care to elaborate?

science_man_88 2019-01-01 03:33

[QUOTE=Dr Sardonicus;504471]The set B in the example (but not the set A) can easily be expanded to four positive integers. Not that this is of any use in solving the problem, of course...[/QUOTE]

neither does the fact that all sums must not be squarefree. BTW a1call here's the puzzlemasters reply:

[QUOTE]I meant one or more primes; will update the site. [/QUOTE]

Dr Sardonicus 2019-01-01 15:03

[QUOTE=SmartMersenne;504538][QUOTE=Dr Sardonicus;504471]The set B in the example (but not the set A) can easily be expanded to four positive integers. Not that this is of any use in solving the problem, of course...[/QUOTE]
Care to elaborate?[/QUOTE]
A = {3,99}, B = (1,22,97,526}

a1call 2019-01-01 17:59

It is quite an interesting challenge.
I have tens of glasses which are 15/16 full but I am quite peptomestic about filling the last 1/16 of any of them.:smile:
One interesting aspect is that the square root of the sums seem to form in interesting and different patterns.
Many are symmetrical around a 45° diagonal.
Others form a row of primes then primesx2 then semi-primes then semi-primesx2 and other patterns as well.
And of course my posts would not be complete without a few painfully annoying nags to some:
The challenge does not define any rules regarding repeating terms within/between the two sets A & B. Without such clarifications many trivial solutions can be found.


All times are UTC. The time now is 07:24.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.