photo

Nguyen


Last seen: 3일 전 2025년부터 활동

Followers: 0   Following: 0

통계

Cody

0 문제
254 답안

순위
N/A
of 300,847

평판
N/A

참여
0 질문
0 답변

답변 채택
0.00%

획득한 표
0

순위
 of 21,094

평판
N/A

평균 평점
0.00

참여
0 파일

다운로드 수
0

ALL TIME 다운로드 수
0

순위
495
of 171,279

참여
0 문제
254 답안

점수
3,792

배지 수
22

참여
0 게시물

참여
0 공개 채널

평균 평점

참여
0 하이라이트

평균 좋아요 수

  • Project Euler I
  • CUP Challenge Master
  • Draw Letters
  • Indexing II Master
  • Community Group Solver
  • Introduction to MATLAB Master
  • Solver

배지 보기

Feeds

보기 기준

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


Triangle sequence
A sequence of triangles is constructed in the following way: 1) the first triangle is Pythagoras' 3-4-5 triangle 2) the second...

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


Determine whether a prime is Pythagorean

대략 2개월 전

문제를 풀었습니다


Compute the nth Pythagorean prime
Pythagorean primes have the form p = 4n+1, where n is an integer, and they can be written as the sum of squares of two integers....

대략 2개월 전

문제를 풀었습니다


Identify Wagstaff primes
The numbers 3, 43, and 2731 are examples of <https://mathworld.wolfram.com/WagstaffPrime.html Wagstaff primes>. Write a func...

대략 2개월 전

문제를 풀었습니다


List the emirps
An emirp is a prime number that becomes a different prime when reversed. The numbers 13, 17, and 149 are emirps, but 11, 19, and...

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


Factorize THIS, buddy
List the prime factors for the input number, in decreasing order. List each factor only once, even if the factorization includes...

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


Get all prime factors
List the prime factors for the input number, in decreasing order. List each factor. If the prime factor occurs twice, list it as...

대략 2개월 전

문제를 풀었습니다


(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
This problem is inspired by problems <http://uk.mathworks.com/matlabcentral/cody/problems/2187-generalized-fibonacci 2187>, <htt...

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


Project Euler: Problem 16, Sums of Digits of Powers of Two
2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 2^N? Thanks ...

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

문제를 풀었습니다


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

대략 2개월 전

더 보기