![Jackie Pollina](/img/default-banner.jpg)
- 126
- 137 840
Jackie Pollina
Приєднався 16 бер 2022
I'm a full-time SAT & ACT test prep tutor and college essay coach. I am the co-founder of J&J Test Prep (yes - I am the first "J" of the "J&J" part). On this channel, I'll be making videos of SAT/ACT prep content and test walkthroughs, college essay advice, study tips, and general business advice for fellow business owners. Happy viewing :)
Can you interpret an SAT® word problem? #shorts
SAT® Help ⬇️
SAT® 8-Week Live Course with Brooke of SupertutorTV on UA-cam (starts 04/16): www.jjtestprep.com/satintensive
SAT® Power Hours: www.jjtestprep.com/sat-power-hours
SAT® Crash Course: www.jjtestprep.com/satcrashcourse
SAT® 8-Week Live Course with Brooke of SupertutorTV on UA-cam (starts 04/16): www.jjtestprep.com/satintensive
SAT® Power Hours: www.jjtestprep.com/sat-power-hours
SAT® Crash Course: www.jjtestprep.com/satcrashcourse
Переглядів: 158
Відео
Can you get this hard SAT® ratio / geometry question?
Переглядів 132Рік тому
Can you get this hard SAT® ratio / geometry question?
AVOID These 7 Cliché College Essay Topics
Переглядів 1982 роки тому
AVOID These 7 Cliché College Essay Topics
Why I Commuted to College *STORY TIME*
Переглядів 762 роки тому
Why I Commuted to College *STORY TIME*
ACT® English: Last Minute Tips & Tricks
Переглядів 5032 роки тому
ACT® English: Last Minute Tips & Tricks
SAT® English: Last Minute Tips & Tricks
Переглядів 5242 роки тому
SAT® English: Last Minute Tips & Tricks
Can You Solve This *DIFFICULT* SAT® Systems Question?
Переглядів 1172 роки тому
Can You Solve This *DIFFICULT* SAT® Systems Question?
Systems of Equations: Word Problems *With a Full-Time SAT® Tutor*
Переглядів 722 роки тому
Systems of Equations: Word Problems *With a Full-Time SAT® Tutor*
SAT® Math: Sunday Challenge Problem #6
Переглядів 762 роки тому
SAT® Math: Sunday Challenge Problem #6
Systems of Equations: Substitution *With a Full-Time SAT® Tutor*
Переглядів 922 роки тому
Systems of Equations: Substitution *With a Full-Time SAT® Tutor*
Systems of Equations: Elimination *With a Full-Time SAT® Tutor*
Переглядів 732 роки тому
Systems of Equations: Elimination *With a Full-Time SAT® Tutor*
SAT® Math: Sunday Challenge Problem #5
Переглядів 802 роки тому
SAT® Math: Sunday Challenge Problem #5
SAT® Comparison Questions with a *FULL-TIME* SAT® Tutor
Переглядів 2512 роки тому
SAT® Comparison Questions with a *FULL-TIME* SAT® Tutor
SAT® / ACT® Math: Shading Inequalities
Переглядів 1452 роки тому
SAT® / ACT® Math: Shading Inequalities
SAT® Math: Sunday Challenge Problem #4
Переглядів 742 роки тому
SAT® Math: Sunday Challenge Problem #4
How to Approach an ACT® English Passage
Переглядів 1422 роки тому
How to Approach an ACT® English Passage
SAT® Add / Delete Questions with a *FULL-TIME* SAT® Tutor
Переглядів 5102 роки тому
SAT® Add / Delete Questions with a *FULL-TIME* SAT® Tutor
SAT® Math: Sunday Challenge Problem #3
Переглядів 872 роки тому
SAT® Math: Sunday Challenge Problem #3
SAT® Exponents Got Nothin' on Us *With a Full-Time SAT® Tutor*
Переглядів 1272 роки тому
SAT® Exponents Got Nothin' on Us *With a Full-Time SAT® Tutor*
Doing SAT® Math Problems People *ARGUE* With Me About on TikTok
Переглядів 1112 роки тому
Doing SAT® Math Problems People *ARGUE* With Me About on TikTok
SAT® Math: Sunday Challenge Problem #2
Переглядів 822 роки тому
SAT® Math: Sunday Challenge Problem #2
College Essay Coach *RIPS* High School Common App Essay to *SHREDS*
Переглядів 652 роки тому
College Essay Coach *RIPS* High School Common App Essay to *SHREDS*
Full-Time SAT® Tutor Walks You Through SAT® Grammar Passage
Переглядів 3312 роки тому
Full-Time SAT® Tutor Walks You Through SAT® Grammar Passage
SAT® Math: Sunday Challenge Problem #1
Переглядів 862 роки тому
SAT® Math: Sunday Challenge Problem #1
SAT® Math: The Median Position Formula
Переглядів 5812 роки тому
SAT® Math: The Median Position Formula
SAT® English: Colons and Dashes with a *Full-Time* SAT® Tutor
Переглядів 5402 роки тому
SAT® English: Colons and Dashes with a *Full-Time* SAT® Tutor
Can You Solve This *HARD* SAT® Math Problem?
Переглядів 2092 роки тому
Can You Solve This *HARD* SAT® Math Problem?
Conquer SAT® Trigonometry with a *Full-Time* SAT Tutor
Переглядів 2462 роки тому
Conquer SAT® Trigonometry with a *Full-Time* SAT Tutor
SAT® Sentence Movement STRATEGIES From a *Full-Time* SAT® Tutor
Переглядів 2602 роки тому
SAT® Sentence Movement STRATEGIES From a *Full-Time* SAT® Tutor
whats a double dash mean
try 12 credits mee
Proof 2nd loop impossible in Collatz Conjecture on UA-cam AND yandex, link in video description ua-cam.com/video/P5gemS2j7R0/v-deo.htmlsi=JT_nSPRJl-A8fUEi c
She really posted that on TIKTOK 🤣
This is like shuffling BTW, but it can work because it "tries to approach" 4x I should go test how would it really go if i switch that 3 with other 2^n-1
You don't end with the number 1. You end with a loop of 4-2-1.
This is just playing semantics. The word "end" was the wrong word to use here, unless it's being used as a definition that we stop when reaching one (which isn't unrealistic in this framing since the framing is pretty scarce in this video). But anyway, a better phrasing would be to say that it always reaches 1. This is of course true of 4 and 2 as well, but 1 sounds better.
Everyone:"You are crazy if you try to solve Collatz" Pov me who is thinking he solved it but don't want to double check my papers so it is not proven wrong.
Jackie i think i solved it!!!
Just change 1 + 1 to equal 3, the unity of 2 creates something new a third, do this and 3n + 1 becomes infinite
Ain’t 2 an odd number or am I trippin
I said 5 bc I read trial 5 as 5 trials😭😭
same 💀💀
LOL me
Sex is better than this
To get 1 you neek a number in the powers of 2. If you get any odd number and ×3 & +1 you get an even number~1,4 3,10 5,16 (you allways add 6 as you add 1 to make an even number, by 2 and ×3) halving resets it to an odd number. I think.
Any numbers that are produced by these sequences (7/8 of all of them) decrease (n is any integer >=0). You can generate these infinitely. The lower ns may end up thrown off thanks to the increase by +1, but there is an n(per sequence) where it starts being true and its pretty low and calculable. In order for the conjecture to be true all numbers must decrease. If a number decreases it is not the lowest number in a loop (all loops must have a unique lowest number and therefore can be identified by that value alone). Similarly if a number decreases it is not the lowest number to go off to infinity which would also be the easiest identifiable case. 2n 4n+1 16n+3 32n+11 32n+23 128n+? (3 of them) 256n+? (7 of them) 1024n+?(12 of them)
2 is not equal to one
are you talking about the fraction 2/2?
If we do with 0,0/2=0 we wont get 1.
Positive numbers. 0 is not considered positive.
That’s evil
Am I the only who I is upset by they way she writes the sequence? 16/2 = 8/2 = 4/2 = 2/2 stands for 8 = 4 = 2 = 1. This is obvisiouly false.
Notation is about communication. Communicate properly and all sorts of notation is used for all sorts of things.
that show only 1 creator
Any odd number multiplied by 3 always become odd number, the second clause only lead you back on the first clause.
3n+1. You add 1 making it even. Divide and from there it can either be even or odd. The base cases for these 2 types of behavior 1>1*3+1>4>2 2>2/2>1
Ratio is 4/3 0.75, always decrease 1. Is based on musical ratio. change the formula reverse , 3x add 1 and multiply by 2. Very strange is on the tesseract with Tengente/Pythagore.
1/2 numbers are reduced to about 1/2 (2n) 1/4 are reduced to about 3/4 (4n+1) There are infinite numbers of these equations with all ratios of 3^a/2^b. Some of course meaning having decreased and others not.
@@piercexlr878 first number decrease is based on 5 and last max number is based on 7, this formula is for a tesseract, 4 d formula..
@Marc.2.0 It's an even or odd game. 5s and 7s don't have a major impact. Your big players are powers of 2 and multiples of 3, depending on your approach.
I solved it years ago 😅
nope u didn't
Did you get this question correct ?
I think that the science act is so dumb, because I’m taking college level science courses, like ap chem, and the science portion has like nothing to do with science it’s just “can you read a graph” and I always overthink this portion of the test and get a bad score,
It's a race. Look at the numbers in the answers, look at the numbers in the info, and go with your gut.
They can’t make it too specialized either or it would just become unfair so reading graphs is really the only fair way they can do this.
Ive already mastered the art of collatz… but i havent found another loop, other than the 4,3,2,1 loops, and negative loops.
it’s 421 loop dude..
Try solve gravity with math
Wdym solve gravity
It’s obvious.. I learnt this in year 5 at school. Multiply a number by itself 3 times it’ll always be odd. Plus one will make it even. Because every time it’s an odd number you add 1, and every even number you change nothing - you’ll eventually reach 2 which halves into one.
Do you really think 5th grade you is smarter than some of the worlds greatest mathematicians? your "solution" is literally you just saying that "yeah you'll reach 2 eventually i guess"
Fuck are you yapping about lil bro
The problem is the Loop itself,The negative has 3 loop and positive has only one
"you'll eventually reach 2 which halves into one" doesn't make any sense in mathematics. What we need is a proof not a belief
That doesn’t prove there isn’t another loop with very large numbers or that some starting number can’t spin off to infinity. If you wanted a sequence that is guaranteed to have at least N steps I can quickly give you such a number no matter how big N is. But without testing the whole sequence I can’t promise that it doesn’t just keep growing forever.
Actually there is a prove
Can we do decimals though? Like 24.2? It’s divisible by 2 🤔
Pretty sure positive whole numbers
no becuase its not even or odd because of the decimal
Only positive integers. If you allow fractions then EVERY number is divisible by two.
1.對於任意正整數 只要會收斂到1 就逃不出4->2->1的循環 所以只需證明收斂到1即可 2.所有正偶數必定收斂成正奇數 所以只需證明所有正奇數會收斂到1 3.(3x+1)必為偶數且必定小於等於4x 此處初始值x為任意正奇數 所以迭代函數對奇數的放大率至少是3/2=1.5且必定小於等於2 而此迭代函數對於偶數的收斂率卻是2的次冪永遠大於等於2 所以不論輸入的初始常數多大 最終迭代函數必定會出現收斂到1的情況 詳細的證明過程網路上找得到 說完了
Still didn't solve it yet however what you just said is absolutely correct
Jee adv chemistry be like who are u ??😂
this is so dumb fr but we still have to give it to apply to forgein unis
If we’re unlucky, the conjecture is undecidable like the continuum hypothesis…
It's very good. My son is preparing for ACT exam. Could you tutor her?❤
It's very good. My son is preparing for ACT exam. Could you tutor her?
Very clear. Thank you. I bought your book and my daughter finished it.
Because they were waiting for Me.
you are just amazing
The answer is 0
There are many problems in mathematics that have not yet been proven right or wrong. The "collatz conjecture" or more commonly known as "the 3x + 1 problem", which is considered to be one of the most basic of these problems and was first put forward as an idea by the German mathematician Lohar Collatz in 1937, is one of them. this problem is also referred to as one of the most 'dangerous' problems with both amateur and professional mathematicians taking up a lot of their time.
The most interesting aspect of this problem is that anyone with a basic knowledge of arithmetic can easily understand the problem. The problem is simply: Let's take any natural number x. ie x; Any of the numbers 1, 2, 3, 4, ... If x is an even number, let's divide this number by 2, so we get the number x/2; If x is an odd number, let's multiply this number by 3 and add 1, so we get 3x + 1. Let's apply the same process again to this new number we obtained, and similarly, let's continue by applying this process to the number we obtained later. If we continue in this way, the problem says that we will eventually reach the number 1.
Let's take the number 12 as an example. if we apply this operation to 12: 12 -> 6 -> 3 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1 and we get the number 1. If attention is paid, if we continue to apply this process after reaching the number 1, it becomes 1 -> 4 -> 2 -> 1 and we enter an endless loop. Therefore, the important thing here is to reach the number 1 at least once. World-renowned Hungarian mathematician Paul Erdos for this problem said, "Mathematics is not yet ready for such problems." and the american mathematician jeff lagarias, "this is a very difficult problem that we will never be able to solve with today's mathematics." he said.
As of 2020, all numbers up to 2^68 (2 to the 68th) have been tested using computers, and no number has been found to falsify the conjecture. This is one of the most important arguments for many mathematicians that the conjecture is highly likely to be true, even if it does not provide a mathematical proof for the conjecture. This problem remains unresolved to date, despite hundreds of published and unpublished articles (including numerous erroneous evidence) written about it.
@@huseyinkagantoy5469It’s not really an argument at all. You can easily construct a polynomial that has a thousand zeroes beyond 2^68, so checking that it has no zeroes below that means jack. The question is, reformulated, does the sequence inevitably reach a power of 2 even though those are increasingly rare as the numbers in the sequence increase.
@@magicmulder 3n+1 tends to infinity so you will always reach a power of 2 no matter the density
If you want to contribute to this theorem you need to start at the next number past 2^68th because we solved everything before that.
Just one power close
Actually 2^100000 -1.
Who is “we?” Is that you and your lame friends or something? I solved this problem all the way up to 2^92nd when I was in solitary confinement, just to have something to do to pass the time. It gets pretty boring being in the hole, after a while. I don’t wish that torture on anyone. I did nearly 2 full days in there, all alone, and it was awful. I just about lost my mind.
@@chriswebster24uh
@@chriswebster24 um,1; there are 6-7 months gap bettwen your reply and the comments. 2, did you publish the problems you solved anywhere?
The problem becomes: Can we for any given number always get to 2ⁿ where n is a positive number. Maybe play around with really high values of n and then divide it by 3 and subtract 1 (the inverse of 3n+1)
And then look for patterns
It comes down to probability - does the increasing sparseness of powers of 2 “win” or does the infinite sequence eventually hit a power of 2.
I guess a follow up question is "Is there a number that forms a closed loop that does not contain 2^n?" which has been no until 2^68 so far.
@@Fahad-21 Indeed, if the sequence doesn't end up at 1, it can either grow infinitely or enter a loop above 1. Which of the two, if any, or both, apply is the question.
Actually, not 2^n. 3x+1=2^n, so ×=(2^n-1)/3. If n=even, there is a natural number x that satisfies the equation, but not for odd. so, does every number reach (4^n-1)/3? Then, let's think about later one, written as x' = 2(4^n-1)/3 (which is 2x) or (x-1)/3. This gives us an infinite form. x(a) = 2(x(a-1)) or x(a-1)/3. But, there are some problems. f(a) has tooooo many cases. (2^a) (This is way too big on large numbers)
Awesome ❤
Great video - very to the point!
I FIGURED WHAT THIS IS...
Hi Jackie! I am Nathan, and I just finished up your 8-week intensive with Brooke. I was usually with Savannah, so we both teamed up on the zooms. I want to say thank you so much for your time. This was my first SAT prep course, and I learned so many techniques I never would have known before. You were clear in your instruction and easy to follow. I hope to learn more from you in the future!
I am so glad to hear you learned so much!!
Should we be prepared for HOT level questions?
Wow is this how basic America is?
No, it’s how easy it is to plow through your mother on a Sunday night
No. The ACT is a standardized test like the MCAT, SAT, LSAT, CSAT, etc. If you know how these tests work, they have multiple subjects and a time limit and are made so everyone has some sort of chance. The ACT in particular for a section like math is organized from easy, medium, to hard level questions. This is just the science section though. The ACT also has really tough time limits compared to the SAT.
Lol the main problem ain't about the difficulty level of papers but actually the time management which makes it ten times harder..u can't even give a minute to each mcq esp for english u can max give 30 seconds to each mcq
I SERIOUSLY need to make a 20 on my act tomorrow
yeah, because they don't breed like pest thus having less competition.
Great video!
Thanks Kyle!!
I feel like it’s all a game…nothing is straightforward. I have two teenage boys that are 15. Can you please guide us, and where we should get started to study for the SATs? You’ve opened my eyes that we need to get started now, just not sure what resources to use!
Absolutely! Send me an email at contact@jjtestprep.com, and I can guide you :)
Positive or zero!