Task
Write a program/function that when given three 2d points in cartesian coordinates as input outputs a truthy value if they are collinear otherwise a falsey value
Three points are said to be collinear if there exists a straight line that passes through all the points
You may assume that the co...
Sexy Primes are pairs of numbers (n, m) such as n and m both are prime, and m = n + 6.
You need to create a function which will take an integer, check for sexy primes from 0 to that integer, and return an array of arrays.
For example, listSexy(30) must return [[5,11], [7,13], [11,17], [13,19], ...
Music with pi and e(eulers number)
pimusiccode-golf
Because I forgot to celebrate the pi-day(14.3) lets celebrate with pi, e and music!
Challenge
No, we don't have time to eat a pi-pizza, lets make a program.
What you need is 500 digits of pi, and 10 digits of e.
The User gives any digit from 0-...
Your task is to turn a square root like this:
√12
into a form like this:
2√3
For our purpose, we only need to output the left number here:
2
Specifications
If the number is already a perfect square, do this:
√4 = 2√1 -> 2
If the number doesn't contain perfect squares, do this:
√13 = 1√13 -> 1...
Task
Given a positive integer return the geologic era and period it was that many million years ago.
Input/output
The inpt is a string or integer; the output is a string. Eras and periods are separated by slashes.
Data
The first level of quotes represents the era, and the second is the period.
(...
Definition
The problem goes like this:
Count the number of characters in your code, say n
Find all the Fibonacci numbers upto n.
Convert all the Fibonacci numbers to ASCII characters (8 bit i.e mod 256)
If any of the non-control characters in this list occurs in your code add the ASCII val...
Sexy Primes are pairs of numbers (n, m) such as n and m both are prime, and m = n + 6.
You need to create a function which will take an integer, check for sexy primes from 0 to that integer, and return an array of arrays.
For example, listSexy(30) must return [[5,11], [7,13], [11,17], [13,19], ...
Your task is to turn a square root like this:
√12
into a form like this:
2√3
For our purpose, we only need to output the left number here:
2
Specifications
If the number is already a perfect square, do this:
√4 = 2√1 -> 2
If the number doesn't contain perfect squares, do this:
√13 = 1√13 -> 1...
Definition
The problem goes like this:
Count the number of characters in your code, say n
Find all the Fibonacci numbers upto n.
Convert all the Fibonacci numbers to ASCII characters (8 bit i.e mod 256)
If any of the non-control characters in this list occurs in your code add the ASCII val...
