Skip to main content

All Questions

0 votes
0 answers
161 views

1v1v1 Round Robin Schedule; How many possibilities? How to generate?

I am trying to create a round-robin bracket generator for a game where each match contains three teams competing against each other (1v1v1) given the teams, rounds, and rooms in Python. I don't ...
Jon's user avatar
  • 1
-1 votes
1 answer
59 views

Is there an efficient way to loop through this problem? [closed]

So I saw this very interesting problem. Let's say you have a length of 2, and a base length of 5 l = 2, b = 5 this would be translated to : ...
gushkash's user avatar
0 votes
4 answers
190 views

Get all the methods to break 100% into certain number of parts?

Being straight about the question, for a program I'm writing, I need to divide 100% into 5 parts. In my program, percentages incremented/decremented by 10%. So I can express my requirement in the ...
cipherdragon's user avatar
1 vote
0 answers
30 views

Can we find a proper $\phi$ so that maps each interval to its center?

For a compact interval $[0,1]$, we divide it into $N^{1/3}$ subintervals with length $N^{-1/3}$. Define a map $\phi: [0,1]\mapsto [0,1]$ maps each subintervals to its center. For example, let $X\sim ...
Hermi's user avatar
  • 1,524
1 vote
0 answers
42 views

Algorithm to compute monomial coefficients from Vieta's Formulas

Let's say I know the $N$ roots $\boldsymbol r$ of a polynomial $p_N(x)$ and I want to compute the coefficients $\boldsymbol \alpha $ of the representation in monomials, i.e., $$p_N(x) = \sum_{j=0}^N \...
Dan Doe's user avatar
  • 2,264
0 votes
2 answers
575 views

Algorithm to derive possible combinations of a set e.g., $A = [1, 2, 3, 4]$ and $k = 3$ and $L = [[1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]]$

Given a set of numbers A and an integer k, I want to derive a list of sets L such that all the sets in L are the distinct combinations of the elements in A picking k at a time. For example: $A = \{1, ...
Isaac Dzikum's user avatar
0 votes
1 answer
53 views

Optimal Card Game Schedule

I have the responsibility of creating a schedule for a card game league. While creating the schedule, the following problem has arisen... Let $n,g,s \in \mathbb{N+}$ where $s \leq n$. Let $P = \{1, 2, ...
c.abate's user avatar
  • 213
1 vote
2 answers
71 views

Looking for an algorithm

I have a very long "list" of numbers ( maybe thousands ) which may be grouped, by sum into "n" groups. The number of groups and values are given. For example: List of numbers: [1, ...
Doktop Aibolit's user avatar
1 vote
0 answers
55 views

How do I find unique rearrangements when given items & the item distributions?

I'm not sure what this type of question is called, but this what I'm trying to solve: I own 3 hats 1 hat is red 2 hats are blue 4 shirts 1 shirt is red 1 shirt is blue 2 shirts are green 5 pairs ...
anboio's user avatar
  • 19
1 vote
0 answers
34 views

How many variatons of winners are there in 15 1vs1 matchs

I am trying to find a program or some way to show me every variation of winners from just 5 matchs of 1vs1. I think there should be 900 variation i just need a way to see it all written down .. For ...
Steve's user avatar
  • 11
6 votes
1 answer
317 views

Math behind this SQL problem

I have the following 'sorted by row' lists (2nd column), in which every row produces an output (3rd column, and 4th column). This output has been found without using formulas and it represents a ...
user1630809's user avatar
4 votes
0 answers
159 views

Finding simple algorithm to combine students into different groups

I'd like to find an algorithm as simple as possible to solve the problem below. The same seven students will each day be divided and meet into two groups, one with four students and one with three. ...
Zoe's user avatar
  • 41
0 votes
0 answers
139 views

Arranging 3 types of balls with given conditions.

There are 3 types of balls black, white and green. Find the number of ways of arranging $n$ such balls such that black, white adjacent pairs occur $a$ times, black, green adjacent pairs occur $b$ ...
Manjesh Jain's user avatar
0 votes
1 answer
106 views

Efficiently modify the combined probability of many independent events when variable values change

Question: Let $C_1$ and $C_2$ be two events that are independent and not mutually exclusive that occur with different probabilities $p_1$ and $p_2$. For these two events, I understand that: $$ P(C_1 \...
flow's user avatar
  • 31
6 votes
4 answers
3k views

What's the number of decibinary numbers that evaluate to given decimal number?

Let's define a decibinary number system, where each bit (or digit) can range from $0$ to $9$, but it's place value corresponds to the one in the binary system. For example: $$(2020)_{decibinary} = 2 \...
Tomasz Bartkowiak's user avatar

15 30 50 per page