We'd like to factorize a semiprime N. The goal of this challenge is to find two small integers u and v such that u*v*N can be trivially factorized with Fermat's method, thus allowing to easily deduct the factors of N. The task Given a semiprime N and a positive integer k, we define x and y as: ...

public class Test { public static void main(String[] args){ int number = 84; int factor = 4; boolean state = true; for (factor = 4; ; factor += 5){ String multiply = number * factor + ""; for(int index = 0; index <=multiply.length() - 1; ++in...

You've been Thunderstruck! Background A "fun" drinking game is based on the classical hard rock song by AC/CD: Thunderstruck. The Thunderstruck drinking game starts when the song starts. When the word "thunder" is heard, the first person starts drinking, not stopping until the word "thunder" is...

Your program must: - Take a date as input, in 8 figure format (day or month, month or day, year) - Take input of a string of any length. - Shift the first letter by the first figure of the date, the next letter by the next number, etc. Start again at the first number after 8 alphabetic characters...

My boss just told me to write a cosine function. Being a good math geek, my mind immediately conjured the appropriate Taylor Series. cos(x) = 1 / 1! - x^2 / 2! + x^4 / 4! - x^6 / 6! + ... + (-1)^k x^(2k) / (2k)! + ... However, my boss is very picky. He would like to be able to specify exactly ...

Write the shortest code to calculate the Clebsch-Gordan coefficients for the expansion of the state with spin S and spin projection m into states with spins S1 and S2.

The task Quite simple: given three user inputs of points A, B and C (each point requiring a user input of an x and y coordinate); find the origin of a circle that goes through all three points and print the result. Rules It must work for any input. Print the x and y coordinate of the circle's...

Compute the Fermat-Torricelli Point code-golfgeometrymath The Fermat-Torricelli point is the point P of a triangle that minimizes the sum of its distances to the three vertices A,B,C i.e. P = argmin |A-P| + |B-P| + |C-P| You might know this definition from the gemetric median. But unlike the...