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 »
Users Search
Help Dashboard Sign In Sign Up
Challenges Q&A Sandbox Meta
Sandbox
Posts Tags Edits
Create Draft

Post History

81%
+7 −0
Sandbox Reduce over the range [1..n] [FINALIZED]

posted 3y ago by user‭  ·  edited 1y ago by trichoplax‭

Article code-golf finalized array-manipulation blackbox-function
#7: Post edited by user avatar trichoplax‭ · 2023-06-19T10:25:57Z (over 1 year ago)
Add finalized tag now that the sandbox can be filtered to exclude tags 
Reduce over the range [1..n] [FINALIZED]
# 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](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  - 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 <a class="badge is-tag">code golf</a>, 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
```

Questions:

- Interesting enough? Is a vanilla factorial better?
- Are the tags okay?
- Needs more testcases?
- Input rules okay?
code-golf finalized array-manipulation blackbox-function
#6: Post edited by user avatar user‭ · 2021-08-10T14:35:54Z (over 3 years ago)
Finalized
  • Reduce over the range [1..n]
  • Reduce over the range [1..n] [FINALIZED]
#5: Post edited by user avatar user‭ · 2021-08-08T14:55:14Z (over 3 years ago)
  • # 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 * ... * (n-1) * n$$
  • Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a [commutative](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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.
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
  • # 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](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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 <a class="badge is-tag">code golf</a>, 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
#4: Post edited by user avatar user‭ · 2021-08-07T18:02:55Z (over 3 years ago)
Fixed rong tyop
  • # Task
  • I often need to find the factorial or a number of 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 * ... * (n-1) * n$$
  • Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a [commutative](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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.
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
  • # 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 * ... * (n-1) * n$$
  • Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a [commutative](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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.
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
#3: Post edited by user avatar user‭ · 2021-08-07T18:02:33Z (over 3 years ago)
Mead a tyop
  • # Task
  • I often need to find the factorial of a number of 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 * ... * (n-1) * n$$
  • Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a [commutative](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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.
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
  • # Task
  • I often need to find the factorial or a number of 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 * ... * (n-1) * n$$
  • Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a [commutative](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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.
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
#2: Post edited by user avatar user‭ · 2021-08-07T17:51:00Z (over 3 years ago)
Add some clarifications
  • # Task
  • I often need to find the factorial of a number of 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 * ... * (n-1) * n$$
  • Please note that the operator $*$ does not necessarily represent multiplication here, but stands for a commutative operator that will be an input to your program/function.
  • # 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. `apply`)
  • - A string that can be evaluated to get a function
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
  • # Task
  • I often need to find the factorial of a number of 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 * ... * (n-1) * n$$
  • Please note that the operator $ * $ does not necessarily represent multiplication here, but stands for a [commutative](https://en.wikipedia.org/wiki/Commutative_property), [associative](https://en.wikipedia.org/wiki/Associative_property) 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`](https://docs.oracle.com/javase/8/docs/api/java/util/function/BiFunction.html[]()))
  • - 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.
  • - 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
  • ```
  • Questions:
  • - Interesting enough? Is a vanilla factorial better?
  • - Are the tags okay?
  • - Needs more testcases?
  • - Input rules okay?
#1: Initial revision by user avatar user‭ · 2021-08-06T21:41:01Z (over 3 years ago) 
Reduce over the range [1..n]
# Task

I often need to find the factorial of a number of 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 * ... * (n-1) * n$$

Please note that the operator $*$ does not necessarily represent multiplication here, but stands for a commutative operator that will be an input to your program/function.

# 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. `apply`)
  - A string that can be evaluated to get a function
- 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
```

Questions:

- Interesting enough? Is a vanilla factorial better?
- Are the tags okay?
- Needs more testcases?
- Input rules okay?
code-golf array-manipulation blackbox-function