Answering in non-programming languages is allowed
The best challenges are written in terms of input and output. We avoid Do X without Y challenges because the Y is usually not defined in terms of input/output.
Disallowing non-programming languages is like disallowing arbitrary classes of langu...
The website pcg-random.org (different meaning of PCG!) has a section on Party Tricks where you rig up a seed-state for a PRNG that produces some output you desire at some point in the future.
Your job is to do the same with some other random number generator. In theory, such states can be found...
My previous answer was criticised for not drawing a line in a sand, so following some discussion on chat I propose a line.
Executive Summary
A purported programming language should be accepted as such if and only if it is capable of addition of natural numbers and primality testing of natural n...
has 68
so I would naturally think the latter one takes precedence, no?
prepend,append-Sequence
The prepend,append-Sequence is defined recursively, like this
a(1) = 1
a(n) = a(n-1).n , if n is even
a(n) = n.a(n-1) , if n is odd
where the . represents an integer concatenation.
So the first few terms are: 1,12,312,3124,53124,531246,7531246,...
Your task is, gi...
So by fixing Cubically's issue (loops don't work when EOF is the last character but are fine when it's anything else), I swapped it. Loops work on EOF but not when the last character is anything else. FFS I'm done
I actually came up with that solution in like 30 seconds, but I couldn't type it on my phone, and then I lost my phone, so it took way longer than necessary
The website pcg-random.org (different meaning of PCG!) has a section on Party Tricks where you rig up a seed-state for a PRNG that produces some output you desire at some point in the future.
Your job is to do the same with some other random number generator. In theory, such states can be found...
The answer of @EpsilonNeighborhoodWatch is not quite correct.
First, it makes an impression that prime $p$ is selected independently for each pair of $x,y$, while in fact prime $p$ should be the same for all elements $1,2,\dots,m$.
Second, the $n$-th power residue class is defined as follows. T...
> This answer is not entirely correct, as pointed out by @HyperNeutrino. I don't know what the correct reading is so I will leave this up for posterity.
Answering in non-programming languages is allowed
The best challenges are written in terms of input and output. We avoid Do X without Y challenges because the Y is usually not defined in terms of input/output.
Disallowing non-programming languages is like disallowing arbitrary classes of langu...
prepend,append-Sequence
The prepend,append-Sequence is defined recursively, like this
a(1) = 1
a(n) = a(n-1).n , if n is even
a(n) = n.a(n-1) , if n is odd
where the . represents an integer concatenation.
So the first few terms are: 1,12,312,3124,53124,531246,7531246,...
Your task is, gi...
The answer of @EpsilonNeighborhoodWatch is not quite correct.
First, it makes an impression that prime $p$ is selected independently for each pair of $x,y$, while in fact prime $p$ should be the same for all elements $1,2,\dots,m$.
Second, the $n$-th power residue class is defined as follows. T...
96. Common Lisp, 236 bytes, A000478
(defun power(m n)
(let ((result 1))
(dotimes (count n result)
(setf result (* m result)))))
(defun solve(n) (+ (- (/ (+ 7 n (* (+ 6 n) (+ 6 n))) 2) (* (+ .5 (/ (+ 6 n) 4)) (power 2 (+ 5 n)))) (/ (power 3 (+ 6 n)) 6)))
Try it online!
Som...
