Discover How to Solve Non Calc Paper Question with Prime Numbers | Thx

  • Thread starter Thread starter thomas49th
  • Start date Start date
  • Tags Tags
    Paper
Click For Summary

Homework Help Overview

The discussion revolves around expressing the number 40 in the form of 2m x n, where both m and n are prime numbers. Participants explore various methods to arrive at the values of m and n, particularly focusing on the implications of using prime factorization and the limitations of different approaches.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss trial and error methods for determining m and n, questioning the efficiency of such approaches for larger numbers. Some suggest writing out factors of 40 to narrow down possibilities for m, while others mention the potential for more systematic methods like Modular Arithmetic.

Discussion Status

The discussion is active, with participants sharing different methods and reasoning. Some guidance has been offered regarding the use of factorization and systematic approaches, though there is no explicit consensus on the best method. The exploration of various techniques indicates a productive dialogue.

Contextual Notes

Participants note that the problem is likely from a GCSE paper, suggesting that simpler methods may be acceptable given the context and the size of the number involved.

thomas49th
Messages
645
Reaction score
0
Hi, I have a question

tThe number 40 can be written as [tex]2^m[/tex] x n, where m and n are prime numbers

I managed to guess that m = 3 and n = 5 by trials and error by using low prime numbers. Is this the proper/best way to work out the answer. If not can someone show me a proper way

Thx
 
Physics news on Phys.org
Your way works, because it got you the right answer, but consider what if the number was larger. The way I would do it, which is just one way of many, would be to write out the factors of 40 = {1x40, 2x20, ... , 40x1}. Since you know that 2^m can at most be 40, and also must be prime (meaning the first factor can only be 2^2, 2^3, 2^5 (which is not in the set of factors so it can be discarded)), that will narrow down the options of m, and from there you can find which of the 2 options of n will give the right factors. 4x10 (no!), or 8x5 (yes!)

My way would only work for numbers relatively small though because you don't to do a bunch of factors for numbers in tens of thousands. There could be something better out there with logarithms or systems of equations.
 
Last edited:
Yes there are better ways using Modular Arithmetic i think, but this is a GSCE or something paper, and considering as don't learn logs, I think they'll be fine with the guess and check for now, which is probably why they've been given a small number.
 
Scratch last comment, I found an easier, yet systematic method that doesn't require guess and check.

[tex]40 = 2^m \cdot n[/tex].

Repeated divide by 2.
[tex]20=2^{m-1}\cdot n[/tex]
[tex]10=2^{m-2} \cdot n[/tex]
[tex]5=2^{m-3}\cdot n[/tex]

Since 5 can not be divided by 2 any further, this is the lowest you can reduce it. Since 2 is obviously not a factor, m-3 must be zero, or m=3. And its also obvious to see n then must be 5. HAPPY SUNSHINE :D:D:D
 

Similar threads

Replies
20
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
33
Views
5K
  • · Replies 3 ·
Replies
3
Views
661
  • · Replies 2 ·
Replies
2
Views
2K
Replies
39
Views
6K
  • · Replies 3 ·
Replies
3
Views
2K