James33
-
Posts
38 -
Joined
-
Last visited
-
Days Won
1
Content Type
Profiles
Forums
Events
Gallery
Blogs
Everything posted by James33
-
-
I think the answer will be the same as the maximum.
-
True, I was just giving an outline of what I would do because I don't think it is what the OP as it has no upper bound on time taken.
-
I don't think that the logic there quite works. Certain results could be ignored (conditional on what has been generated) to make everything divisible by 3.
-
By not run forever, do you mean that we must be able to fix a time at which the algorithm will certainly have terminated by? If you mean that it just has to end at some point then
-
What shape is the moat? Does it have to be a straight line? Can it vary in width? If it can be any shape, just choose a moat in the shape of a very pointy arrow and cross over at the point using 1 board.
-
What are we supposed to do? Or is that part of the problem? My guess is 3.
-
I'm tired so my reasoning is probably flawed:
-
Just visualising it, won't there be multiple valid answers?
-
-
-
Playing with infinity: the basketball, part 2 (part 1 solved)
James33 replied to bonanova's question in New Logic/Math Puzzles
-
Playing with infinity: the basketball, part 2 (part 1 solved)
James33 replied to bonanova's question in New Logic/Math Puzzles
-
Playing with infinity: pairing integers with the real numbers
James33 replied to bonanova's question in New Logic/Math Puzzles
-
-
-
I think the OP means that f^-1(x)=1/f(x).
-
-
-
THis cannot be possible, if there are 2 responses you can at most reduce it down to 2 of the 3 possible answers.
-
(a+b)(a-b)=a(a-b)+b(a-b)=a^2-ab+ba-b^2=a^2-b^2
-
-
-
Thought about it some more I I think I have an algorithm that would do it more efficiantly
-
