## 19069 Reputation

14 years, 145 days

## Visualization of "Clock and Degrees" pro...

Clock:=proc(H, M)  # H and M - time in hours (0 <= H <= 23) and minutes (0<=M<60)

local A1,A2, A, B, B1, C1, C, E, F,alpha,t, T, T1, T2, P, G;

uses plottools, plots;

A1:=(irem(H,12)+M/60)*30;  A2:=M*6;

A:=circle([0,0], thickness=5);

P:=disk([0,0], 1, color=grey);

## Maple for "Clock and Degrees" problem...

Maple

Here are two procedures associated with a clock with hands. I think they are interesting not only for fun, but will be useful for teachers in schools in the preparation of such tasks.

The first procedure called  ClockHandsAngle  finds the angle between the hands of the clock at any time.

The second procedure called  TimeFromAngle , for a given angle finds all times in a given time range. The first procedure  is...

## Two sets of points in the plane...

Maple

Consider two sets in the Euclidean plane, each consisting of 4 points.

First set:  A(0, 0),  B(3, 4),  C(12, 4),  E(4, -1)

Second set:  F(0, -8),  G(12, -4),  H(9, -8),  K(4, -9)

It is easy to check that the set of all pairwise distances between the points of each of the given sets (6 numbers for each set ) are the same. At the same time it is obvious that there is no any...

## Polygons of the matches...

Maple

We assume that the length of a match is 1, then the perimeter of a polygon is equal to the number of matches N. If a match can be located at arbitrary angles to each other, then at a given perimeter of the area can take on any value between zero and the area of a regular polygon (for even number of matches) . For an odd number of matches the lower bound equals to the area of an equilateral triangle of side 1. For any given area within these boundaries will be infinitely many solutions.

## Partitions of a natural number into fact...

Maple has  combinat [composition] (n, m)  command, which returns all possible lists of positive integers of  m  terms, the sum of which in each list is n. But there is no similar command for multiplication.

Wrote recently procedure  Factoring, which solves this problem. Formal arguments:  n> 1 - an integer, m - an optional parameter...

 First 8 9 10 11 Page 10 of 11
﻿