Search found 4 matches

Tue Jan 31, 2017 2:58 am UTC
Forum: Mathematics
Topic: Combinatorics with constraint
Replies: 14
Views: 4489

Re: Combinatorics with constraint

for n=10, k=5, this works: 2 3 5 6 8 1 2 4 5 7 1 3 4 6 10 5 6 7 9 10 2 4 8 9 10 1 3 7 8 9 For more information, go to https://www.ccrwest.org/cover.html In particular the page https://www.ccrwest.org/cover/t_pages/t2/k10/C_50_10_2.html contains this: C(50,10,2) = 30 Created by Colin Barker Method of...
Fri Jan 27, 2012 3:22 am UTC
Forum: Coding
Topic: Closed form expression for this for loop?
Replies: 12
Views: 3597

Re: Closed form expression for this for loop?

[quote="Sagekilla"]I'm reading some code and there's this one loop that's really bothering me. for (int t = 0; t < n; t++) i += 1 + ((i + 1) % p == 0) ? p : 0; Where i, p, n are already provided. I feel like there should be a simpler way of writing this expression. If i = 0, then the loop ...
Sun Dec 20, 2009 8:40 pm UTC
Forum: Computer Science
Topic: what's the best way to do this? permuations.
Replies: 10
Views: 1931

Re: what's the best way to do this? permuations.

This is covered thoroughly in volume 4 of The Art of Computer Programming. If you want ready-made code to use or study, you can get it from the Combinatorial Object Server. (http://theory.cs.uvic.ca/inf/perm/PermInfo.html)
Sun Dec 13, 2009 10:39 pm UTC
Forum: Mathematics
Topic: So, I need a bit of help with regards to Graph Theory.
Replies: 5
Views: 877

Re: So, I need a bit of help with regards to Graph Theory.

What is this method of construction called? Is there a name for it?

It's a variation of vertex amalgamation / graph homomorphisms.