No products in the cart.

Ask questions which are clear, concise and easy to understand.

Ask Question
  • 1 answers

Nitin Chaudhary 5 years, 6 months ago

Equations kha h
  • 1 answers

Suryansh Singh 5 years, 6 months ago

That's depends how you see it! In short for finding LCM we have to just see the common multiple of both and the common multiple
  • 1 answers

Dinesh Kumar Yadav 5 years, 6 months ago

Let price of 1book of 9th class be rs. X Price of 1 book of 10th class be rs. Y According to the question, Sangeeta buy 2 books of 9th and 3 books of 10th. 2x + 3y = 250 ...(i) Mince buy 4 books of 9th and 6 book of 10th 4x + 6y = 500 ....(ii)
  • 1 answers

Suryansh Singh 5 years, 6 months ago

For that u have 2 draw graph
  • 1 answers

Suryansh Singh 5 years, 6 months ago

Not yet mentioned by CBSE. Be updated in cbse.nic.in
  • 1 answers

Mansi Mishra 5 years, 6 months ago

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, they are the GCD of the original two numbers. By reversing the steps, the GCD can be expressed as a sum of the two original numbers each multiplied by a positive or negative integer, e.g., 21 = 5 × 105 + (−2) × 252. The fact that the GCD can always be expressed in this way is known as Bézout's identity. The version of the Euclidean algorithm described above (and by Euclid) can take many subtraction steps to find the GCD when one of the given numbers is much bigger than the other. A more efficient version of the algorithm shortcuts these steps, instead replacing the larger of the two numbers by its remainder when divided by the smaller of the two (with this version, the algorithm stops when reaching a zero remainder). With this improvement, the algorithm never requires more steps than five times the number of digits (base 10) of the smaller integer. This was proven by Gabriel Lamé in 1844, and marks the beginning of computational complexity theory. Additional methods for improving the algorithm's efficiency were developed in the 20th century. The Euclidean algorithm has many theoretical and practical applications. It is used for reducing fractions to their simplest form and for performing division in modular arithmetic. Computations using this algorithm form part of the cryptographic protocols that are used to secure internet communications, and in methods for breaking these cryptosystems by factoring large composite numbers. The Euclidean algorithm may be used to solve Diophantine equations, such as finding numbers that satisfy multiple congruences according to the Chinese remainder theorem, to construct continued fractions, and to find accurate rational approximations to real numbers. Finally, it can be used as a basic tool for proving theorems in number theory such as Lagrange's four-square theorem and the uniqueness of prime factorizations. The original algorithm was described only for natural numbers and geometric lengths (real numbers), but the algorithm was generalized in the 19th century to other types of numbers, such as Gaussian integers and polynomials of one variable. This led to modern abstract algebraic notions such as Euclidean domains.
  • 2 answers

Ashish Yadav 5 years ago

Solve it bro

Yuktarani Parashar 5 years, 6 months ago

2 is a rational number so we can't prove it as irrational
  • 0 answers
  • 1 answers

Govind Singh 5 years, 6 months ago

English fist fight
  • 1 answers

Chahat Singh 5 years, 6 months ago

6/4root3=3/2root3 =(root3)^2/2root3 =root3/2
  • 1 answers

Yogita Ingle 5 years, 6 months ago

Lemma is a proven statement used for proving another statement while algorithm is a series of well defined steps which gives a procedure for solving a type of a problem.
Euclid's division lemma: For given any positive integers a and b there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b.
Euclid's division algorithm is used for finding the Highest Common Factor of two numbers where in we apply the statement of Euclid's division lemma.

  • 2 answers

Yogita Ingle 5 years, 6 months ago

100x 2-20x+1 =0

100x 2 - 10x - 10x + 1 =0

10x(10x - 1) - 1(10x - 1) = 0

(10x - 1)  (10x - 1) = 0

x = 1/10

Mamta Rawat 5 years, 6 months ago

This snswer may be x=1/10
  • 0 answers
  • 1 answers

Mansi Mishra 5 years, 6 months ago

