let A_1 A_2 ...A_n a regular polygon of n sides
with length l each, let X a point such
that A_1 X=x∙l where 0<x<1 (as shown)
what is the length of the shortest path
begins fromX touching all sides once
and ends at X
(there′s a problem shape can′t be loaded)
App updates:
Version 2.094 has been uploaded
to playstore:
Enhancements:
• paste plain text
• Auto wrapping of lines (settings)
• New construct as shown below.
strike thru
underline
underbrace
font size for selected text
page breaks to split images
These new constructs are disabled
while posting in forum to allow all
users time to update app
Any issues you can report by email,
telegram or as a comment to this
post.
Lets p ∈N and n∈N^∗
A_n =2^n +p and d_n =PGCD(A_n ,A_(n+1) )
1) show that d_n /2^n
2)determine the parity of A_n as a function of that of p
3)determine the parity of d_n as a function of that of p
4)deduce pgcd(2^(2009) +2009,2^(2010) +2009)