Pre-Cal

[Anonymous No.10411378]

Hey guys, I'm trying to do homework and study for Pre-Calculus but my teacher doesn't teach and there are no examples like the problems I'm supposed to do in either of my textbooks or resources I can find online. Does anyone know how to do any of these problems?

[Anonymous No.10411384]

>>10411378
here's a tip:

|x-4| = x-4 only for x≥4

[Anonymous No.10411387]

>>10411378
>there are no examples like the problems I'm supposed to do

Good. You should be solving problems based on understanding and not copying the steps from the examples.

[Anonymous No.10411394]

>Floyd, Robert W., “Assigning meanings to programs,” Proceedings of Symposia in Applied Mathematics, Vol. 19 (1967), pages 19–32.
http://www.eecs.berkeley.edu/~necula/Papers/FloydMeaning.pdf

>Hoare, C. A. R., “An axiomatic basis for computer programming,” Communications of the ACM, Vol. 12, No. 10 (1969), pages 576–583.
https://www.cs.cmu.edu/~crary/819-f09/Hoare69.pdf

>Hoare, C. A. R., “Proof of a Program: FIND,” Communications of the ACM, Vol. 14 (Jan. 1971), Pages 39-45.
https://www.cs.cmu.edu/~crary/819-f09/Hoare71.pdf

>Keshav's How to Read a Paper
http://ccr.sigcomm.org/online/files/p83-keshavA.pdf

>Error Detecting and Error Correcting Codes by R. W. Hamming
http://www.lee.eng.uerj.br/~gil/redesII/hamming.pdf

>A Case for Redundant Arrays of Inexpensive Disks (RAID) by David A. Patterson, Garth Gibson, Randy H. Katz
http://www.eecs.berkeley.edu/Pubs/TechRpts/1987/CSD-87-391.pdf

>The Mathematical Theory of Communication by Claude Shannon
http://worrydream.com/refs/Shannon%20-%20A%20Mathematical%20Theory%20of%20Communication.pdf

>Communication Theory of Secrecy Systems by Claude Shannon
http://netlab.cs.ucla.edu/wiki/files/shannon1949.pdf

>The UNIX Time-Sharing System by Dennis M. Ritchie and Ken Thompson
http://people.eecs.berkeley.edu/~brewer/cs262/unix.pdf

>A Fast File System for UNIX by Marshall Kirk Mckusick, William N. Joy, Samuel J. Leffler, Robert S. Fabry
http://people.eecs.berkeley.edu/~brewer/cs262/FFS.pdf

>The Emperor's Old Clothes by C.A.R. Hoare
http://zoo.cs.yale.edu/classes/cs422/2014/bib/hoare81emperor.pdf

>On Computable Numbers, with an Application to the Entscheidungsproblem by Alan Turing
http://classes.soe.ucsc.edu/cmps210/Winter11/Papers/turing-1936.pdf

>On the Computational Complexity of Algorithms by Hartmanis and Stearns
http://fi.ort.edu.uy/innovaportal/file/20124/1/60-hartmanis_stearns_complexity_of_algorithms.pdf

[Anonymous No.10411429]

>>10411378
>>>/wsr/

[Anonymous No.10411494]

>>10411387
I would normally agree but there isn't a supplement for an understanding of a course I haven't taken before. How are you supposed to know something you haven't learned yet?

[Anonymous No.10411507]

>>10411494
This is nothing you can't figure out from pure reasoning.

[Anonymous No.10411598]

>>10411494
Here's the intuition for #1 and #2: >>10411384
plug some numbers in for x and see. think about it. when does |x-4| = (x-4), and when does |x-4| = -(x-4) ?

for #3 draw a number line to help you visualize it.
put a at position 6.
then figure out where m should go.
then where b should go.

this may take you some time and some mental effort. don't shy away from the work needed to wrap your mind around this shit or you're never going to make it
also try clicking the "eBook" button