![]() |
Administrators :saucer, Iseason, us2u | |
| Forum Physiks Causali |
Not logged | Login
|
|
| Online:There are 5 online. Click here to see more | ||
Register |
Profile |
Private messages |
Search |
Online | Help
| Create a free blog | ||
![]() | ||
|
| ![]() | ![]() |
| Author : | Topic: Mathematics & Problems | Bottom |
| us2u admin Posts : 134 The only thing that goes up without coming down is your age! |
If we look for logic quite often we can find the solution but if we look too far into the subject we begin to ask ourselves too many problems so we see a prob use yourself just as a reference & deal just with that topic without reason just logic....here is a light hearted guide for all to get familiar & enjoy Maths.... http://nrich.maths.org/public/index.php --Last edited by us2u on 2006-12-27 17:09:40 -- | |||
| 'The highest wisdom has but one science'.. 'The science of the whole'.. 'The science explaining the whole creation'... and Man's place in it' In virtute sunt multi levels. - There are many degrees in e |
| saucer admin Posts : 673 A Good Tautology is Hard to Find! ![]() |
- Department of Mathematics Purdue University, Indiana. Purdue Math Problems http://www.math.purdue.edu/pow/ - --Last edited by saucer on 2007-01-13 16:53:15 -- |
| saucer admin Posts : 673 A Good Tautology is Hard to Find! ![]() |
|
| saucer admin Posts : 673 A Good Tautology is Hard to Find! ![]() |
- The On-line Journal for Mathematical Recreations In most introductions to number theory there is mention of the Sieve of Eratosthenes, which is constructed by making a list of numbers from 2 upwards as far as some number N, then striking out all multiples of the first number in the sequence (but not the number itself), then all multiples of the second remaining number in the sequence, then all multiples of the third remaining number in the sequence and so on, as far as the square root of N. The final result is a list of the prime numbers up to N. Here is a puzzle based on this sieving process. The numbers struck out beginning at p are p×2, p×3, p×4, ... that is numbers of the form p×m where the factor m is continually increased by 1 while the other p, the prime, is kept constant. Generalising this process I call a move from p×q to p×(q+1) or to p×(q–1) or to (p+1)×q or to (p–1)×q, where the unchanged factor must be a prime number, a footstep of Eratosthenes and a series of such moves a path of Eratosthenes. By permitting either factor to be varied and to increase or decrease by 1 in this way more complex paths than simple progressions are possible../ http://www.gpj.connectfree.co.uk/gpji.htm - |
| very very small tic Posts : 70 ![]() |
|
| saucer admin Posts : 673 A Good Tautology is Hard to Find! ![]() |
|
|
| ![]() | ![]() |
Get a free forum!
AceBoard Free Forum v 5.3
Download Premium Web Templates!