An "Egyptian fraction" is a list of distinct fractions with a numerator of \$1\$. For example:
\$
\frac 1 1+ \frac 1 2 + \frac 1 3 + \frac 1 6
\$
The "size" of an Egyptian fraction is just the number of terms involved.
Your task is to take a positive integer \$n\$ and output the smallest Egypti...
@PyGamer0 any medical professional born after 1993 can't professionally medicine...all they know is Mayo clinic, charge they patients, eat hot chip and lie
Euler Irregular Primes
Your challenge is to find all Euler Irregular Primes (A prime p is Euler-irregular if it divides an Euler number E(2n) with 0<2n<p−1) under n.
Scoring
Your goal is to have the fewest points the points are given by the amount of seconds it takes to generate the first 1,000 E...
@GingerIndustries When they go to the doctor, encode the book you want to give them or a CAD of the gift or whatever using DNA, then insert that DNA into their body
kill their gift many years before their house is built, and bury it underground there, so once the house gets built the ghost of their gift will haunt them
import sys
code_page = "|¬°!1\"2#3$4%5&6/7(8)9=0?'\\¿¡\tq@wertyuiopasdfghjklñzxcvbnmQWERTYUIOPASDFGHJKLÑZXCVBNM¨´+*~{}^`[],.-_:;<>éýúíóáÉÝÚÍÓÁèùìòàÈÙÌÒÀêûî"
code_page += "ôâÊÛÎÔÂ\nëÿüöïäËÜÖÏÄᐍᐎᐓᐗᎾᚁᚂᚃᚄᚅᚆᚇᚈᚉᚊᚋᚌᚍᚎᚏᏔᏕᏖᏗᏘᏙᏚᏛᏜᏝᏞᏟᏠᏡᏢᏣᏤᏥᏦᏧᏨᏩᏪᏫᏬᏭᏮᏯᏰᏱᏲᏳᏴᏵᏸᏹᏺᏻᏼᏽᎳᎴᎵᎶᎷᎸᎹᎺᎻᎼᎽᎿᏀᏁᏂᏃᏄᏅᏆᏇᏈᏉᏊᏋᏌᏍᏎᏏᏐᏑᏒᏓ×ĀāĂ㥹ĆćĈĉĊċČčĎaĐ"
with open(sys.argv[1], 'rb') as file:
code = file.read()
code = "".join(code_page[i] for i in code)
@thejonymyster this fact can actually be quite useful in bracket-related golf, because when if you're making a checksum of sorts using the character values, you can choose if you want them to be off by one or two
Move to Right and left
Task
Your task is to Move Right and left. If the numbers combine, sum.
Example
[1, 2]
/\ /\
/ X \
[1, 2, 1, 2]
Another example
[1, 2, 3]
/\ /\ /\
/ X X \
[1, 2,\/ \ \
4, 2, 3]
Test cases
[1,2,3] => [1,2,4,2,3]
[4,2] => [4,2,4,2]
[1] => [1,0,1]...
An "Egyptian fraction" is a list of distinct fractions with a numerator of \$1\$. For example:
\$
\frac 1 1+ \frac 1 2 + \frac 1 3 + \frac 1 6
\$
The "size" of an Egyptian fraction is just the number of terms involved.
Your task is to take a positive integer \$n\$ and output the smallest Egypti...
Move to Right and left
Task
Your task is to Move Right and left. If the numbers combine, sum.
Example
[1, 2]
/\ /\
/ X \
[1, 2, 1, 2]
Another example
[1, 2, 3]
/\ /\ /\
/ X X \
[1, 2,\/ \ \
4, 2, 3]
Test cases
[1,2,3] => [1,2,4,2,3]
[4,2] => [4,2,4,2]
[1] => [1,0,1]...
