« Vrati se
Let a_i, b_i be coprime positive integers for i = 1, 2, \ldots , k, and m the least common multiple of b_1, \ldots , b_k. Prove that the greatest common divisor of a_1 \frac{m}{b_1} , \ldots, a_k \frac{m}{b_k} equals the greatest common divisor of a_1, \ldots , a_k.

Slični zadaci

(GBR 2) Let a, b, x, y be positive integers such that a and b have no common divisor greater than 1. Prove that the largest number not expressible in the form ax + by is ab - a - b. If N(k) is the largest number not expressible in the form ax + by in only k ways, find N(k).
(GBR 1) The polynomial P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k, where a_0,\cdots, a_k are integers, is said to be divisible by an integer m if P(x) is a multiple of m for every integral value of x. Show that if P(x) is divisible by m, then a_0 \cdot k! is a multiple of m. Also prove that if a, k,m are positive integers such that ak! is a multiple of m, then a polynomial P(x) with leading term ax^kcan be found that is divisible by m.
(FRA 6) Consider the integer d = \frac{a^b-1}{c}, where a, b, and c are positive integers and c \le a. Prove that the set G of integers that are between 1 and d and relatively prime to d (the number of such integers is denoted by \phi(d)) can be partitioned into n subsets, each of which consists of b elements. What can be said about the rational number \frac{\phi(d)}{b}?
(FRA 1) Let a and b be two nonnegative integers. Denote by H(a, b) the set of numbers n of the form n = pa + qb, where p and q are positive integers. Determine H(a) = H(a, a). Prove that if a \neq b, it is enough to know all the sets H(a, b) for coprime numbers a, b in order to know all the sets H(a, b). Prove that in the case of coprime numbers a and b, H(a, b) contains all numbers greater than or equal to \omega = (a - 1)(b -1) and also \frac{\omega}{2} numbers smaller than \omega
(CZS 4) Let K_1,\cdots , K_n be nonnegative integers. Prove that K_1!K_2!\cdots K_n! \ge \left[\frac{K}{n}\right]!^n, where K = K_1 + \cdots + K_n
(CZS 2) Let p be a prime odd number. Is it possible to find p-1 natural numbers n + 1, n + 2, . . . , n + p -1 such that the sum of the squares of these numbers is divisible by the sum of these numbers?