meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 8 months |
| seen | May 16 at 2:36 | |
| stats | profile views | 6 |
|
Jan 5 |
awarded | Student |
|
Jan 5 |
awarded | Scholar |
|
Jan 5 |
accepted | Non Self Intersecting Polygons? |
|
Jan 5 |
comment |
Non Self Intersecting Polygons? @AndréNicolas I want to know given any random non collinear points is it always possible to construct a non self-intersecting closed polygon. |
|
Jan 5 |
asked | Non Self Intersecting Polygons? |
|
Dec 15 |
awarded | Supporter |
|
Dec 23 |
comment |
RSA: mulitple key exchanges i thought he was asking about time complexity of rsa algorithm |
|
Dec 22 |
answered | RSA: mulitple key exchanges |
|
Dec 21 |
awarded | Teacher |
|
Dec 21 |
comment |
Approach GCF and LCM problems if the number can be represented as powers of prime factors (p^a*q^b) then number of factors is (a+1)*(b+1) is number of divisors mathschallenge.net/library/number/number_of_divisors see this for finding factors i corrected my mistake |
|
Dec 21 |
awarded | Editor |
|
Dec 21 |
revised |
Approach GCF and LCM problems edited body |
|
Dec 21 |
answered | Approach GCF and LCM problems |
