MedVision ad

Hard Questions (1 Viewer)

InteGrand

Well-Known Member
Joined
Dec 11, 2014
Messages
6,109
Gender
Male
HSC
N/A
I think the point is that convergence was in the syllabus before.
My Riemann zeta query was in reference to your "do you know that the Riemann Zeta function WAS actually examined in the HSC in 1975" comment. Anyway, I had a look back at buchanan's old post (http://community.boredofstudies.org/238/extracurricular-topics/102519/arc-length.html#post2220688) about old topics that have been removed, and it says that the Riemann zeta function was in the Level 1 (1966-1980) course.
 
Last edited:

Paradoxica

-insert title here-
Joined
Jun 19, 2014
Messages
2,556
Location
Outside reality
Gender
Male
HSC
2016
Yeah. Well that's hard. But jokes aside, do you know that the Riemann Zeta function WAS actually examined in the HSC in 1975? So here is a not-so-hard question - HSC 1975 4 unit Q9i:



See if you can do it.
The infinite sum is a first-order linear approximation of the following integral:



Two approximations are constructed such that they are definitively greater and lesser than the true value of the integral. Since the integral only converges for s>1, it follows that the sum only converges for s>1. QED.

This isn't a formal proof, strictly speaking, but I cbbs rn. I'll come back to patch it up later.
 

tywebb

dangerman
Joined
Dec 7, 2003
Messages
2,177
Gender
Undisclosed
HSC
N/A
My Riemann zeta query was in reference to your "do you know that the Riemann Zeta function WAS actually examined in the HSC in 1975" comment. Anyway, I had a look back at buchanan's old post (http://community.boredofstudies.org/238/extracurricular-topics/102519/arc-length.html#post2220688) about old topics that have been removed, and it says that the Riemann zeta function was in the Level 1 (1966-1980) course.
Indeed you are right (but also wrong).

The 1965 syllabus was Level 1. (And yes. Before you accuse me of a typo, I DO mean 1965, not 1966 - It was written in 1965 and first examined in 1967). Convergence was in this syllabus, but not the Riemann zeta function per se.

The 1975 HSC exam was for the 1973 syllabus which, as you say, did indeed include the Riemann Zeta function. But that was not the same as the 1965 syllabus. Perhaps buchanan was wrong to say that the Level 1 course went from 1966-1980. Actually this time frame was punctuated by a new syllabus written in 1973 and first examined in 1975.

If in doubt, always go back to the source.

So here are all the syllabuses for 4 unit so you can compare:

Level 1 (1965): http://www.angelfire.com/ab7/fourunit/level1syllabus.pdf

First 4 unit course (1973): http://www.angelfire.com/ab7/fourunit/4usyllabus1.pdf

Second 4 unit course (1980): http://www.angelfire.com/ab7/fourunit/4usyllabus2.pdf

Current 4 unit syllabus (1989): http://www.boardofstudies.nsw.edu.au/syllabus_hsc/pdf_doc/maths4u_syl.pdf
 
Last edited:

tywebb

dangerman
Joined
Dec 7, 2003
Messages
2,177
Gender
Undisclosed
HSC
N/A
Last edited:

KingOfActing

lukewarm mess
Joined
Oct 31, 2015
Messages
1,016
Location
Sydney
Gender
Male
HSC
2016
The infinite sum is a first-order linear approximation of the following integral:



Two approximations are constructed such that they are definitively greater and lesser than the true value of the integral. Since the integral only converges for s>1, it follows that the sum only converges for s>1. QED.

This isn't a formal proof, strictly speaking, but I cbbs rn. I'll come back to patch it up later.
Your way works, just evaluate the integral:



So by the integral convergence test, the series converges for s > 1
 

KingOfActing

lukewarm mess
Joined
Oct 31, 2015
Messages
1,016
Location
Sydney
Gender
Male
HSC
2016
Let D(a,b) be the number of ways to make a sum of a with b numbers.

Let our number be of the form A|B|C|D|

A can take the values 1-6

D(a,b) can take the following recurrence:

D(0,b) = 1
D(1,b) = b
D(a,1) = 1
D(a, b) = Sum n=0 to a D(n, b - 1)


