문제를 풀었습니다

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

거의 8년 전

문제를 풀었습니다

Percentage profit:5: Cumulative Interest
If a bank is giving r% yearly cumulative interest for deposit, how much profit we can get by keeping x amount of money for n mon...

거의 8년 전

문제를 풀었습니다

Product of two multivariate polynomials
MATLAB <https://www.mathworks.com/help/matlab/polynomials.html has a few functions> for creating and manipulating single-variabl...

거의 8년 전

문제를 풀었습니다

area of an annulus
Given the diameter d of the inner circle of the annulus. Given length z of a chord of the outer circle of the annulus. This chor...

거의 8년 전

문제를 풀었습니다

Exponential decay
Many dynamic processes can be approximated as an exponential decay. This applies to radioactive decay, some chemical reactions, ...

거의 8년 전

문제를 풀었습니다

continuous compounding
what's the present value of having 100 dollars after n years given a continuously compounded rate i ? keep only 2 decimals pleas...

거의 8년 전

문제를 풀었습니다

Integer sequence - 2 : Kolakoski sequence
Get the n-th term of <https://oeis.org/A000002 Kolakoski Sequence>.

거의 8년 전

문제를 풀었습니다

Carnot cycle
Carnot engine is considered the most efficient heat engine.When operated between two temperatures T1 and T2, the efficiency is g...

거의 8년 전

문제를 풀었습니다

Rumis Scorer 2
<http://en.wikipedia.org/wiki/Rumis Rumis> is a multiplayer 3D block board game where the goal is to have the most squares visib...

거의 8년 전

문제를 풀었습니다

Rumis Scorer 1
<http://en.wikipedia.org/wiki/Rumis Rumis> is a multiplayer 3D block board game where the goal is to have the most squares visib...

거의 8년 전

문제를 풀었습니다

Assign numerical values to a structure with 1 field
The aim is to assign values to a multidimensional structure *without using for-loop or while-loop* Example with a structure ...

거의 8년 전

문제를 풀었습니다

bad colorimeter?
You have tested one good and one bad colorimeters with a colored solution at two path lengths of light and recorded transmittanc...

거의 8년 전

문제를 풀었습니다

Divide the Least Common Multiple by the Greatest Common Divisor of two numbers
Divide the Least Common Multiple by the Greatest Common Divisor of two numbers. For example, for x=12345 and y=54321, the answer...

거의 8년 전

문제를 풀었습니다

Integer Sequence - II : New Fibonacci
Crack the following Integer Sequence. (Hints : It has been obtained from original Fibonacci Sequence and all the terms are also ...

거의 8년 전

문제를 풀었습니다

Is X a Fibonacci Matrix?
In honor of Cleve's new blog and post: <http://blogs.mathworks.com/cleve/2012/06/03/fibonacci-matrices/> Is X a Fibonacci ...

거의 8년 전

문제를 풀었습니다

Repetition of matrices
*A is a bold matrix: [1 2 3; 4 5 6;7 8 9]* Given an integer 'n' , a matrix B exists such that has n copies of A in the row an...

거의 8년 전

문제를 풀었습니다

Basic matrix operations using standard MATLAB commands
Create the matrix: 1.0e+15 * 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000...

거의 8년 전

문제를 풀었습니다

Cycling — Critical Power
From Training and Racing with a Power Meter by Allen and Coggan: "A number of equations have been presented in the scientific...

거의 8년 전

문제를 풀었습니다

Cycling — Normalized Power
In cycling, a power meter is an indispensable tool to record power output (in Watts) and measure fitness gains and performance m...

거의 8년 전

문제를 풀었습니다

Divisible by n, Composite Divisors
Pursuant to <http://www.mathworks.com/matlabcentral/cody/problems/42453-divisible-by-n-prime-vs-composite-divisors Divisible by ...

거의 8년 전

문제를 풀었습니다

Divisible by n, prime divisors from 20 to 200
Pursuant to the previous problem (linked below), this problem requires a function that checks for divisibility of large numbers ...

거의 8년 전

문제를 풀었습니다

Divisible by n, prime divisors - 11, 13, 17, & 19
Divisibility checks against prime numbers can all be accomplished with the same routine, applied recursively, consisting of add ...

거의 8년 전

문제를 풀었습니다

Divisible by n, Truncated-number Divisors
Some divisors only require a few numbers at the end of the number in question to determine divisibility, no matter how long. Exa...

거의 8년 전

문제를 풀었습니다

I'm going to enjoy watching you calculate, Mr Anderson
Smith numbers are numbers such that if you add up all of the digits in the number, that sum equals the sum of all of the digits ...

거의 8년 전

문제를 풀었습니다

Divisible by n, prime divisors (including powers)
For this problem, you will be provided an array of numbers (not necessarily in order). Return the array of numbers with only pri...

거의 8년 전

문제를 풀었습니다

Divisible by n, prime vs. composite divisors
In general, there are two types of divisibility checks; the first involves composite divisors and the second prime divisors, inc...

거의 8년 전

문제를 풀었습니다

Rule of mixtures (composites) - reverse engineering
The <http://en.wikipedia.org/wiki/Rule_of_mixtures rule of mixtures> is used in the mechanical design of composite structures to...

거의 8년 전

문제를 풀었습니다

Rule of mixtures (composites) - upper bound
The <http://en.wikipedia.org/wiki/Rule_of_mixtures rule of mixtures> is used in the mechanical design of composite structures to...

거의 8년 전

문제를 풀었습니다

Rule of mixtures (composites) - either bound
The <http://en.wikipedia.org/wiki/Rule_of_mixtures rule of mixtures> is used in the mechanical design of composite structures to...

거의 8년 전

문제를 풀었습니다

Rule of mixtures (composites) - lower and upper bounds
The <http://en.wikipedia.org/wiki/Rule_of_mixtures rule of mixtures> is used in the mechanical design of composite structures to...

거의 8년 전