Keywords: primary; 11A05; 11A41; 11A51; secondary; 11R27; 11D99; Integer sequences; Number of distinct prime factors; Sum of powers; S-unit equations;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: primary; 11A05; secondary; 11B25; 11C08; Least common multiple; Lower bound; Polynomial sequence;
Keywords: primary; 13F07; secondary; 11A05; Euclidean rings; 2-stage Euclidean rings; Euclidean algorithm; Principal Ideal Rings; Division chains; Elementary divisor ring; K-Hermite ring; Bézout ring;
Keywords: primary; 11A05; 11A07; secondary; 05A10; 11B65; Binomial coefficients; Divisibility; WZ method;
Keywords: 11A05; GCD; Approximate GCD;
Keywords: 11A05; 11C20; 11N99; 15A36Optimization problem; Multiplicative functions
Keywords: 11A05; 11A25; 11C20; 15A23; 15B36Squarefree numbers; Gcd and lcm; Character group
Counting r-tuples of positive integers with k-wise relatively prime components
Keywords: 11A05; 11A25; 11N37k-Wise relatively prime integers; Asymptotic density; Multiplicative function of several variables; Convolution method; Error term
On the average value of the least common multiple of k positive integers
Keywords: 11A05; 11A25; 11N37Greatest common divisor; Least common multiple; Arithmetic function of several variables; Multiplicative function; Dirichlet series; Asymptotic formula
Terminating Euclidean algorithm for a non-Noetherian Bézout domain
Keywords: 11A05; 13F07; 20Gxx; 08B25Euclidean algorithm; Bézout domain; Non-Noetherian ring; Amalgamated free product structure; General linear group
A rigorous version of R.P. Brent's model for the binary Euclidean algorithm
Keywords: primary; 11A05; 11Y16; 68W40; secondary; 11Y60; 37C30; 37H99; Euclidean algorithm; Greatest common divisor; Analysis of algorithms; Transfer operator; Random dynamical system;
Fine costs for Euclid's algorithm on polynomials and Farey maps
Keywords: 11J70; 11K50; 68W40; 11A05; 62E20; 11T55Laurent formal power series; Finite field; Continued fractions; Farey map; Bit-complexity; Cost function; Combinatorial analysis; Bivariate generating functions
Modular arithmetic before C.F. Gauss: Systematizations and discussions on remainder problems in 18th-century Germany
Keywords: 01A50; 11A05; 11D04Remainder problems; Modular arithmetic; Euclidean algorithm; Euler; Hindenburg; Gauss
Decomposition orders-another generalisation of the fundamental theorem of arithmetic
Keywords: 06F05; 08A55; 08A70; 11A05; 11A51; 68Q85; Unique decomposition; Decomposition order; Fundamental theorem of arithmetic; Partial commutative monoid; Process algebra; Commutative residual algebra;