Correct answer: the first choice !
The answer is 30 days.
The solution for this is to find the least common multiple.
By getting the multiple of both numbers.
Multiples of 2: 2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40…..
Multiples of 15: 15,30,45,60,75……..
The Least Common Multiples of 2 and 15 is 30. So, Inez will
do them both again in 30 days.
The least common multiple (LCM) of two numbers is the
smallest number that is multiple by the both number.
Answer:
Algorithm
Start
Int n // To represent the number of array
Input n
Int countsearch = 0
float search
Float [] numbers // To represent an array of non decreasing number
// Input array elements but first Initialise a counter element
Int count = 0, digit
Do
// Check if element to be inserted is the first element
If(count == 0) Then
Input numbers[count]
Else
lbl: Input digit
If(digit > numbers[count-1]) then
numbers[count] = digit
Else
Output "Number must be greater than the previous number"
Goto lbl
Endif
Endif
count = count + 1
While(count<n)
count = 0
// Input element to count
input search
// Begin searching and counting
Do
if(numbers [count] == search)
countsearch = countsearch+1;
End if
While (count < n)
Output count
Program to illustrate the above
// Written in C++
// Comments are used for explanatory purpose
#include<iostream>
using namespace std;
int main()
{
// Variable declaration
float [] numbers;
int n, count;
float num, searchdigit;
cout<<"Number of array elements: ";
cin>> n;
// Enter array element
for(int I = 0; I<n;I++)
{
if(I == 0)
{
cin>>numbers [0]
}
else
{
lbl: cin>>num;
if(num >= numbers [I])
{
numbers [I] = num;
}
else
{
goto lbl;
}
}
// Search for a particular number
int search;
cin>>searchdigit;
for(int I = 0; I<n; I++)
{
if(numbers[I] == searchdigit
search++
}
}
// Print result
cout<<search;
return 0;
}
The angle the radius makes with AB is a right angle, so the Pythagorean theorem applies.
r² = 17.4² - 7² = 253.76
r = √253.76 ≈ 15.9
The length of radius r is about 15.9.
