Henri computed the first 100 decimal digits of the number 352/541 and got 0.650646950092421441774491682070240 295748613678373382624768946 39556377079482439926062846580406654 343807763401109057301294…. He saw no repeating pattern to the decimal and so concluded that the number is irrational. Do you agree with Henri's conclusion?

Intersecting secant-tangent theorem states that if a tangent segment and a secant segment are drawn to a circle from an exterior point, then the square of the measure of the tangent segment is equal to the product of the measures of the secant segment and its external secant segment.so to break it down: 1. pq acts as the tangent and ps as the secant with an intersection at p.sr = 21rp = 3x + 3pq = 4x + 4following to equation: tangent squared = the two segments multiplied by each otherso (4x + 4) ^ 2 = (3x + 3) • (21) simplifies to 16x^2 - 31x - 47 = 0 or (16x - 47)(x + 1) x = -1 or x = 47/162. pq acts as the tangent and ps as the secant with an intersection at p (again! )sr = 16rp = xpq = 15(15) ^ 2 = 16 • x225 = 16xx = 225/163. the interesting chords are proportional to each other so a ratio is possible to set up: ap dp 10 3 + x = = —— = pc pb 8 xcross multiple to get 10x = (3 + x)(8)x = 12

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

1 the 1st term, 3 the 2nd term, 6 the 3rd term,etc.

note the following:

from the 1st term (1) to the 2nd term (3), we go up by 2,from the 2nd term (3) to the 3rd term (6), we go up by 3from the 3rd term (6) to the 4th term (10), we go up by 4, andfrom the 4th term (10) to the 5th term (15), we go up by 5.

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for