解決済み

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

約3年前

解決済み

Sum of series IX
What is the sum of the following sequence: Σ 1/k! for k=1...n for different n?

約3年前

解決済み

Sum of series VIII

約3年前

解決済み

Sum of series
a(n) = n^2 - (n-1)^2 find the summation of the series upto n i.e. a(1)+a(2)+...+a(n)

約3年前

解決済み

Sum of series IV
What is the sum of the following sequence: Σ(-1)^(k+1) (2k-1)^2 for k=1...n for different n?

約3年前

解決済み

Sum of series VII
What is the sum of the following sequence: Σ(km^k)/(k+m)! for k=1...n for different n and m?

約3年前

解決済み

Sum of series VI
What is the sum of the following sequence: Σk⋅k! for k=1...n for different n?

約3年前

解決済み

Sum of series V
What is the sum of the following sequence: Σk(k+1) for k=1...n for different n?

約3年前

解決済み

Sum of series III
What is the sum of the following sequence: Σ(2k-1)^3 for k=1...n for different n?

約3年前

解決済み

Sum of series II
What is the sum of the following sequence: Σ(2k-1)^2 for k=1...n for different n?

約3年前

解決済み

Sum of series I
What is the sum of the following sequence: Σ(2k-1) for k=1...n for different n?

約3年前

解決済み

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

約3年前

解決済み

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

約3年前

解決済み

Scoring for oriented dominoes
Given a list of ordered pairs, and the order they should be placed in a line, find the sum of the absolute values of the differe...

約3年前

解決済み

Word Counting and Indexing
You are given a list of strings, each being a list of words divided by spaces. Break the strings into words, then return a maste...

約3年前

解決済み

Given two arrays, find the maximum overlap
Given two (integer) arrays s1 and s2, create a new array s3 which is as short as possible and contains both arrays. #1 s1 = [...

約3年前

解決済み

Kaprekar Steps
6174 is the Kaprekar constant. All natural numbers less than 10,000 (except some with same digits) can be reduced to 6174 in the...

約3年前

解決済み

Converting binary to decimals
Convert binary to decimals. Example: 010111 = 23. 110000 = 48.

約3年前

解決済み

Binary code (array)
Write a function which calculates the binary code of a number 'n' and gives the result as an array(vector). Example: Inpu...

約3年前

解決済み

Relative ratio of "1" in binary number
Input(n) is positive integer number Output(r) is (number of "1" in binary input) / (number of bits). Example: * n=0; r=...

約3年前

解決済み

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

約3年前

解決済み

Given an unsigned integer x, find the largest y by rearranging the bits in x
Given an unsigned integer x, find the largest y by rearranging the bits in x. Example: Input x = 10 Output y is 12 ...

約3年前

解決済み

Binary numbers
Given a positive, scalar integer n, create a (2^n)-by-n double-precision matrix containing the binary numbers from 0 through 2^n...

約3年前

解決済み

Find out sum and carry of Binary adder
Find out sum and carry of a binary adder if previous carry is given with two bits (x and y) for addition. Examples Previo...

約3年前

解決済み

Convert given decimal number to binary number.
Convert given decimal number to binary number. Example x=10, then answer must be 1010.

約3年前

解決済み

Find the longest sequence of 1's in a binary sequence.
Given a string such as s = '011110010000000100010111' find the length of the longest string of consecutive 1's. In this examp...

約3年前

解決済み

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

約3年前

解決済み

Project Euler: Problem 1, Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23...

約3年前

解決済み

Make roundn function
Make roundn function using round. x=0.55555 y=function(x,1) y=1 y=function(x,2) y=0.6 y=function(x,3) ...

約3年前

解決済み

Rounding off numbers to n decimals
Inspired by a mistake in one of the problems I created, I created this problem where you have to round off a floating point numb...

約3年前