문제를 풀었습니다

Design a tubesheet for shell-and-tube heat exchangers
<<https://3.bp.blogspot.com/-kLSbhcCoT2I/WJIh-QVGLGI/AAAAAAAADEs/svvMzBqn4fUfI1rTCCH7Uw-QuDvxx0PxACLcB/s1600/Screenshot_669.jpg>...

거의 4년 전

문제를 풀었습니다

Create a matrix map of increasing safety levels
The sole nuclear power plant at Grid City suddenly had a meltdown. Luckily, the plant was designed to be in full automation, so ...

거의 4년 전

문제를 풀었습니다

Count the number of folds needed to pack a large sheet
In a certain paper factory, large sheets of paper are being made every day. Before sending the sheets for shipment, they have to...

거의 4년 전

문제를 풀었습니다

Convert a temperature reading from Celsius to an unknown scale
Two of the most famous temperature scales are the Celsius and the Fahrenheit scale. In reality, however, there are so many other...

거의 4년 전

문제를 풀었습니다

Find the next prime number
Find the next prime number or numbers for given n. For example: n = 1; out = 2; or n = [5 7]; out = [7 11]; ...

거의 4년 전

문제를 풀었습니다

Make a vector of prime numbers
Input(n) - length of vector with prime numbers Output(v) - vector of prime numbers Example: * n=1; v=2 * n=3; v=[2 3 5...

거의 4년 전

문제를 풀었습니다

Largest Twin Primes
<http://en.wikipedia.org/wiki/Twin_prime Twin primes> are primes p1, p2 = p1 + 2 such that both p1 and p2 are prime numbers. Giv...

거의 4년 전

문제를 풀었습니다

Mersenne Primes
A Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number. For example, 31 is a Mersenne prim...

거의 4년 전

문제를 풀었습니다

Find nearest prime number less than input number
Find nearest prime number less than input number. For example: if the input number is 125, then the nearest prime number whi...

거의 4년 전

문제를 풀었습니다

Sophie Germain prime
In number theory, a prime number p is a *Sophie Germain prime* if 2p + 1 is also prime. For example, 23 is a Sophie Germain prim...

거의 4년 전

문제를 풀었습니다

Circular Primes (based on Project Euler, problem 35)
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. The...

거의 4년 전

문제를 풀었습니다

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

거의 4년 전

문제를 풀었습니다

The Goldbach Conjecture
The <http://en.wikipedia.org/wiki/Goldbach's_conjecture Goldbach conjecture> asserts that every even integer greater than 2 can ...

거의 4년 전

문제를 풀었습니다

Project Euler: Problem 7, Nth prime
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the Nth prime nu...

거의 4년 전

문제를 풀었습니다

Draw a '4' in a zero matrix!

거의 4년 전

문제를 풀었습니다

Draw a '6' in a zero matrix!

거의 4년 전

문제를 풀었습니다

Draw a '9' in a zero matrix!

거의 4년 전

문제를 풀었습니다

Draw a '7' in a zero matrix!