Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Comments on Reduce over the range [1..n]

Parent

Reduce over the range [1..n]

+7
−0

Task

I often need to find the factorial of a number or the sum of all numbers up to a number when cheating on math tests. To help me with this, your task is to write $F$, a generalized version of those functions:

$$F(n) = 1 * 2 * \space ... \space * (n-1) * n$$

Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a commutative, associative operator that will be an input to your program/function. This means that $a * b$ is the same as $b * a$, and $a * (b * c)$ is the same as $(a * b) * c$. Its inputs are positive integers, and its outputs are integers.

Rules

  • $n$ will be a positive integer.
  • $*$ is a binary function/operator that can be taken in any convenient format, including but not limited to:
    • A function object
    • A function pointer
    • An object with a method with a specific name (e.g. Java's BiFunction)
    • A string that can be evaluated to get a function
  • $*$ is a blackbox function. That means that you will not be able to examine it to see how it works; all you can do is feed it two positive integers and get an integer back.
  • The output of your function will be an integer (not necessarily positive).
  • This is code golf, so shortest code in bytes wins!

Testcases

f         | n  | F(f, n)
Add       | 1  | 1
Add       | 5  | 15
Multiply  | 1  | 1
Multiply  | 5  | 120
XOR       | 1  | 1
XOR       | 2  | 3
XOR       | 5  | 1
XOR       | 10 | 11
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.
Why should this post be closed?

1 comment thread

Function constraint (2 comments)
Post
+3
−0

Ruby, 17 bytes

->{_2.reduce(_1)}

Takes function (Proc) followed by Array.

32 bytes without inject or reduce

->f,(a,*r){r.map{|n|a=f[a,n]};a}
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.

1 comment thread

Is first code correct? (2 comments)
Is first code correct?
radarek‭ wrote almost 3 years ago

I don't think that first code is correct. If you want to pass proc/lambda as a block to reduce method, then & is needed.

->{_2.reduce(&_1)}

To make it shorter, () can be omitted:

->{_2.reduce &_1}

Try this online

radarek‭ wrote almost 3 years ago

Also, the solution you provided does not follow problem description. The code does not reduce 1..n (n is a parameter).