mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Puzzles (https://www.mersenneforum.org/forumdisplay.php?f=18)

 SmartMersenne 2019-01-01 23:33

[QUOTE=a1call;504604]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.[/QUOTE]

Yup: A=[3, 99, 3, 99] B=[1, 22, 1, 22]

 Dr Sardonicus 2019-01-02 00:46

[QUOTE=SmartMersenne;504630]Yup: A=[3, 99, 3, 99] B=[1, 22, 1, 22][/QUOTE]
AFAIK there is no such thing as repetition of elements in a [i]set[/i]. A set is not the same thing as an ordered tuple.

The two sets need not be disjoint, however. Clearly, adding a number to all the elements of one set, and subtracting it from all the elements of the other, creates two sets giving the same sums. So instead of [1,22] and [3,99] we could take [2,23] and [2,98].

 a1call 2019-01-02 00:58

[QUOTE]
In mathematics, a set is a collection of distinct objects,
[/QUOTE]

[url]https://en.wikipedia.org/wiki/Set_(mathematics[/url])

Thank you for the correction.:smile:

 science_man_88 2019-01-02 01:08

[QUOTE=Dr Sardonicus;504636]AFAIK there is no such thing as repetition of elements in a [i]set[/i]. A set is not the same thing as an ordered tuple.

The two sets need not be disjoint, however. Clearly, adding a number to all the elements of one set, and subtracting it from all the elements of the other, creates two sets giving the same sums. So instead of [1,22] and [3,99] we could take [2,23] and [2,98].[/QUOTE]

multiset is the term for an object like a set, but with multiplicities. the sums need all be squares, and since squares are 0 or 1 mod 4 , any term in A that is 2 mod 4 forces the elements of B to all be 2 or 3 mod 4. presence of an element that is 1 mod 4 forces the opposite set to all be 0 or 3 mod 4. 3 mod 4 forces all elements of the opposite set to be 1 or 2 mod 4. and 0 mod 4 forces 0 or 1 mod 4. mod 9 all squares are 0,1,4, or 7. etc. anyways time to use forpart ( or setbinop etc doh )and forsubset to try my hand at coding it.

 Kebbaj 2019-01-03 18:58

triplet with a pair

Until now, i only have a triplet with a pair :

A = {22, 97, 526}; B = {3, 99};

22 + 3 = 25 Factor {{5^2}}

22 + 99 = 121 Factor {{11^2}}

97 + 3 = 100 Factor {{2^2},{5^2}}

97 + 99 = 196 Factor {{2^2},{7^2}}

526 + 3 = 529 Factor {{23^2}}

526 + 99 = 625 Factor {{5^4}}

 Kebbaj 2019-01-03 19:31

it is going well

it is going well: quadriplet with pair:

B = {3, 99, 4803, 45699} ; A = {97, 526};

 LaurV 2019-01-04 05:57

[QUOTE=a1call;504402]What exactly are you referring to when you say false?
He refers to the fact that if you don't have the restriction of distinct primes, then Alice (the first choicer) wins every time by dividing with the number itself.

25 -> 1
100 -> 1
etc.

This problem has not much to program, is pure math, and quite simple actually.[SPOILER] As said above, N must always be a perfect square. The sums can not be square free, because Alice would win in one shot, picking the whole number as the first divisor, and they can't be non-squares, because then Alice will chose the first time in such a way to leave a perfect square, and she wins. For example, if \(N=2^a3^b5^c...\) then Alice picks first time the product of all primes which have the odd power, and then what is left is a perfect square. Now, the only left for you is to prove that if the number is perfect square, then Bob (the second picker) wins every time. There is a theorem which states that the only numbers with an odd number of divisors are the perfect squares (why? and why do you need an odd number of divisors?) anyhow this is not complicate to prove, but you don't need to go so deep, because there is a simple strategy to win: if N is perfect square, then any prime in N has its pair, and all Bob has to do is to pick the same product Alice picks, every time, leaving every time behind a perfect square. Start with a perfect square, end with a smaller perfect square, repeat. This ends in 1, and it is the "infinite descent" method, invented by Fermat, hehe - as members of mersenneforum, you should know that :razz:

So, all the fuss is about finding two sets of numbers whose paired sums are always perfect squares. How difficult is that? (from the number of the persons who already solved the puzzle in just few hours, and from this current thread, you can see that the puzzle is trivial - so this is another skip this month).[/SPOILER]

 a1call 2019-01-04 06:38

And how does any of that have to do with the text that he quoted from me and labeled as false?
Where is exactly the error in my post?
Please make a direct reference to the false statement.
Thanks.

 LaurV 2019-01-04 07:17

[QUOTE=a1call;504390]Are primes products of distinct primes?
I would say not, but know of Wikipedia worshippers which would disagree.[/QUOTE]

Your posts are generally just bullshit, insinuations, insulting the intelligence of the audience, and blah blah blah, so I do not read them in detail anymore, for long time. Generally, primes are primes, can not be composite (i.e. product of primes), and well, even if you reformulated in the next post, to use Title case, which makes more sense (as the "set" of divisors, but is is still extremely odd to call them Primes, as they are mostly composite). However, we can satisfy you this time, with the exact stupidity that you say:

[QUOTE=a1call;504393]
Else if Primes [U]are-not[/U] [B]products [/B]of distinct primes then:
4, 25 and 121[COLOR=Red] have no winners[/COLOR][/QUOTE]

Oh? How come? I just said how Alice wins in this case...

 axn 2019-01-04 07:42

[QUOTE=LaurV;504877]Oh? How come? I just said how Alice wins in this case...[/QUOTE]

As I understand it, the sticking point for a1call is the "[B]product[/B] of distinct primes" bit. According to him, a single prime is not a product -- there should be at least two.

EDIT:- Looks like they have updated "divides N by any divisor that is either a prime or a product of distinct prime numbers". That should take care of that.

 science_man_88 2019-01-04 09:49

[QUOTE=axn;504884]EDIT:- Looks like they have updated "divides N by any divisor that is either a prime or a product of distinct prime numbers". That should take care of that.[/QUOTE]

yeah I contacted the puzzlemaster and posted the response in this thread.

All times are UTC. The time now is 09:06.