Math, asked by manvi4995, 6 months ago

the sum of two number is 95 if one exeeds other by 15. find the other numbers

Answers

Answered by Thanks2013

18

Step-by-step explanation:

1st number = x

2nd number = 15+ x

Sum of two numbers = 95

Equation = x + 15 + x = 95

= 2x + 15 = 95

15 will go to other side

= 2x = 95 - 15

= 2x = 80

2 will go to other side

= x = 80/2

= x = 40

Therefore 1st number is 40

2nd number is x + 15

= 40 + 15

= 55

Verification = 40 + 55 = 95

Previous Question

Next Question

Similar questions

English, 3 months ago

value of discipline . very important for life _ order for system _ without it no progress _ discipline I nature _ important everywhere _ family school army _ we should _ remain in discipline.

Math, 3 months ago

complete it solid/ hemisphere , volume/____,curved surface area/____, total surface area ______...

Math, 3 months ago

1 If x + - = 4, find the value of X х 1 ( + (a) x2 2.एफ एक्स प्लस वन अपऑन एक्स इज इक्वल टू 4 फाइंड द वैल्यू ऑफ एक्स स्क्वायर प्लस वन अपॉन एक्स स्क्वायर ...

English, 6 months ago

Imagine that you are going to Mysore on a class trip. Write about what you want to take with you. What you plan to do there and how excited you are to go with your friends.

English, 6 months ago

20. The family decided to build a new house [Here, (decided ) is.......] * O a. Verb O b. Noun c. Preposition O d. Infinitive...

Computer Science, 9 months ago

Given an array of integers. Write a program to find the k-th largest sum of contiguous subarray within the array of numbers which has negative and positive numbers.

Computer Science, 9 months ago

Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i. For example, if our input was [1, 2, 3, 4, 5], the expected output would be [120, 60, 40, 30, 24]. If our input was [3, 2, 1], the expected output would be [2, 3, 6]. Follow-up: what if you can't use division?

Computer Science, 9 months ago

Given an array of integers a and an integer b, find and return the number of pairs in a whoes sum is divisible by b. Since the answer may be large, return the answer modulo (10^9 + 7). Input format...