1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Lynna [10]
3 years ago
8

Please help me with this question

Computers and Technology
1 answer:
grigory [225]3 years ago
5 0

Answer:

2

Explanation:

evaluate the formula for n=2, then it says:

a₂ = 2a₁ - 3·2

So

a₂ = 2·4 - 3·2 = 8-6

a₂ = 2

You might be interested in
Look at the slide. How could the slide best be improved? By reducing the number of visual aids by increasing the font size by da
azamat

Answer:

b.  by providing more information

Explanation:

5 0
3 years ago
Read 2 more answers
Consider the following pseudocode. How much time does the code take to execute? Express all answers in terms of the input variab
weeeeeb [17]

Answer:

Time the code takes to execute is O(n²)

Explanation:

The code forms an arithmetic series using it two loops.

n+(n-1)+(n-2)+........+2+1

=n(n+1)/2

=O(n²)

6 0
4 years ago
PLS HURRY!!!<br> Look at the image below!
max2010maxim [7]

Answer:

Ctrl+c

Explanation:

6 0
3 years ago
Read 2 more answers
For any two documents x and z, define k(x, z) to equal the number of unique words that occur in both x and z (i.e., the size of
mars1129 [50]

Answer:

Yes, the function k(x,z) is a kernel

Explanation:

To show that k(x,z) is a kernel.

First, we'll need to explicitly construct two features of k(x,z).

The features are:

vector φ(x) and vector φ(z) in such a way that K(x,z) =φ(x)·φ(z).

Then, we proceed to the next step...

For any given documents, a vocabulary V can be constructed.

Vocabulary V is finite size for the words in the document set.

Given V, a feature mapping φ(x) can then be constructed for x by the following:

For the kth word wk in V, if wk appears in document x, assign φ(x) k(the kth element of φ(x)) to be 1; else assign 0 to it.

Then the number of unique words common in x and z is φ(x)·φ(z).

This gives us the kernel.

8 0
4 years ago
Which of the following is the most reliable way to check the accuracy of a website?
ELEN [110]

Answer:

Examine the sources cited by the website

Explanation:

Due to the ability for everyone to create a website, and that there are no governing standards on the quality of information given on websites, it is important when conducting research to ensure that the sources on the web are up to date, accurate, and provide an objective view

Therefore, it is important to go through and examine the website critically using the the following criteria

1) The website coverage

2) The currency of the website's information

3) Weather the website is objective or not

4) The identity of the author of the website and the ability to contact the author

5) The accuracy of the information contained in the website

3 0
3 years ago
Other questions:
  • Using the SUM function allows a series of numbers to be 1. Multiplied 2. Subtracted 3 Added 4. Divided
    11·1 answer
  • In c++
    9·1 answer
  • ________________ is a new method or idea or product or enhancement or other means of adding value to an existing product, such t
    14·1 answer
  • You're going to be mowing lawns as a summer job. How long will it take for your
    14·1 answer
  • A(n) _____ is an organized collection of people, procedures, software, databases, and devices that stores and retrieves knowledg
    6·1 answer
  • What came after the Phonograph
    13·2 answers
  • (Display four patterns using loops) Ask the user to enter an integer to
    8·1 answer
  • Which of the following is the most appropriate unit to describe the rate at which data is transferred using the internet?
    6·2 answers
  • Which of the following Web sites would be MOST credible?
    6·1 answer
  • Images that are made up of pixels and cannot be resized without losing quality?
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!