mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 96
Search took 0.02 seconds.
Search: Posts Made By: uau
Forum: Puzzles 2021-06-05, 18:42
Replies: 20
Views: 918
Posted By uau
It occurred to me that you can also get...

It occurred to me that you can also get O(n*log(n)) by kind of the opposite strategy: instead of proving for one element at a time what its correct value must be, you can also collect permutations...
Forum: Puzzles 2021-06-03, 00:03
Replies: 20
Views: 918
Posted By uau
I'm pretty sure O(n*log(n)) is possible on...

I'm pretty sure O(n*log(n)) is possible on average. For that it's enough that you can find a single correct position in O(log(n)) tries on average, and then repeat that for the remaining problem of...
Forum: Puzzles 2021-06-02, 22:54
Replies: 20
Views: 918
Posted By uau
By "bisection strategy", I meant something like...

By "bisection strategy", I meant something like trying to rotate large blocks of guesses (if your permutation was 012345, rotating 3 first gets 120345). If the block was originally all correct, it's...
Forum: Puzzles 2021-06-02, 21:32
Replies: 20
Views: 918
Posted By uau
Trying something that could be the correct answer...

Trying something that could be the correct answer given all previous ones (which I believe is what Walter's code does) is not always the optimal answer, either for average or worst-case behavior (at...
Forum: Puzzles 2021-06-02, 21:14
Replies: 20
Views: 918
Posted By uau
I'm not familiar with docplex which seems to be...

I'm not familiar with docplex which seems to be what the code uses to generate the specific guesses, but it seems like it probably just chooses some arbitrary permutation which has the given number...
Forum: Puzzles 2021-06-02, 00:50
Replies: 5
Views: 225
Posted By uau
The second required property is completely...

The second required property is completely meaningless as currently phrased. I assume it should say the numbers have to be at least 2.
Forum: Puzzles 2021-05-04, 22:37
Replies: 25
Views: 2,288
Posted By uau
Here's my solution. Just pretty straightforward...

Here's my solution. Just pretty straightforward brute force - enough for the sizes asked for in the question.

The program takes the size as input, so calling it with an argument of "7" gives the...
Forum: Puzzles 2021-05-04, 16:45
Replies: 17
Views: 2,298
Posted By uau
The sentence "Our goal is to see how to generate...

The sentence "Our goal is to see how to generate a Fibonacci-like sequence without any prime numbers." would make more sense if it ruled out the obvious and trivial common factors solution. But I...
Forum: Puzzles 2021-04-04, 15:28
Replies: 25
Views: 2,288
Posted By uau
From the example it seems clear that the intended...

From the example it seems clear that the intended meaning is that the arrow moves clockwise around the wheel.
Those refer to different things with "step".
I'm pretty sure the intended meaning is...
Forum: Puzzles 2021-02-04, 20:26
Replies: 36
Views: 5,036
Posted By uau
Solution was published, and shows that they...

Solution was published, and shows that they didn't know an answer or have a guarantee it exists...
Forum: Puzzles 2021-01-14, 00:09
Replies: 13
Views: 1,650
Posted By uau
I think the most reasonable interpretation is...

I think the most reasonable interpretation is that you have two special nodes, and then ask what resistances you can construct between them.
Forum: Puzzles 2021-01-10, 15:35
Replies: 21
Views: 3,088
Posted By uau
Adding my solution here since the month is over: ...

Adding my solution here since the month is over:

This was quite an easy problem, with a straightforward solution that requires no programming either.

That each state is between 100 and 150...
Forum: Puzzles 2021-01-07, 16:23
Replies: 13
Views: 1,974
Posted By uau
That is not true. The second paragraph of...

That is not true. The second paragraph of charybdis's post was the other direction.
Forum: Puzzles 2021-01-05, 00:12
Replies: 13
Views: 1,974
Posted By uau
The cancellation trick is nice and gives a short...

The cancellation trick is nice and gives a short solution to most of the problem. I think the other case is a bit simpler without reducing to that though:

That is, the sum is always the mean of...
Forum: Puzzles 2021-01-04, 14:16
Replies: 36
Views: 5,036
Posted By uau
How do you know that? The "hint" doesn't...

How do you know that?

The "hint" doesn't seem to say anything - it's basically what I'd expect to be the case IF some N requires 3 or more bots, but I see no hint there WHY you'd expect some case...
Forum: Puzzles 2021-01-04, 03:25
Replies: 36
Views: 5,036
Posted By uau
I wonder whether an answer to the ** bonus...

I wonder whether an answer to the ** bonus question is actually known by the problem setters or guaranteed to exist?
Forum: Puzzles 2020-12-24, 22:28
Replies: 11
Views: 2,064
Posted By uau
I don't think there is anything particularly...

I don't think there is anything particularly paradoxical here. This is not a zero-sum game unless x = 1/2. It's not surprising that changes which result in player 2 switching strategy may help player...
Forum: Puzzles 2020-10-08, 19:45
Replies: 33
Views: 11,342
Posted By uau
I haven't tried to construct a maximal number of...

I haven't tried to construct a maximal number of automorphisms, but you should be able to get more than 17. Basic proof of concept: embed 3 RPS(3) games in the 17 such that each game wins/loses...
Forum: Puzzles 2020-10-06, 19:10
Replies: 33
Views: 11,342
Posted By uau
By the way, for the bonus question this follows...

By the way, for the bonus question this follows from a more obviously reasonable assumption: that for any pair of vertices, there exists an automorphism mapping one to the other. Or in other words,...
Forum: Puzzles 2020-10-06, 15:31
Replies: 33
Views: 11,342
Posted By uau
Although I first solved the bonus problem...

Although I first solved the bonus problem differently, I think the simplest way to arrive at the solution is similar to what Oscar said - consider graphs where the elements are numbers mod 11 where...
Forum: Puzzles 2020-10-05, 19:22
Replies: 34
Views: 7,118
Posted By uau
I interpreted it as creating the control-flow...

I interpreted it as creating the control-flow graph based only on the existence of jump commands, so it does not depend on values of a and b. Actual behavior of the program will depend on those, but...
Forum: Puzzles 2020-10-01, 13:28
Replies: 34
Views: 7,118
Posted By uau
The control graph example image at the end...

The control graph example image at the end ("Here's a sample program, along with its control-flow graph:") doesn't seem to load.
Forum: Puzzles 2020-09-01, 15:27
Replies: 33
Views: 11,342
Posted By uau
Isn't this just the same issue as with the first...

Isn't this just the same issue as with the first example, in that it doesn't seem to match the obvious assignment of numbers to names (rock=0, paper=1, scissors=2)? Both have "0 beats 1" while...
Forum: Puzzles 2020-08-05, 22:38
Replies: 28
Views: 12,623
Posted By uau
Yes I got that part, what I meant to ask was what...

Yes I got that part, what I meant to ask was what the "reached 111.181 set bits" was measuring - in context it first seemed to be about the N*m thing, but then your algorithm was about something...
Forum: Puzzles 2020-08-05, 21:53
Replies: 28
Views: 12,623
Posted By uau
Hmm what do you mean by bit count here? Are you...

Hmm what do you mean by bit count here? Are you talking about the same thing (number of 1 bits in N*m for some integer m)? The algorithm you describe seems to be about computing x^N mod M more...
Showing results 1 to 25 of 96

 
All times are UTC. The time now is 17:26.

Sat Jun 12 17:26:30 UTC 2021 up 15 days, 15:13, 0 users, load averages: 1.77, 1.79, 1.79

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.