A rainbow of identity functions code-challenge restricted-source Closely related: How high can you count? Challenge In your programming language of choice, write as many different identity programs/functions as possible, under the following constraints: Each program should be a function or f...

Calculate the vector component code-golf math geometry Challenge Assume two vectors \$\mathbf{a} = (a_1,a_2,\cdots,a_n)\$ and \$\mathbf{b} = (b_1,b_2,\cdots,b_n)\$ are given in an \$n\$-dimensional space, where at least one of \$b_1,\cdots,b_n\$ is nonzero. Then \$\mathbf{a}\$ can be uniquely d...

What is the minimum number of operations required to convert an Array A of 3 elements say (a,b,c) into another desired Array B (p,q,r) by using the following set of rules: Choose an integer x and an arithmetic operation either multiplication or addition Choose a subset of the original array of ...

Input is the header as hexadecimal without the checksum for the checksum calculation and with checksum for the verification. Output for calculation is the checksum as hexadecimal and True/False for the verification. Example: Calculation Input: "4500 0073 0000 4000 4011 c0a8 0001 c0a8 00c7" ...

It's time for another Mesoamerican calendar! The Xiuhnelpilli was used by the Aztecs (more properly, the Mexica) to name their years. Each year has a number and a sign. Here's part of the cycle: Input; Output 1089; 13 Calli 1090; 1 Tochtli 1091; 2 Acatl 1092; 3 Tecpatl 1093; 4 Calli 1094; 5 ...

Background In Bejeweled and similar games, the player must swap any two adjacent gems (no diagonals) in an 8x8 grid of gems in order to match three of the same color in a row. The gems can be matched horizontally or vertically. Gameplay continues until there no move exists that can be made resul...

The Hamming(7,4) code goes back to 1950. Back then Richard Hamming worked as a mathematician at Bell Labs. Every Friday Hamming set the calculating machines to perform a series of calculation, and collected the results on the following Monday. Using parity checks, these machines were able to dete...

King+queen vs king checkmate in 1 code-golf chess You are given a chess position, represented either in FEN or as a two-dimensional diagram like this (the example test cases will be using the latter format): ...k.... ........ ...K.... .....Q.. ........ ........ ........ ........ In the exampl...

I am new at golfing stuff.I just found a guy on this forum that written PHP syntax used hexadecimals the hex has \x prefix and without any ascii, looks like that syntax isn't printable How could I generate php syntax like that and anyone can explain this ? anyway, here is the discussion https://c...

My problem is I have been given a set of n points and I have to determine the number of convex layers. You can check the problem here Onion Layers Question I have read some research papers regarding convex layer algorithms but I am having trouble implementing it. One Such paper is A Simple Conve...

Here's one for fans of Cabin Pressure. There is an episode in which the characters devise a new version of Fizz Buzz, which is simplified to contain absolutely no mathematics. It has these rules: If someone says "fizz", you say "buzz". If someone says "buzz", you sing "'ave a banana" If someon...

This challenge is to golf an implementation of SKI formal combinator calculus. Definition Terms S, K, and I are terms. If x and y are terms then (xy) is a term. Evaluation The following three steps will be repeated until none of them apply. In these, x, y, and z must be terms. (Ix) will be...

So I have a list stock = [5,6,8,4,8,3,6,4] val = 5 I want to get the index of the element closest to the 1st occurrence of the val variable in the list. So what I want to get will be 4 with index 3. if val = 8 then I will get 6 with index 1, if val = 3, since its the lowest value, I will get ...

Write a Crochet Pattern Generator Introduction I crochet a lot, and lately I've started writing crochet patterns. However, while I work very well from notes such as rnds 2-6 (round number = x, original number of stitches = y): *dc x-2 stitches, 2 dc in next stitch* around (xy stitches), most pu...