Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with math
Search options not deleted
user 71165
The challenge involves mathematics in some central way. Also consider using more specific tags, listed in the tag wiki info.
1
vote
Number of values between input and next highest square
05AB1E, 2 bytes
t·
Try it online!
Another port of Martin Ender's submission ...
- 315
7
votes
Sum of all integers from 1 to n
05AB1E, 2 bytes
LO
Try it online!
How it works
#input enters stack implicitly
L #pop a, push list [1 .. a]
O #sum of the list
#implicit output
Gauss sum, 4 bytes
>¹*;
Try it online …
- 315
1
vote
Multiply two numbers
Jellyfish, 6 bytes
P*i
i
Try it online!
P denotes print, then * multiplies the two numbers below and to the right.
At the start of execution, the two is are replaced with values from STDIN.
- 315
1
vote
It's Hip to be Square
05AB1E, 5 3 bytes
t.ï
Try it online!
Longer than @Erik's but just wanted to give it a shot.
Now shorter than Erik's but fails for large numbers...
Explanation
t # square roots the in …
- 315
5
votes
An abundance of integers!
05AB1E, 4 bytes
ѨO‹
Try it online!
How it works
Ñ #list of divisors
¨ #remove last element (i.e the input from the list of factors)
O #sum the list
‹ #is this sum le …
- 315