Questions about number-theory
Read more about number-theory
python (12.9k questions)
javascript (9.2k questions)
reactjs (4.7k questions)
java (4.2k questions)
java (4.2k questions)
c# (3.5k questions)
c# (3.5k questions)
html (3.3k questions)
How to maximize the GCD of n positive integers with minimum number of removals from the sequence that represents them?
I'm trying to solve a competitive programming task which I cannot find out effective solution to tackle the last 5 test cases with.
You are given with t (t >= 1 && t <= 5) inquiries each...
user17970898
Votes: 0
Answers: 2
Modulo of factorial divided by factorial
How to calculate a!/(b1! b2! ... bm!) modulo p, where p is a prime number? The factorial of a and b can be very big (long long int is not sufficient) so I need to pass to modulo.
Farah Mind
Votes: 0
Answers: 2
find maximum GCD of an array of triplets
you are given an array of triplets of size N, we have to choose one number from each triplet, forming a new array of N size, such that the GCD of the numbers in the new array is maximum.
example:
an a...
ayushi
Votes: 0
Answers: 1
Compute only most significant half of GF(2)[X] polynomial (or integer) product efficiently?
I know about Karatuba's algorithm and other even more efficient ways to multiply two large polynomials or integers.
I also know that there is a "middle product" version of Karatsuba which co...
Oskar Enoksson
Votes: 0
Answers: 0