function confirmModerate(url,num,pid){ url = url + '?Comments[do]=mod&Comments[pid]=' + pid + '&Comments[id]=' + num + '#Comments_' + num; if (confirm('Do you want to report this comment as inappropriate?')) location.href=url; return 0; } function validate_form(frm) { var value = ''; var errFlag = new Array(); _qfMsg = ''; value = frm.elements['Comments[name]'].value; if (value == '' && !errFlag['name']) { errFlag['name'] = true; _qfMsg = _qfMsg + '\n - Please enter your name'; } value = frm.elements['Comments[captcha]'].value; if (value == '' && !errFlag['captcha']) { errFlag['captcha'] = true; _qfMsg = _qfMsg + '\n - Please enter Security Code'; } value = frm.elements['Comments[mail]'].value; if (value == '' && !errFlag['mail']) { errFlag['mail'] = true; _qfMsg = _qfMsg + '\n - Please enter your e-mail'; } var regex = /^((\"[^\"\f\n\r\t\v\b]+\")|([\w\!\#\$\%\&'\*\+\-\~\/\^\`\|\{\}]+(\.[\w\!\#\$\%\&'\*\+\-\~\/\^\`\|\{\}]+)*))@((\[(((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9])))\])|(((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9])))|((([A-Za-z0-9\-])+\.)+[A-Za-z\-]+))$/; if (value != '' &&!regex.test(value) && !errFlag['mail']) { errFlag['mail'] = true; _qfMsg = _qfMsg + '\n - E-mail address format is invalid'; } value = frm.elements['Comments[text]'].value; if (value == '' && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Please enter your comment'; } if (value.length<50 && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Comment is too short (50 characters min.)'; } if (value.length>4000 && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Comment is too long (4000 characters max)'; } if (_qfMsg != '') { _qfMsg = 'Invalid information entered:' + _qfMsg + '\nPlease correct these fields.'; alert(_qfMsg); return false; } return true; } //]]>

Division without envy

Article Abstract:

A problem in division in which participants divide a piece of cake and results in fair shares which are 'envy-free' is proposed. An algorithm for envy-free division is sought because envy-free divisions are always fair but a fair division is not always envy-free.

Author: Stewart, Ian

Publisher: Scientific American, Inc.
Publication Name: Scientific American
Subject: Science and technology
ISSN: 0036-8733
Year: 1999

Mathematical recreations, Division, Division (Mathematics)

User Contributions:

Comment about this article or add new information about this topic:

Squaring the square

Article Abstract:

Several ingenious solutions have been provided in resolving the problem of squaring rectangles or squares with square tiles of different sizes. One of the remarkable solutions was presented by J.W. Bouwkamp and his colleagues, which totalled to only 15 tiles.

Author: Stewart, Ian

Publisher: Scientific American, Inc.
Publication Name: Scientific American
Subject: Science and technology
ISSN: 0036-8733
Year: 1997

Geometry, Square, Squares (Geometry)

User Contributions:

Comment about this article or add new information about this topic:

Subjects list: Tests, problems and exercises

Similar abstracts:

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.