문제를 풀었습니다


Generate a list of composite numbers

5개월 전

문제를 풀었습니다


SatCom #9: Overall Link Performance
Satellite and Space Engineering - Problem #9 This is part of a series of problems looking at topics in satellite and space comm...

5개월 전

문제를 풀었습니다


SatCom #10: Rate of Precesion of Orbit Plane (Nodal Precession)
Satellite and Space Engineering - Problem #10 This is part of a series of problems looking at topics in satellite and space com...

5개월 전

문제를 풀었습니다


SatCom #8: Satellite Link Budget
Satellite and Space Engineering - Problem #8 This is part of a series of problems looking at topics in satellite and space comm...

5개월 전

문제를 풀었습니다


SatCom #5: Determine Elliptical Orbit Parameters
*Satellite and Space Engineering - Problem #5* _This is part of a series of problems looking at topics in satellite and space...

5개월 전

문제를 풀었습니다


SatCom #3: Free Space Path Loss
*Satellite and Space Engineering - Problem #3* _This is part of a series of problems looking at topics in satellite and space...

5개월 전

문제를 풀었습니다


Decrypt the cypher using XOR encryption (for beginners)
Inspired by Project Euler n°59 Each character on a computer is assigned a unique code and the preferred standard is ASCII (...

5개월 전

문제를 풀었습니다


SatCom #7: Thermal Noise in a Receiver
Satellite and Space Engineering - Problem #7 This is part of a series of problems looking at topics in satellite and space comm...

5개월 전

문제를 풀었습니다


SatCom #1: Wavelength of an electomagnetic wave
*Satellite and Space Engineering - Problem #1* _This is the first of a series of problems looking at topics in satellite and ...

5개월 전

문제를 풀었습니다


I've got the power! (Inspired by Project Euler problem 29)
Consider all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5: 2^2=4, 2^3=8, 2^4=16,...

5개월 전

문제를 풀었습니다


Pseudo-vampire number
refer to <https://en.wikipedia.org/wiki/Vampire_number> Given a number x, determine whether it is a pseudo-vampire number. A p...

5개월 전

문제를 풀었습니다


Mandelbrot Numbers
The <http://en.wikipedia.org/wiki/Mandelbrot_set Mandelbrot Set> is built around a simple iterative equation. z(1) = c z...

5개월 전

문제를 풀었습니다


Last non-zero digit
Given a number n, find the last non-zero digit of the factorial of that number. You need to take care of the large values of n....

5개월 전

문제를 풀었습니다


Cantor counting
Find the nth cantor's rational number. the sequence is given below in the link. Sequence: 1/1,1/2,2/1,3/1,2/2,1/3,1/4... ... .....

5개월 전

문제를 풀었습니다


Frugal number
check whether n is a frugal number * a frugal number is a natural number in a given number base that has more digits than the...

5개월 전

문제를 풀었습니다


Bell Triangle
Form the bell triangle upto nth bell number posotion; * if n=5 * y= [1 0 0 0 0; 1 2 0 0...

5개월 전

문제를 풀었습니다


check whether a number is a pentatope number
<https://oeis.org/A000332>

5개월 전

문제를 풀었습니다


Woodall number
Test whether the input is a Woodall number: <http://en.wikipedia.org/wiki/Woodall_number> _Please do not cheat by simply chec...

5개월 전

문제를 풀었습니다


Iccanobif numbers 1
There are a lot of problems in Cody that deal with Fibonacci numbers (1, 1, 2, 3, 5, 8, 13, 21 etc...) so let's turn things arou...

5개월 전

문제를 풀었습니다


Pentagonal Numbers
Your function will receive a lower and upper bound. It should return all pentagonal numbers within that inclusive range in ascen...

5개월 전

문제를 풀었습니다


Pell numbers
Find the nth pell number <https://en.wikipedia.org/wiki/Pell_number>

5개월 전

문제를 풀었습니다


generate nth pentatope number
https://en.wikipedia.org/wiki/Pentatope_number

5개월 전

문제를 풀었습니다


Convert float to base N
The matlab function dec2base converts a positive integer number to a specified base. Extend it so that it works with non intege...

5개월 전

문제를 풀었습니다


Integer complexity (Large numbers)
Inspired by <http://www.mathworks.com/matlabcentral/cody/problems/42831-integer-complexity Problem 42831>, this problem aims to ...

5개월 전

문제를 풀었습니다


Number construction III
Given a positive integer, n, return a, b and c, such that 1. n = a^1.5+b^2.5+c^3.5 2. a, b and c are all positive integers...

5개월 전

문제를 풀었습니다


Integer complexity
Given an array, n, of positive integers, return an array, c, of the same size, in which each element is the complexity of the co...

5개월 전

문제를 풀었습니다


Fill an array given a sum and array length values
Fill an array with random numbers so that their sum and array length will be equal to the given values as input. Function will g...

5개월 전

문제를 풀었습니다


Number construction II
Given a positive integer, n, return a, b, c and d, such that 1. n = a*2^b+c*3^d 2. a, b, c and d are all positive integers...

5개월 전

문제를 풀었습니다


Number construction I
Given a positive integer, n, return a, b, c and d, such that 1. n = a*sqrt(b)+c*sqrt(d) 2. a, b, c and d are all positive ...

5개월 전

문제를 풀었습니다


Sum the Digits of a Number
Given an integer, sum the digits repeatedly until you end up with a single value less than 10. For example, if you add the di...

5개월 전

더 보기