문제를 풀었습니다

Pi Estimate 1
Estimate Pi as described in the following link: <http://www.people.virginia.edu/~teh1m/cody/Pi_estimation1.pdf>

9달 전

문제를 풀었습니다

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)* ...

9달 전

문제를 풀었습니다

Duplicate a character
Duplicate a character 'n' times. Example 1: str='a' n=5 output='aaaaa' Example 2: str='*' n=3 output='***'

9달 전

문제를 풀었습니다

Number of vertices of a hypercube
Return the number of vertices of a n-dimensional hypercube.

9달 전

문제를 풀었습니다

Calculate compression ratio of engine
Calculate compression ratio of engine given compression volume of cylinder(Vc), piston stroke(s) and valve diameter(d)

9달 전

문제를 풀었습니다

Compute the Schwarzschild radius for objects of mass m (kg). Use c = 299,792.458 km/s and G = 6.6738*10^-11 N*(m/kg)^2. Your fun...

9달 전

문제를 풀었습니다

Easy Sequences 13: Average Speed of Spaceship
A certain alien spaceship is capable of traveling at extremely high velocities and is able to change speed instantaneously. The ...

9달 전

문제를 풀었습니다

Differential equations I
Given a function handle |f| an initial condition |y0| and a final time |tf|, solve numerically the differential equation dy...

10달 전

문제를 풀었습니다

The Birthday Phenomenon
First off, leap years are not being considered for this. In fact the year that people are born shouldn't be taken into considera...

10달 전

문제를 풀었습니다

Monte-Carlo integration
Write a function that estimates a d-dimensional integral to at least 1% relative precision. Inputs: * d: positive integer....

10달 전

문제를 풀었습니다

Longest Collatz Sequence
Inspired by Projet Euler n°14. The Collatz iterative sequence (See Cody problem n° 2103 and 211) is defined for the set of po...

10달 전

문제를 풀었습니다

Large Sum (inspired by Project Euler 13)
Your function will be provided an arbitrary number of numbers of arbitrary sizes as a cell array of strings. Some numbers will b...

10달 전

문제를 풀었습니다

Divisors for big integer
Inspired by Problem 1025 and Project Euler 12. Given n, return the number y of integers that divide N. For example, with ...

10달 전

문제를 풀었습니다

Highly divisible triangular number (inspired by Project Euler 12)
Triangular numbers can be calculated by the sum from 1 to n. For example, the first 10 triangular numbers are: 1, 3, 6, 10, ...

10달 전

문제를 풀었습니다

Project Euler: Problem 11, Largest product in a grid
What is the greatest product of _k_ adjacent numbers in the same direction (up, down, left, right, or diagonally) in a _n×n_ gri...

10달 전

문제를 풀었습니다

Sum of big primes without primes
Inspired by Project Euler n°10 (I am quite obviously a fan). With problem n°250 by Doug, you can find some global methods to ...

약 1년 전

문제를 풀었습니다

Sums of cubes and squares of sums
Given the positive integers 1:n, can you: 1. Compute twice the sum of the cubes of those numbers. 2. Subtract the square...

약 1년 전

문제를 풀었습니다

The Piggy Bank Problem
Given a cylindrical piggy bank with radius g and height y, return the bank's volume. [ g is first input argument.] Bonus though...

약 1년 전

제출됨

Wind Rose
Graph and table for Direction-Intensity data

1년 이상 전 | 다운로드 수: 162 |

문제를 풀었습니다

Fraction of a fraction of a ...
One sort of brainteaser problem is a math problem wherein you are asked what the given fraction of a fraction of a ... number is...

2년 이하 전

문제를 풀었습니다

Approximation of Pi (vector inputs)
Pi (divided by 4) can be approximated by the following infinite series: pi/4 = 1 - 1/3 + 1/5 - 1/7 + ... For a given numbe...

2년 이하 전

문제를 풀었습니다

Approximation of Pi
Pi (divided by 4) can be approximated by the following infinite series: pi/4 = 1 - 1/3 + 1/5 - 1/7 + ... For a given numbe...

2년 이하 전

문제를 풀었습니다

Given a square and a circle, please decide whether the square covers more area.
You know the side of a square and the diameter of a circle, please decide whether the square covers more area.

2년 이하 전

문제를 풀었습니다

Volume Pillar
Calculate the volume of a pillar with radius l and heigth ar.

2년 이하 전

문제를 풀었습니다

Mersenne Primes vs. All Primes
A Mersenne prime (M) is a prime number of the form M = 2^p - 1, where p is another prime number. <https://www.mathworks.com/matl...

2년 이하 전

문제를 풀었습니다

Pancakes for everyone!
Accordingly to the <http://nl.mathworks.com/matlabcentral/cody/problems/42460-the-cake-is-a-lie problem 42460>. All the children...

2년 이하 전

문제를 풀었습니다

The cake is a lie...
You're hosting a birthday party with a large number of screaming children. Fortunately, you have a gigantic sheet cake in front...

2년 이하 전

문제를 풀었습니다

Radiation Heat Transfer — View Factors (5)
View factors (aka configuration factors) are utilized in some radiation heat transfer models to estimate heat transfer rates bet...

2년 이하 전

문제를 풀었습니다

Radiation Heat Transfer — View Factors (4)
View factors (aka configuration factors) are utilized in some radiation heat transfer models to estimate heat transfer rates bet...

2년 이하 전