For challenges related to the different ways of expressing an integer as a sum of integers.
15
votes
15answers
927 views
Calculate the partitions of N
Your challenge is simple: GIven an integer N, ouput every list of positive integers that sums to N. For example, if the input was 5, you should output
[1, 1, 1, 1, 1]
[1, 1, 1, 2]
[1, 1, 3]
[1, 2, 2]...
14
votes
9answers
341 views
Strict partitions of a positive integer
OEIS A000009 counts the number of strict partitions of the integers. A strict partition of a nonnegative integer n is a set of positive integers (so no repetition is allowed, and order does not matter)...
19
votes
4answers
240 views
Partitioning reciprocals
Given a number n > 77, write a program or function that finds a set of distinct positive integers such that the sum of the set equals n, and the sum of the reciprocals of the set equals 1.
Example ...
21
votes
14answers
1k views
Sums of Consecutive Integers
Before anyone says anything, similar and similar. But this is not a dupe.
Some positive integers can be written as the sum of at least two consecutive positive integers. For example, 9=2+3+4=4+5. ...
15
votes
8answers
672 views
Minimum number of numbers to sum to exactly n
First question here, don't yell at me if this is a duplicate or a bad challenge.
Introduction
I thought of this challenge myself, and it seems to be a good basic puzzle for beginner code-golfers. It ...
15
votes
11answers
517 views
Find the sets of sums
I've enjoyed reading this site; this is my first question. Edits are welcome.
Given positive integers n and m, compute all ordered partitions of m into exactly n parts positive integer parts, and ...
22
votes
8answers
932 views
Hook length product
A Young diagram is an arrangement of boxes in left-justified rows and top-justified columns. For each box, all the spaces above it and to its left are occupied.
XXXXX
XXX
XXX
X
The hook length of a ...
44
votes
12answers
3k views
Fissile Numbers
I found this sequence while working on Evolution of OEIS, but never got around to posting it as an answer. After writing a reference implementation in Mathematica, I thought this is a fun exercise to ...
15
votes
4answers
2k views
Build an ASCII Fibonacci Clock
Someone built a really fancy clock using Fibonacci numbers, which looks really nice but is fairly unusable. Just the way we like it! Let's recreate this.
The clock is made up of 5 sections ...
15
votes
11answers
1k views
Random Golf of the Day #3: Integer Partitions
About the Series
First off, you may treat this like any other code golf challenge, and answer it without worrying about the series at all. However, there is a leaderboard across all challenges. You ...
12
votes
3answers
410 views
Nearest partition numbers
The number of partitions of an integer is the number of ways that integer can be represented as a sum of positive integers.
For example:
5
4 + 1
3 + 2
3 + 1 + 1
2 + 2 + 1
2 + 1 + 1 + 1
1 + 1 + 1 + 1 ...
2
votes
8answers
1k views
Compute the number of ways how you can express a number as a sum [closed]
For a given natural number n, compute the number of ways how one can express n as a sum of positive natural numbers. For example, for n = 1 there is just one way. For n = 4 we have 5 possible ways:
1 ...
17
votes
15answers
2k views
The minimum fibonacci challenge!
Challenge
In this task you would be given an integer N (less than 106), find the minimum way in which you could sum to N using only Fibonacci numbers.
You could use any Fibonacci number more ...
3
votes
9answers
2k views
Partition of a positive integer N [closed]
Find the number of partitions of a positive integer n. Hope someone uses the explicit finite formula for the partition function defined in Jan Hendrik Brunier and Ken Ono paper here.
Sample Input
8
...
