#Grade 10 Circles.

84 messages · Page 1 of 1 (latest)

gritty sundial
#

So in the picture P,Q,R,S are points on a circle centred at O and <PSQ = 130°.
Find <PRQ, <POQ, , <OPQ

(Idk what category this belongs to)

#

someone help i got a whole worksheet to complete rn 🥲

stoic canopy
#

Circle theorems will be of great help here, example:

gritty sundial
#

PQRS is a cyclic quadrilateral

gritty sundial
#

All the edges of the quadrilateral are touching the circle

#

Sum of opposite angles of a cyclic quadrilateral is 180°

#

so <PRQ will be 180-130?

#

Yup

#

okay so <POQ?

gritty sundial
#

Angle subtended by a chord/arc at the centre is double the angle subtended by it at any other point on the circle

#

Oh so

#

2x50

#

or 2x <PRQ

#

how am i gonna find <OPQ tho

halcyon trail
#

note that OP and OQ are radii of the circle

#

therefore OPQ is isoceles, with <OPQ = <OQP

#

we already know one angle

#

and what the angles in a trangle add up to

#

so just solve

gritty sundial
#

ie

#

50°?

halcyon trail
#

no?

gritty sundial
#

ok wait

#

40?

halcyon trail
#

yes

gritty sundial
#

YESS

#

ty

gritty sundial
# gritty sundial ty

The property of isosceles triangle and the property of cyclic quadrilateral and the angle at the centre theorem are very useful, so just keep them handy

amber obsidianBOT
#

@burnt ocean has given 1 rep to @surreal parrot

gritty sundial
#

how do i give the other guy rep

#

wtvr

gritty sundial
amber obsidianBOT
#

@surreal parrot has given 1 rep to @burnt ocean

gritty sundial
#

@halcyon trail thanks

amber obsidianBOT
#

@burnt ocean has given 1 rep to @halcyon trail

gritty sundial
#

another question idk if i can ask here

#

but

#

does 100 and 999 leave remainder 2 when divided by 7?

#

does not have to be the last division

halcyon trail
#

find the least multiple less than that

#

if you want you can also use modulus properties to get the remainder

gritty sundial
#

it has to be a 3 digit number

#

999÷7 = 142 with a reminder of 5

#

999-5 is the biggest 5 digit number divisible by 7

#

994

#

@gritty sundial

#

no like

#

999÷7

#

gives 2

#

wait

halcyon trail
#

wdym gives 2

gritty sundial
#

there's one 7 in 9

#

so

#

9-7

#

2

#

like that

#

U don't see the last digit only

#

U see the number as a whole

#

4 isn't divisible by 7 but 14 is

#

nono

#

the question isnt check if its divisible or not

halcyon trail
#

can you send a screenshot of the problem

gritty sundial
#

Yeah

#

I'll type it instead

#

That'll work

#

Consider the sequence of three digits numbers which leaves a remainder 2 on division by 7.
a) Find first term
b) Find last term

halcyon trail
#

oh

gritty sundial
#

arithmetic sequence

halcyon trail
#

well 999 = 5 (mod 7)

#

so 2 (mod 7) = 5 - 3 ( mod 7)

#

or 999 - 3

#

so 996

#

996 = 2 (mod 7)

gritty sundial
#

First term = 100
Last term= 996

halcyon trail
#

102 leaves remainder of 4

gritty sundial
#

Wait yeah

#

ye

#

first term is 100

#

and last term is 996

#

thanks again @halcyon trail @gritty sundial