解決済み

Back to the Future III
Marty McFly and Doc Brown are "back" again. See the test suite to see what they are up to.

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

tetration
About tetration.

1年以上前

解決済み

Check if the input is an interprime

1年以上前

解決済み

Check if the input is a balanced prime

1年以上前

解決済み

Check if the input is a strong prime

1年以上前

解決済み

Decipher the number 2 - 3 keys

1年以上前

解決済み

decipher the number 1 - same key for all digits :)
You will be given a input number (eg) x=12345 you have to figure out the dechiper key and match it with given input and deciph...

1年以上前

解決済み

Easy Sequences 12: 50th Prime
Write a function that outputs the th prime after a given number . For example, the th prime after is . NOTE: If itself is pr...

1年以上前

解決済み

Easy Sequences 11: Factorial Digits without Trailing Zeros
Here is an easy one... It is not difficult to count the number of digits of the factorial of a given number. For example for 'n...

1年以上前

解決済み

Easy Sequences 10: Sum of Cumsums of Fibonacci Sequence
The function F(n) is defined as the set of Fibonacci numbers from the first up to the n-th. S(n) is the result of applying to F,...

1年以上前

解決済み

Easy Sequences 9: Faithful Pairs
A "faithful number" is a non-prime number that is one less or one more than some prime number but not both. For example, for num...

1年以上前

解決済み

Is the number of 1s in a binary integer odd or even?
Your function should turn the input integers into binary form and count the number of 1s in the binary. If the number is odd, re...

1年以上前

解決済み

Round up to π

1年以上前

解決済み

Just square the input
Square the number

1年以上前

解決済み

Easy Sequences 7: Easy as Composite Pi
The prime Pi function is defined as the number of prime numbers from 1 to a certain given limit. In MATLAB, it is easy to create...

1年以上前

解決済み

Easy Sequences 6: Coefficient sums of derivatives
Consider the polynomial function and its first-order derivative . The sums of the coefficients of P and P', are and , respecti...

1年以上前

解決済み

Easy Sequences 5: Project Euler Problem 1 - Again!
We are all familiar with Project Euler Problem 1. This time let's try it on bigger multiples and larger range. Find the sum of ...

1年以上前

解決済み

Monte Carlo integration: area of a polygon
The area of a polygon (or any plane shape) can be evaluated by <https://www.mathworks.com/matlabcentral/cody/problems/179 Monte ...

1年以上前

解決済み

Siren frequency and Doppler effect.
The Doppler effect is described on OpenStax University Physics at https://openstax.org/books/university-physics-volume-1/pages/1...

1年以上前

解決済み

Rotate matrix by coloumns

1年以上前

解決済み

Easy Sequences 4: Eliminate the Days of Confusion
If a date is written in purely numeric format some dates can be confusing, if we don't know the date format used. For example, "...

1年以上前

解決済み

Easy Sequences 3: Prime 44-number Squares
The positive integers 62 and 238 are related. Their squares (3844 and 56,644) both end in '44'. In fact, 62 and 238 are the 3rd ...

1年以上前

解決済み

List numbers that are not squares
The numbers 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 17, etc. are not perfect squares. Write a function to list the th term in ...

1年以上前

解決済み

A sequence of Ones
You are given number(s) with all digits - 1. Your answer will depend on the count of 1 in the given number, for example - x1...

1年以上前

解決済み

Original coordinate of the min element of a subset of elements

1年以上前

解決済み

Count unique orderings of vertices of a polygon
Cody Problem 2671 asks us to determine whether four points can be the corners of a rectangle. The points are not necessarily inp...

1年以上前

解決済み

Caesar Cipher
Given a input word x and a shift n, encrypt the word with caesar cipher of shift n.

1年以上前