Let x be any positive integer, then it is of the form 3q, 3q + 1 or 3q +2. Now, we have to prove that the squre of each of these can be written in the form 3m or 3m +1. Now, (3q)2=9q2=3(3q2)=3m, where m=3q2 (3q+1)2=9q2+6q+1 =3(3q2+2q)+1 = 3m + 1, where m=3q2+2q and, (3q+2q)2=9q2+12q+4 =3(3q2+4q+1)+1 = 3m + 1, where m=3q2+4q+1 Hence, the result.
  • 3 answers

Miss__ Thakur 5 years, 6 months ago

HOPE THIS WOULD HELP U TO UNDERSTAND ??

Miss__ Thakur 5 years, 6 months ago

For understanding u, terminating means decimal ke baad jb no. Pura complete ho jayata hai...then that no.is terminating no.for eg. 34525/2 = 17262.5 WHEREAS non terminating vo hote hai jiska end na ho ...i mean jo continuously chalte rehete hai.... for eg. If there is any no. When we divide the no. Not ends...let it may be 4.090090009900009...........so on.......

Sreejitha R 5 years, 6 months ago

Integers are positive and negative whole numbers including zero, such as {-3, -2, -1, 0, 1, 2, 3}. When these whole numbers are written in the form of ratio of whole numbers it is known as rational numbers. So, rational numbers can be positive, negative or zero. So, a rational number can be expressed in the form of p/q where ‘p’ and ‘q’ are integers and ‘q’ is not equal to zero. Rational Numbers in Decimal Fractions: Rational numbers can be expressed in the form of decimal fractions. These rational numbers when converted into decimal fractions can be both terminating and non-terminating decimals. Terminating decimals: Terminating decimals are those numbers which come to an end after few repetitions after decimal point. Example: 0.5, 2.456, 123.456, etc. are all examples of terminating decimals. Non terminating decimals: Non terminating decimals are those which keep on continuing after decimal point (i.e. they go on forever). They don’t come to end or if they do it is after a long interval. For example: π = (3.141592653589793238462643383279502884197169399375105820974.....) is an example of non terminating decimal as it keeps on continuing after decimal point. If a rational number (≠ integer) can be expressed in the form p2n×5m, where p ∈ Z, n ∈ W and m ∈ W, the rational number will be a terminating decimal. Otherwise, the rational number will be a nonterminating, recurring decimal.
  • 3 answers

Aryan Mishra 5 years, 6 months ago

An=a+(n-1)d

Drip ? Drop? 5 years, 6 months ago

An=a+(n-1)d khush chini

Keerthana Chinnu 5 years, 6 months ago

Any one answer this
  • 3 answers

Bharat Dashora 5 years, 6 months ago

because composite factors have more than 2 factors so means both nos. are composite

Anisha Tickoo 5 years, 6 months ago

Don't use abusive language

Anisha Tickoo 5 years, 6 months ago

Behave yourself
  • 1 answers

Sunny Singh 5 years, 6 months ago

225 = 135 ×1+90 135 =. 90 ×1+45 90 =. 45 ×2+0 The divisior at this stage is 45. The HCF of 135 and 225 I hope you can understand this question
  • 1 answers

Anuj Kansana 5 years, 6 months ago

The several parts of an algebraic expression separated by( +,-)operations is called term
  • 0 answers
  • 1 answers

Yogita Ingle 5 years, 6 months ago

Let first term be a and common diffrence be d

now,

S7 = 7/2(2a+(7-1)d)

119 = 7/2(2a+6d)

119 = 7/2*2(a+3d)

119/7 = a+3d

17=a+3d .........................(1)

Also,

S17 = 17/2(2a+(17-1)d

714 = 17/2*2(a+8d)

714/17 = a+8d

42 = a+8d..........................(2)

Subtracting (1) from (2)

42-17 = a+3d-a-8d

25 = -5d

d = -5

putting d= -5 in (1)

17 = a+ 3(-5)

17 = a-15

17+15 = a

a = 32

Now, a= 32 , d= -5

Sn = n/2{2×32+ (n-1)-5}

Sn = n/2(64-5n+5)

Sn = n/2(69-5n)

Sn = 69n/2 - 5n^2/2

  • 5 answers

Archana Singh 5 years, 6 months ago

Idk

Fear Fighter 5 years, 6 months ago

God ne

Fear Fighter 5 years, 6 months ago

H

Anuj Kansana 5 years, 6 months ago

Archimedes

Rishabh Singh 5 years, 6 months ago

Maine

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App