Given an integer N, the task is to find two non-negative integers A and B, such that A2 – B2 = N. If no such… Read More

# Tag Archives: Maths

Given two positive integers L and R, the task is to count the elements from the range [L, R] whose prime factors are only 2… Read More

Given an integer N, the task is to find two non-negative integers X and Y such that X4 – Y4 = N. If no such… Read More

Given the length of a side a of a triangle and its adjacent angles B and C, the task is to find the remaining two… Read More

Given an integer X, the task is to find a pair A and B such that their difference of fifth power is X, i.e., A5… Read More

Given three numbers A, B, and N, the task is to find the maximum possible value of floor(A * x / B) – A *… Read More

In Machine Learning, often what we do is gather data, visualize it, then fit a curve in the graph and then predict certain parameters based… Read More

Given an integer N, the task is to find the largest sum (a + b) {1 ≤ a ≤ N, 1 ≤ b ≤ N}… Read More

Given an array A and two integers M and K, the task is to check and print “Yes“, if the original array can be retained… Read More

Given an array of points points[] in a cartesian coordinate system, the task is to find the count of the squares that are parallel to… Read More

Fast Walsh Hadamard Transform, is an Hadamard ordered efiicient algorithm to compute the Walsh Hadamard transform (WHT). Normal WHT computation has N = 2m complexity… Read More

Inverse Fast Fourier transform (IDFT) is an algorithm to undoes the process of DFT. It is also known as backward Fourier transform. It converts a… Read More

Inverse Number Theoretic Transform is a Fast Fourier transform theorem generalization. It is obtained by the replacement of e^(-2piik/N) with an nth primitive unity root.… Read More

Number Theoretic Transform is a Fast Fourier transform theorem generalization. It is obtained by the replacement of e^(-2piik/N) with an nth primitive unity root. So… Read More