Math, asked by mudit6964, 9 months ago

3x³+7x²-7x-1 divided by x-1 by long division method. Please tell the answer I'll be thankful to you.

Answers

Answered by manvirkaursarai

0

Answer:

Step-by-step explanation:

Attachments:

Answered by nikhildnk

0

Answer:

HOPE YOU GET YOUR ANSWER

Attachments:

Previous Question

Next Question

Similar questions

Math, 4 months ago

3749750, the place value of 2 is Jan 13 is in the place, and 1 is in the 01. 2 is in the place, and 4 is in the 1539 861 is in the place, and is in the 1. the digit in the ten thousands place is and its place values 08 300. the digit in the lakhs place is and its place values in 249 150 the digit in the lakhs place is and that in the ten lakhs places and that of 7 and that of 615 ah) In 368.292,...

Math, 4 months ago

A sum of money doubles in 8years 4 months . Find the rate of interest. a. 8%p.a b. 12%p.a c. 16%p.a d. 20%p.a...

Hindi, 4 months ago

भेद गावाचक पिशोषण ग. दिए गए वाक्यों में से विशेषण शब्द छाँटकर लिखो और उनके भेद भी बताओ विशेषण घर में काला साँप आ घुसा है। तालाब में कुछ मछलियाँ हैं। মচেয়া; সি। एक लिटर दूध ले आओ। यह कलम मुझे दे दो। बोतल में थोड़ा पानी है। हमारा परिवार बड़ा है। कुछ सामान उधर पड़ा है। मैदान में बारह छात्र हैं। घ. नीला कपड़ा ले आओ। 63 5 व्याकरणकरण...

English, 9 months ago

i__ not surrender. fill in the suitable modal...

English, 9 months ago

Abstract noun of Free ...

Math, 1 year ago

show that x minus 3 is a factor of the polynomial x cube + x square - 17 X + 50show that x minus 3 is a factor of the polynomial x cube + x square - 17 X + 15 ...

Computer Science, 1 year ago

Slove and explain it plz...

Computer Science, 1 year ago

Travelling Salesman Problem (TSP) is a classic algorithmic problem in the field of computer science, where a set of cities and distance between every pair of cities are given and it is required to find the shortest possible route that visits every city exactly once and returns to the starting point. In terms of optimal solution, greedy algorithms are used for solving TSPs, but it becomes more...