Reminder and quotient

There are given the number C = 281, D = 201. Find the highest natural number S so that the C:S, D:S are with the remainder of 1,

Correct answer:

S =  40

Step-by-step explanation:

C=281 D=201  C1=C1=2811=280 D1=D1=2011=200  280=2357 200=2352 GCD(280,200)=235=40  S=GCD(C1,D1)=GCD(280,200)=40



We will be pleased if You send us any improvements to this math problem. Thank you!






avatar




Tips to related online calculators
Do you want to calculate greatest common divisor two or more numbers?
Need help to calculate sum, simplify or multiply fractions? Try our fraction calculator.
Do you want to perform natural numbers division - find the quotient and remainder?

Related math problems and questions:

  • Reminder and quotient
    prime_4 There are given numbers A = 135, B = 315. Find the smallest natural number R greater than 1 so that the proportions R:A, R:B are with the remainder 1.
  • Coloured numbers
    olympics_2 Mussel wrote four different natural numbers with coloured markers: red, blue, green and yellow. When the red number divides by blue, it gets the green number as an incomplete proportion, and yellow represents the remainder after this division. When it div
  • Quotient
    math Find quotient before the bracket - the largest divisor 51 a + 34 b + 68 121y-99z-33
  • Tissues
    harmasan The store got three kinds of tissues - 132 children, 156 women and 204 men. Tissues each species were packed into boxes after the number of pieces the same for all three types (and greatest). Determine the number, if you know that every box has more than
  • Sports students
    numbers_39 There are 120 athletes, 48 volleyball players, and 72 handball players at the school with extended sports training. Is it possible to divide sports students into groups so that the number in each group is the same and expressed by the largest possible num
  • Gardens colony
    kolonie Gardens colony with dimensions of 180 m and 300 m are to be completely divided into the same large squares of the highest area. Calculate how many such squares can be obtained and determine the length of the square side.
  • School books
    sesity At the beginning of the school year, the teacher distributed 480 workbooks and 220 textbooks. How many pupils could have the most in the classroom?
  • Pegs
    meter_1 From two sticks 240 cm and 210 cm long, it is necessary to cut the longest possible pegs for flowers so that no residues remain. How many pegs will it be?
  • MO C–I–1 2018
    numbers_49 An unknown number is divisible by just four numbers from the set {6, 15, 20, 21, 70}. Determine which ones.
  • The balls
    balls_4 You have 108 red and 180 green balls. You have to be grouped into the bags so that the ratio of red to green in each bag was the same. What smallest number of balls may be in one bag?
  • Bricks pyramid
    The_Great_Pyramid How many 50cm x 32cm x 30cm brick needed to built a 272m x 272m x 278m pyramid?
  • Triangle
    heron1 Determine whether we can make a triangle with the given side lengths. If so, use Heron's formula to find the area of the triangle. a = 158 b = 185 c = 201
  • LCD 2
    zlomky_6 The least common denominator of 2/5, 1/2, and 3/4
  • Groups
    children2_1 In the 6th class there are 60 girls and 72 boys. We want to divide them into groups so that the number of girls and boys is the same. How many groups can you create? How many girls will be in the group?
  • Diofant equation
    diofantos In the set of integers (Z) solve the equation: ? Write result with integer parameter ? (parameter t = ...-2,-1,0,1,2,3... if equation has infinitely many solutions)
  • Bundle of candies
    bonbons_3 In the store has 168 chocolates, caramel candies 224 and 196 hard candies. How many packages we can do and how many of candies will be in each package?
  • Children's home
    jablka The children's home received a gift to Nicholas of 54 oranges, 81 chocolate figurines, and 135 apples. Every child received the same gift and nothing was left. a) How many packages could be prepared? b) what did the children find in the package?