Math, asked by neelimajonnadula311, 8 months ago

how many no of diameters can be formed in a circle​

Answers

Answered by anindyaadhikari13
1

Answer:

There are infinite number of diameters that can be formed in a circle.

Step-by-step explanation:

Hope it helps you...Please mark this answer as the brainliest and follow me.

Answered by shiva0064
0

Answer:

here is your ans bhai plz mark me as brainly

Step-by-step explanation:

The distance from the center to a point on the circle is called a radius. Every circle has an infinite number of possible diameters. The formula for finding the diameter of a circle is two times the radius (2 * radius).

Previous Question
Next Question
Similar questions
Math, 4 months ago
please solve it very urgent please​...
English, 4 months ago
Discribe the changes that Stephen had notice inside evan’s cell...
Math, 4 months ago
Sn= 3n2-4n find n pls give me right answer​...
English, 8 months ago
CaNazrul Islam Activity: 2 Select the Masculine Gender, Feminine Gender, Neuter Gender and Common Gender in the following sentences and put them in correct columns: i) Suraiya is my sister. ii) Riju and Sumit are friends. il) Rocky is a dog. iv) There is a clock on the wall. Masculine Gender Feminine Gender Neuter Gender Common Gender​...
Math, 8 months ago
please help me guys....... ​
Hindi, 11 months ago
Ling badlo of Acharya in Hindi​...
Math, 11 months ago
Find the smallest number by which 1100 must be multiplied so that the product becomes a perfect square. Also, find the square root of the perfect square so obtained. By what smallest number must 180 be multiplied so that it becomes a perfect square? Also, find the square root of the number so obtained.​
Computer Science, 11 months ago
36. (a) Find the output of the following program: #include<iostream.h> #include<ctype.h> typedef char Str80[80]; void main() { char *Notes; Str80 Str = "vR2GooD" ; int L = 6; Notes = Str ; while(L >= 3) { Str[L] = (isupper(Str[L]) ? tolower(Str[L]) : toupper(Str[L])); cout << Notes << endl; L--; Notes++; } }​...