문제를 풀었습니다

Remove Upper Case Letters
Example Matlab --> atlab proBlem --> prolem Enter --> nter

대략 1년 전

문제를 풀었습니다

Bit Reversal
Given an unsigned integer _x_, convert it to binary with _n_ bits, reverse the order of the bits, and convert it back to an inte...

대략 1년 전

문제를 풀었습니다

Coefficient of Kinetic friction
A robot exerts a F1 lb. force horizontally on a W lb. crate across a concrete floor at a constant speed. What is the coefficien...

대략 1년 전

문제를 풀었습니다

Magnitude of Balancing Force
A box weighing W1 pounds is placed where its center of mass is located d1 ft from the fulcrum. A balancing force is placed at th...

대략 1년 전

문제를 풀었습니다

Find the force required to support a lever
Students are designing a robot that will lift a block to the equilibrium position for transport to the scoring area. They have d...

대략 1년 전

문제를 풀었습니다

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

1년 초과 전

문제를 풀었습니다

Smith numbers
Return true if the input is a Smith number in base ten. Otherwise, return false. Read about Smith numbers at http://en.wikipedia...

1년 초과 전

문제를 풀었습니다

Multiples of a Number in a Given Range
Given an integer factor _f_ and a range defined by _xlow_ and _xhigh_ inclusive, return a vector of the multiples of _f_ that fa...

1년 초과 전

문제를 풀었습니다

Numbers with prime factors 2, 3 and 5.
Make a function which takes one positive integer n and returns a matrix with the numbers of the form (2^i)*(3^j)*(5^k) which are...

1년 초과 전

문제를 풀었습니다

Prime factor digits
Consider the following number system. Calculate the prime factorization for each number n, then represent the prime factors in a...

1년 초과 전

문제를 풀었습니다

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

1년 초과 전

문제를 풀었습니다

Spherical radius given four points
Determine the radius of a sphere provided four non-coplanar points on the surface of the sphere. pts = [x1 y1 z1; x...

1년 초과 전

문제를 풀었습니다

Fibonacci Decomposition
Every positive integer has a unique decomposition into nonconsecutive Fibonacci numbers f1+f2+ ... Given a positive integer n, r...

1년 초과 전

문제를 풀었습니다

How many Fibonacci numbers?
Find the number of unique Fibonacci numbers (don't count repeats) in a vector of positive integers. Example: x = [1 2 3 4...

1년 초과 전

문제를 풀었습니다

Project Euler: Problem 4, Palindromic numbers
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 ...

1년 초과 전

문제를 풀었습니다

Project Euler: Problem 9, Pythagorean numbers
A Pythagorean triplet is a set of three natural numbers, a b c, for which, a^2 + b^2 = c^2 For example, 3^2 + 4^2 = 9 + 16 ...

1년 초과 전

문제를 풀었습니다

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

1년 초과 전

문제를 풀었습니다

Proper Factors
Generate the proper factors of input integer x and return them in ascending order. For more information on proper factors, refer...

1년 초과 전

문제를 풀었습니다

Fibonacci-Sum of Squares
Given the Fibonacci sequence defined by the following recursive relation, * F(n) = F(n-1) + F(n-2) * where F(1) = 1 and F(1)...

1년 초과 전

문제를 풀었습니다

Return fibonacci sequence do not use loop and condition
Calculate the nth Fibonacci number. Given n, return f where f = fib(n) and f(1) = 1, f(2) = 1, f(3) = 2, ... Examples: ...

1년 초과 전

문제를 풀었습니다

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

1년 초과 전

문제를 풀었습니다

Fibonacci sequence
Calculate the nth Fibonacci number. Given n, return f where f = fib(n) and f(1) = 1, f(2) = 1, f(3) = 2, ... Examples: Input...

1년 초과 전

문제를 풀었습니다

Project Euler: Problem 2, Sum of even Fibonacci
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 te...

1년 초과 전

문제를 풀었습니다

Number of Even Elements in Fibonacci Sequence
Find how many even Fibonacci numbers are available in the first d numbers. Consider the following first 14 numbers 1 1 2...

1년 초과 전

문제를 풀었습니다

Find the next Fibonacci number
In the sequence of Fibonacci numbers, every number is the sum of the two preceding ones: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55...

1년 초과 전

문제를 풀었습니다

Return the Fibonacci Sequence
Write a code which returns the Fibonacci Sequence such that the largest value in the sequence is less than the input integer N. ...

1년 초과 전

문제를 풀었습니다

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

1년 초과 전

문제를 풀었습니다

Project Euler: Problem 10, Sum of Primes
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below the input, N. Thank you <http:/...

1년 초과 전

문제를 풀었습니다

Project Euler: Problem 6, Natural numbers, squares and sums.
The sum of the squares of the first ten natural numbers is, 1^2 + 2^2 + ... + 10^2 = 385 The square of the sum of the first ...

1년 초과 전

문제를 풀었습니다

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

1년 초과 전