mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Search Today's Posts Mark Forums Read

Page 1 of 4 1 234
Showing results 1 to 25 of 88
Search took 0.02 seconds. Search: Posts Made By: uau
Forum: Puzzles 2021-04-04, 15:28
Replies: 19
Views: 1,000
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: 4,248
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,260
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: 2,500
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,459
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,459
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: 4,248
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: 4,248
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: 1,732
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: 9,658
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: 9,658
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: 9,658
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: 6,039
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: 6,039
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: 9,658
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: 10,113
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: 10,113
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...
Forum: Puzzles 2020-08-04, 15:07
Replies: 28
Views: 10,113
Posted By uau
I assume that half the bits are ones, so that's...

I assume that half the bits are ones, so that's about equivalent to length of the number x being 1.44N bits, or log(x) = 1.44N*log(2) = N. The prime number theorem says the sum of log(p) for primes p...
Forum: Puzzles 2020-07-05, 22:21
Replies: 16
Views: 8,900
Posted By uau
Here's the program I used: ...

Here's the program I used:



#!/usr/bin/python3

from gmpy2 import is_prime

def rec(n, target, used=set(), res=1, divsum=1, last1=None, last2=None):
if n == 1:
Forum: Puzzles 2020-06-21, 23:26
Replies: 7
Views: 3,712
Posted By uau
Separating the check per prime does sound like it...

Separating the check per prime does sound like it could give a speedup (current code calculates the discriminant and uses Sage's is_square()). But as you say, it feels pretty unlikely that there...
Forum: Puzzles 2020-06-21, 23:21
Replies: 7
Views: 3,712
Posted By uau
Here's a more reasonable way to search a fixed...

Here's a more reasonable way to search a fixed base for solutions (seems to be about ten thousand times as fast as your code):

base = 904
p = [i**i for i in range(base)]
d = {pi-i:i for i, pi in...
Forum: Puzzles 2020-06-21, 16:19
Replies: 7
Views: 3,712
Posted By uau
No larger solutions with less than 1000 base-10...

No larger solutions with less than 1000 base-10 digits. Given the three digits, you can solve for base as a second-degree polynomial. I checked that all triples with largest digit in [8, 400[ give...
Forum: Puzzles 2020-06-06, 23:32
Replies: 16
Views: 8,900
Posted By uau
Was due to a bug causing the program to skip some...

Was due to a bug causing the program to skip some values.
Forum: Puzzles 2020-06-03, 21:16
Replies: 44
Views: 17,470
Posted By uau
Here's the first version of the code I used for...

Here's the first version of the code I used for the challenge (original 10 days before the correction to 19):
#!/usr/bin/python3

import numpy as np
import itertools
import sys

def calc(adj):...
Forum: Puzzles 2020-06-01, 21:52
Replies: 16
Views: 8,900
Posted By uau
Not being a prime doesn't stop it from being...

Not being a prime doesn't stop it from being coprime to something else. gcd(x, 1)==1, so 1 is coprime to x, whatever x is.


But yeah 0 is not relevant, I wasn't really thinking when writing...
Showing results 1 to 25 of 88
Page 1 of 4 1 234

 
All times are UTC. The time now is 21:41.

Mon Apr 19 21:41:26 UTC 2021 up 11 days, 16:22, 0 users, load averages: 4.69, 4.99, 4.78

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.