Matt

MathWorks

Last seen: 1年以上前 | 2022 年からアクティブ

Followers: 0 Following: 0

統計

Feeds

解決済み

N-th permutation.
Let write some permutations of positive integers. 1: 1 2 3 4 5 6 ... 2: 2 1 3 4 ... 3: 1 3 2 4 ... ...

2年弱前

解決済み

Which permutation is it?
Let write some permutations of positive integers. 1: 1 2 3 4 5 6 ... 2: 2 1 3 4 ... 3: 1 3 2 4 ....

2年弱前

解決済み

Possible Outcomes of American Roulette
The payout for American roulette can be calculated by: payout = (38/n)-1 where n is the number of squares the bet covers. ...

2年弱前

解決済み

A (wrong) place for everything, and everything in its (wrong) place
You have an equal number of cups and balls, each labelled from one to N. You randomly place one ball in each cup. Determine th...

2年弱前

解決済み

Numbered lottery balls into cells
You are running a lottery, and have a number of different balls numbered 1 to N. Your job is to figure out how many different w...

2年弱前

解決済み

Put m balls into n boxes (again)
According to <http://www.mathworks.com/matlabcentral/cody/problems/1516-put-m-balls-into-n-boxes Cody Problem 1516>, if I put 3 ...

2年弱前

解決済み

Put m balls into n boxes
Can you find all the cases where, if I put 3 balls into 2 boxes the case is 1 1 1 1 1 2 1...

2年弱前

解決済み

Get ranking of a combination looking for speed.
I have the numbers pulled without replacement from the set [1 2 3 4 5 6 7 8 9 10 11 12 13]; They are then ordered from least to...

2年弱前

解決済み

Get ranking of a combination
I have the numbers pulled without replacement from the set [1 2 3 4 5 6 7 8 9 10 11 12 13]; They are then ordered from least to...

2年弱前

解決済み

Usage of java.math : N Choose K with unlimited precision
Calculate the binomial coefficient nchoosek with full accuracy. This challenge may use the wonderful word of java.math that allo...

2年弱前

解決済み

Next lexicographic - permutation
Find next lexicographic - permutation (permutations as it would occur in a dictionary order). E.g: nextP('ABCD') = ABDC If you...

2年弱前

解決済み

Find Logic 7

2年弱前

解決済み

Find Logic 8

2年弱前

解決済み

Find Logic 10

2年弱前

解決済み

Find Logic 11

2年弱前

解決済み

Find Logic 12

2年弱前

解決済み

Find Logic 13

2年弱前

解決済み

Find Logic 15

2年弱前

解決済み

Find Logic 14

2年弱前

解決済み

Find Logic 16

2年弱前

解決済み

Find Logic 17

2年弱前

解決済み

Find Logic 18

2年弱前

解決済み

Find Logic 19

2年弱前

解決済み

Project Euler: Problem 8, Find largest product in a large string of numbers
Find the greatest product of five consecutive digits in an n-digit number. 73167176531330624919225119674426574742355349194934...

2年弱前

解決済み

NCHOOSEK - Time Optimization
*Input* * *V* —— Set of all choices, a vector of N, 1 < N < 100 * *K* —— Number of selected choices, a scalar, 0 <= K <=...

2年弱前

解決済み

Combinations without using nchoosek
You have to generate a matrix with all possible combinations of n elements *taken 2* at a time, *without using nchoosek(1:n,2)* ...

2年弱前

解決済み

Create Combination
Motivation: In many problems, we need to create combinations with the function nchoosek. In some cases, however, choices are lim...

2年弱前

解決済み

Repopulate the City
For any population p of positive integers between pmin and pmax, we can calculate histogram count n for a list of evenly dividin...

2年弱前

解決済み

Project Euler: Problem 5, Smallest multiple
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smalle...

2年弱前

解決済み

Project Euler: Problem 3, Largest prime factor
The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number being input, input might be ui...

2年弱前

さらに読み込む

Matt

MathWorks

統計

Combinatorics I Master

Cody

Promoter

Cody

Solver

Cody

Feeds