mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 79 Search took 0.01 seconds. Search: Posts Made By: uau
 Forum: Puzzles 2020-10-08, 19:45 Replies: 33 Views: 3,893 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: 3,893 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: 3,893 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: 2,545 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: 2,545 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: 3,893 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: 3,607 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: 3,607 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: 3,607 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: 3,836 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: 1,542 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: 1,542 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: 1,542 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: 3,836 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: 8,004 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: 3,836 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...
 Forum: Puzzles 2020-06-01, 13:44 Replies: 16 Views: 3,836 Posted By uau Has anyone been able to solve this? I wrote a... Has anyone been able to solve this? I wrote a program to find all numbers with the given number of relative primes, but found no exact match for the divisor sum among those. Closest I got to the...
 Forum: Puzzles 2020-04-14, 16:40 Replies: 44 Views: 8,004 Posted By uau Anyone have an idea what the newly added bonus... Anyone have an idea what the newly added bonus thing means? It says: "even closer"? What does that mean? Only one person has '**'; with the limited space for potential solutions, it doesn't seem...
 Forum: Puzzles 2020-04-02, 02:10 Replies: 44 Views: 8,004 Posted By uau Well if you assume an unlabeled graph, you could... Well if you assume an unlabeled graph, you could label it arbitrarily. But the adjacency matrix necessarily implies an ordering of the graph nodes. So I interpreted it as: "find an adjacency matrix...
 Forum: Puzzles 2020-04-01, 23:44 Replies: 44 Views: 8,004 Posted By uau I think the initial conditions are the only... I think the initial conditions are the only particularly unclear part. I assumed that the first person (corresponding to the first row of the adjacency matrix) is always the only person infected at...
 Forum: Puzzles 2020-04-01, 22:12 Replies: 44 Views: 8,004 Posted By uau Yes, my calculations match the provided answer... Yes, my calculations match the provided answer for the example graph.
 Forum: Puzzles 2019-12-04, 20:32 Replies: 59 Views: 12,118 Posted By uau Did I misunderstand something about the... Did I misunderstand something about the challenge/example? I thought the error would be calculated as half (due to interval length 2) of: sage: integral( (abs(x) - (x+1)/2)^2, (x, -1, 1)) 1/3...
 Forum: Puzzles 2019-12-04, 16:17 Replies: 89 Views: 12,951 Posted By uau I was actually considering a similar approach,... I was actually considering a similar approach, but never got around to implementing it. The basics of it are actually simple if you consider calculating the determinant by making an orthogonal...
 Forum: Puzzles 2019-12-04, 14:29 Replies: 89 Views: 12,951 Posted By uau The results don't tell that. Stars can be added... The results don't tell that. Stars can be added to names later, and the timestamp is not changed. So if you submit the worst possible passable solution at the start of the challenge, and improve it...
 Forum: Puzzles 2019-11-27, 20:30 Replies: 89 Views: 12,951 Posted By uau There was a comment from the puzzle author that... There was a comment from the puzzle author that it was not enough to get the award for best solution found.
 Showing results 1 to 25 of 79

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

Fri Nov 27 07:43:49 UTC 2020 up 78 days, 4:54, 4 users, load averages: 1.58, 1.29, 1.18

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.