(more info)
Math for the people, by the people.
donor list
-
find out how
Encyclopedia
|
Requests
|
Forums
|
Docs
|
Wiki |
Random
|
RSS
Advanced search
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions
meta
Requests
(237)
Orphanage
Unclass'd
Unproven
(550)
Corrections
(54)
Classification
talkback
Polls
Forums
Feedback
Bug Reports
downloads
Snapshots
PM Book
information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Forum: General Questions - High School/Secondary
Welcome to the General Questions - High School/Secondary forum!
For discussing questions from any discipline at high school/secondary school level.
[
back to forums top
]
Discussion
Style:
Flat
Threaded
Expand:
all
none
1
2
3
4
5
6
7
8
9
Order:
Oldest First
Newest first
forum policy
jump to page: 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
>>
of 53 (262 items)
Formula for a pattern
by
zee
on 2010-02-04 14:21:14
Can you come up with a formula for the following sequence of numbers:
1 , 3 , 5 , 11 , 21, 43 , 85 , 171 , ...
[
reply
|
up
]
Re: Formula for a pattern
by pahio
on 2010-02-04 17:08:25
Re: Formula for a pattern
by zee
on 2010-02-04 17:42:17
Re: Formula for a pattern
by pahio
on 2010-02-04 20:39:51
Re: Formula for a pattern
by Mathprof
on 2010-02-04 20:44:21
Re: Formula for a pattern
by perucho
on 2010-02-09 15:19:44
bivariate analysis
by
anirban_mandal
on 2010-02-01 11:24:00
suppose we are given two random variables X and Y.
how can we prove the following proposition:-
If Cov(X,Y)=0 , X and Y are independent if and only if each of X and Y take oat most two distinct values.
[
reply
|
up
]
Re: bivariate analysis
by mathman
on 2010-02-01 21:37:32
sum of sequence
by
anirban_mandal
on 2010-01-29 13:48:48
what is the sum of the following sequence as a function of 'n'.
1*1! + 2*2! + 3*3! + ...... + n*n!
would be a great help if someone could say how i should approach the problem.
[
reply
|
up
]
Re: sum of sequence
by mathman
on 2010-01-29 21:54:06
sum of divisors
by
anirban_mandal
on 2010-01-25 11:37:21
let S(n) denote the sum of the divisors of n including 1 and itself.
let [.] denote the floor function.
then how can we prove the following result :-
S(1)+S(2)+.....+S(n)= 1*[n/1] + 2*[n/2] + .... + n*[n/n]
[
reply
|
up
]
Re: sum of divisors
by perucho
on 2010-01-26 11:13:53
Solution Process
by
Menzess
on 2009-12-25 11:55:04
When a number is divided by 5,remainder is 4.When the same number is divided by 4,remainder is 3 & so on that when divided by 2,remainder is 1.What's the number ?
I know the answer is 59.
But I want to know the process of solving this problem.
[
reply
|
up
]
Re: Solution Process
by pahio
on 2009-12-25 13:46:53
Re: Solution Process
by Menzess
on 2009-12-25 18:25:23
Re: Solution Process
by perucho
on 2009-12-26 15:08:32
Re: Solution Process
by dh2718
on 2009-12-27 07:56:18
Re: Solution Process
by perucho
on 2009-12-27 08:50:06
jump to page: 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
>>
of 53 (262 items)
Interact
post