• ## Online score reduction calculator

Time：2021-11-3

Online score reduction calculator Online score reduction calculator The tool can calculate the simplest fraction form of a given score, pure client calculation. The process of converting a fraction into the simplest fraction is called fraction reduction. Fraction reduction is a fraction reduction. Divide the numerator and denominator of a fraction by the common factor […]

• ## Disembarkation algorithm leetcode weekly contest 257 problem solving Report

Time：2021-10-17

[No.1 statistical special Quad] Problem solving ideasCheck in questions, just enumerate. Code display class Solution { public int countQuadruplets(int[] nums) { int n = nums.length; int res = 0; for (int a = 0; a < n; a++) { for (int b = a + 1; b < n; b++) { for (int c = […]

• ## Online maximum common factor calculator

Time：2021-10-17

Online maximum common factor calculator Online maximum common factor calculator The tool can calculate the maximum common factor of 2 given numbers, which is calculated by pure client. The greatest common factor, also known as the greatest common divisor and the greatest common factor, refers to the largest of the common divisors of two or […]

• ## Chapter 1: pythagorean array (2)

Time：2020-12-10

Pythagorean array theorem Pythagorean array theorem: each primitive Pythagorean array (a, B, c) (where a is odd and B is even) can be obtained from the following formula: a = st\\ b = \frac{s^2-t^2}{2}\\ c = \frac{s^2 + t^2}{2} amongs>t\geq 1Is any odd number that has no common factor.The proof process is as follows:Considering the […]

• ## Chapter 5: divisibility and the greatest common factor (1)

Time：2020-12-7

Suppose m and N are integers,m\neq 0。 If n is a multiple of M, there exists an integer k such thatn= mk。 If M is divisible by N, we write it asm|n; ifmDo not dividen, we remember asm\nmid n。 For example, because6=3·2, so3|6。6The factor of is1,2,3。 Because there is no5A multiple of is equal to7, […]

• ## Chapter 5: divisibility and the greatest common factor (2)

Time：2020-12-6

Euclidean algorithm The most effective way to find the greatest common factor of two numbers is Euclidean algorithm, which consists of a series of division with remainder until the remainder is zero. Before describing the general method, we use an example to illustrate:We calculategcd(36,132)The first step is132divide36Get quotient3And remainder24。 We write it down as 132 […]