It is simple to see D(a,b) = D(a-1,b) + D(a,b-1) I think that's wrong

Our sum is D(6,4) - D(6,3) (since the first digit can't be 0). Using the recurrence relation:
D(0,3) + D(1,3) + D(2,3) + D(3,3) + D(4,3) + D(5,3) = 4 + 4D(2,2) + 4D(1,2) + 4D(0,2) + 3D(3,2) + 2D(4,2) + D(5,2) = ... = 56

Hopefully right the second time, I keep making calc mistakes
 
Last edited:

Paradoxica

-insert title here-
Joined
Jun 19, 2014
Messages
2,556
Location
Outside reality
Gender
Male
HSC
2016
and also this one about counting technique:

How many whole numbers from 1000 to 9999 have 6 as the sum of their digits?
It is obvious none of the digits can be greater than 6.

So the desired integers lie between 1000 and 6000.

For the 5000's, any number greater than 5100 immediately fails.

repeating the arguments over all the thousands, we have the following intervals to analyse:

1000<=n<=1500

2000<=n<=2400

3000<=n<=3300

4000<=n<=4200

5000<=n<=5100

6000<=n<=um.

Case bash the remaining intervals in a similar fashion.

cbbs.
 

RealiseNothing

what is that?It is Cowpea
Joined
Jul 10, 2011
Messages
4,591
Location
Sydney
Gender
Male
HSC
2013
and also this one about counting technique:

How many whole numbers from 1000 to 9999 have 6 as the sum of their digits?
Since the sum of the digits must be 6, we can write it as:

1_1_1_1_1_1_

Just use the stars and bars method, since we need to put in 3 bars to represent the digits. So we get

i.e. 1_1 | 1_1 | 1 | 1 = 2211
 

Paradoxica

-insert title here-
Joined
Jun 19, 2014
Messages
2,556
Location
Outside reality
Gender
Male
HSC
2016
Since the sum of the digits must be 6, we can write it as:

1_1_1_1_1_1_

Just use the stars and bars method, since we need to put in 3 bars to represent the digits. So we get

i.e. 1_1 | 1_1 | 1 | 1 = 2211
Although the idea is good, I think the answer is not that, since multiple bars can exist next to each other
 

Drongoski

Well-Known Member
Joined
Feb 22, 2009
Messages
4,255
Gender
Male
HSC
N/A
Since the sum of the digits must be 6, we can write it as:

1_1_1_1_1_1_

Just use the stars and bars method, since we need to put in 3 bars to represent the digits. So we get

i.e. 1_1 | 1_1 | 1 | 1 = 2211
56 is also what I got.

The stars & bars method was pioneered by William Feller in his book: An Introduction to Probability Theory
 
Last edited:

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
tywebb's site has a proof of Fermat's Theorem. I don't quite get it. But it is still fascinating.
Quite a lot of background is needed to understand Wiles' proof at any greater depth than the absolute "top level overview".
 
Last edited:

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
1. By considering the cross-sections of the figure, sketch

2. If show that



Note I am using older notation here (edit here is the equivalent notation)

 
Last edited:

Carrotsticks

Retired
Joined
Jun 29, 2009
Messages
9,494
Gender
Undisclosed
HSC
N/A
1. By considering the cross-sections of the figure, sketch

2. If show that



Note I am using older notation here (edit here is the equivalent notation)

OP is a Year 12 student Extension 1. These are not in the scope of the HSC syllabus.

Also, these aren't particularly difficult problems. I am almost certain that my Year 11 class, who just learned Chain Rule less than a week ago, could do the second problem, given a 30 second introduction on how to compute partials.
 

KingOfActing

lukewarm mess
Joined
Oct 31, 2015
Messages
1,016
Location
Sydney
Gender
Male
HSC
2016
1. By considering the cross-sections of the figure, sketch
Well, it is clear z > 0. By setting z to 1 (or any other positive constant), it's clear that the horizontal cross-section is that of an ellipse, which is stretched with major axis being the y-axis. By considering y or x being constant, it is clear the shape traced is that of a parabola. Hence the shape is an "elliptic paraboloid" (is that the right term?). Basically it's like a 3-d parabola that's stretched on the y-axis.

masterful paint skills elliptic paraboloid.png
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top