Ondrej Sotolar
Reputation
208
Next privilege 250 Rep.
View close votes
Badges
1 8
Newest
Impact
~5k people reached

• 0 posts edited
• 0 helpful flags
• 10 votes cast

# 54 Actions

 Nov 15 awarded Popular Question Jun 9 awarded Popular Question Jul 2 awarded Curious Jan 30 awarded Yearling May 22 accepted Rejection region in hypothesis testing using Students t-test May 21 revised Rejection region in hypothesis testing using Students t-test edited body May 21 asked Rejection region in hypothesis testing using Students t-test Dec 18 accepted Combinatorics question concerning two square-board game pieces Dec 17 comment Combinatorics question concerning two square-board game pieces You are correct, I guess I will have to practice precission :) Can you by any chance determine the number of paths for any n? Dec 17 comment Combinatorics question concerning two square-board game pieces You are right, the number of possibilities should always be 2^(2n), which would correspond for n=3 to 64. Dec 17 comment Combinatorics question concerning two square-board game pieces So the number of possibilities is always 2^(2n)? That would be agreable.. but what about the number of the desired paths (numerator)? Dec 17 comment Combinatorics question concerning two square-board game pieces well yes, thats the number of possible paths in the original problem. but after setting white stationary and allowing only connected 2n length paths from black to white, we get only the numbers above. To return to the original problem, how do I find what is the n-th element paths ammount? Please don't give up on me, I sometimes take longer to understand things ;) Dec 17 comment Combinatorics question concerning two square-board game pieces I think there is more than the amount of 2n-length paths composed of (n-length path)+(reversed n-length path) paths Dec 17 comment Combinatorics question concerning two square-board game pieces for n=0 : 1/1, for n=1 : 2/2, for n=2 : 6/8 ... is that what you meant? Dec 17 revised Combinatorics question concerning two square-board game pieces deleted 2 characters in body Dec 17 comment Combinatorics question concerning two square-board game pieces I'm afraid I don't see the difference, because the paths running through [n,n] must fulfill the same conditions: the length n-1 and they must start and finish in the corners. Dec 17 asked Combinatorics question concerning two square-board game pieces Dec 5 comment Comparing the number of cuts and paths in graph Sure, but neither flow nor edge value is relevant. Dec 5 asked Comparing the number of cuts and paths in graph Oct 17 asked Explicit function of a cylinder