Preview

MATHS FYUP QUESTION BANK

Better Essays
Open Document
Open Document
2164 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
MATHS FYUP QUESTION BANK
1. Explain any encryption- decryption technique. Use it to encrypt and decrypt ‘INDIA IS MY COUNTRY’.
Ans:

2. Make a grid of natural numbers from 400-500. Find all the prime numbers in the grid. Identify all pairs of twin primes in the grid that you have made. Can all the prime numbers identified by you in the grid be represented as 6n-1 or 6n+1, where n is a natural number? Justify your answer.
Ans:
Here is how to prove your observation: take any integer n greater than 3, and divide it by 6. That is, write n = 6q + r
Where q is a non-negative integer and the remainder r is one of 0, 1, 2, 3, 4, or 5.
If the remainder is 0, 2 or 4, then the number n is divisible by 2, and cannot be prime.
If the remainder is 3, then the number n is divisible by 3, and cannot be prime.
So if n is prime, then the remainder r is either
1 (and n = 6q + 1 is one more than a multiple of six), or
5 (and n = 6q + 5 = 6(q+1) - 1 is one less than a multiple of six).
Remember that being one more or less, than a multiple of six does not make a number prime. We have only shown that all primes other than 2 and 3 (which divide 6) have this form.
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499

500

3. Let p be any prime number and a&b be any two natural numbers. Justify what all possible values a and b take to satisfy
a)
b)
c)
d)

4. Categorize following into Primary and Secondary data sources:

Magazines----- Secondary Newspaper-----

You May Also Find These Documents Helpful

  • Good Essays

    First, I thought the answer would be forty-nine. Then, I realized my mistake and tried to think of different ways to do it. I decided to make a chart showing the remainders of the numbers two to six into multiples of seven. I then started to find a pattern. I noticed that the number two has a remainder of one every other multiple of seven, the number three has a remainder of one every two multiples, the number four has a remainder of one every three multiples, and so on. I marked a dot every time there was a remainder of one. I knew that when I had dots marked from two through seven, that would be the answer. So I set out on the long journey of calculating when there was a remainder of one until I reached a number that was all filled up.…

    • 404 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    Pn = 3.2 n −1 Which is a multiple of 3 Qn = 6 n − 3 = 3(2n − 1) Which is also a multiple of 3 Since Tn = Q2 k −1 or Tn = P2 k for all n ∈ N , Tn is always divisible by 3…

    • 7470 Words
    • 30 Pages
    Powerful Essays
  • Satisfactory Essays

    Nt1310 Unit 1 Lab Report

    • 510 Words
    • 3 Pages

    Therefore the only numbers n that can possibly lead to primes are those that have no odd factors greater than…

    • 510 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    18. Find all integers x, if there exist any, such that the following are true:…

    • 522 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Say the prime numbers in this series: 2, 3, 4, 5, 6. 2, 3, 5…

    • 2120 Words
    • 9 Pages
    Satisfactory Essays
  • Good Essays

    module 3 math dba notes

    • 2147 Words
    • 10 Pages

    The trinomial can be factored by looking for factors of 6 that add up to 5.…

    • 2147 Words
    • 10 Pages
    Good Essays
  • Good Essays

    Broken Eggs

    • 948 Words
    • 4 Pages

    So we started with 21 (the first multiple of seven that ends with a one or a six) and found you couldn't divide by three and have one left over. We went up by sevens until we found 56 (but when we divided by two we didn't have one left over) and 91 (but when we divided by 4 we didn't have one left over) and 136 (which didn't work for two) until we figure out we could go up by 35 to reach the next multiple of seven that ends with a one or a six.…

    • 948 Words
    • 4 Pages
    Good Essays
  • Good Essays

    eci 114

    • 754 Words
    • 7 Pages

    4), which is even. If n is odd, then n  2k  1. Therefore 3n2  8  3(2k …

    • 754 Words
    • 7 Pages
    Good Essays
  • Better Essays

    Mat 126 Week 1 Assignment

    • 1084 Words
    • 5 Pages

    n = the number of terms together; n = 9 (because the CB radio tower will be 90 feet high. One term are 10 feet, so 90 feet are 9 terms)…

    • 1084 Words
    • 5 Pages
    Better Essays
  • Good Essays

    Mathswatch Higher Worksheets Aw

    • 22653 Words
    • 475 Pages

    MathsWatch Worksheets HIGHER Questions and Answers ©MathsWatch www.mathswatch.com mathswatch@aol.co.uk © MathsWatch Clip No 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 Name of clip Factors, Multiples and Primes Evaluate powers Understand squares, cubes, roots Equivalent fractions Simplification of fractions Put fractions in order Value for money Percentage of an amount with a calculator Percentage of an amount without a calculator Change to a percentage with a calculator Change to a percentage without a calculator Find a fraction of an amount Addition and subtraction of fractions Multiply and divide fractions Change fractions to decimals BODMAS Long Multiplication of Decimals Ratio Recipe type ratio questions Hard calculator questions Real-life money questions Generate a sequence from the nth term Substitution Alternate angles Angle sum of a triangle Properties of special triangles Finding angles of regular polygons Area of circle Circumference of circle Area of compound shapes Rotations Reflections Enlargements Translations Find the mid-point of a line…

    • 22653 Words
    • 475 Pages
    Good Essays
  • Satisfactory Essays

    common divider and its possibilities. The numbers need to be considered, are they prime or…

    • 511 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Problem of the Week

    • 587 Words
    • 3 Pages

    Process: In the process of attempting to solve this problem, I first figured out that I would have to find a number that leaves a remainder of 1 when divided by 2, 3, 4, 5, and 6 but is evenly divisible by 7. I noticed I only need to look at numbers that were a multiple of 7.…

    • 587 Words
    • 3 Pages
    Good Essays
  • Good Essays

    ap stats

    • 498 Words
    • 5 Pages

    2. A medical study of heart surgery investigates the effect of a drug called a beta-blocker on the pulse rate of…

    • 498 Words
    • 5 Pages
    Good Essays
  • Good Essays

    alex turner

    • 2019 Words
    • 9 Pages

    ( 2 3 . . . k 1 ) or ( 3 4 . . . k 1 2 )…

    • 2019 Words
    • 9 Pages
    Good Essays
  • Satisfactory Essays

    Bit-Sum Prime

    • 284 Words
    • 2 Pages

    Every student, who has learned programming, must have written a program to determine whether a given positive integer is a prime number. Basically in order to determine whether a positive integer n is prime, we search for any number in the range [2, n − 1] which can divide n. Some of you would have designed a slighly better implementation where you search √ for any divisor of n from the range [2, n ]. Does either of these two implementations correspond to an efficient algorithm ? Ponder over this question deeply. Let us try to design an efficient algorithm for a problem which looks as simple and innocent as the problem discussed above. First, we give a definition. Definition 1. A positive integer is said to be bit-sum prime if the sum of the bits in its binary representation is a prime number. For example 6(110), 14(1110) are bit-sum prime numbers, whereas 29(11101) is not a bit-sum prime number. Design and implement an algorithm which receives a 64-bit integer n and outputs the count of all the bit-sum prime numbers less than n. Test it for a really large number, for example, execute your algorithm for 123456789123456789. Hint: Your algorithm/program is NOT supposed to enumerate all the bit-sum prime numbers. Instead, it has to just report the count of all the bit-sum prime number. Hence the output will be just a single number. Notice that you will have to use clever programming skills also in this problem.…

    • 284 Words
    • 2 Pages
    Satisfactory Essays

Related Topics